In this paper we propose a new approach to building multithreaded uniprocessors that become building blocks in high-end computing architectures. Our innovativeness stems from a multithreaded architecture with non-blocking threads where all memory accesses are decoupled from the thread execution. Data is pre-loaded into the thread context (registers), and all results are post-stored after the co...

Some level{2 and level{3 Distributed Basic Linear Algebra Subroutines (DBLAS) that have been implemented on the Connection Machine system CM{200 are described. No assumption is made on the shape or size of the operands. For matrix{matrix multiplication , both the nonsystolic and the systolic algorithms are outlined. A systolic algorithm that computes the product matrix in{place is described in ...

We propose a simple parallel algorithm for finding a blocking flow in an acyclic network. On an n-vertex, rn-arc network, our algorithm runs in 0(n log n) time and 0(nm) space using an mprocessor EREW PRAM. A consequence of our algorithm is an 0(n 2 (log n)log(nC))-time, O(nm)space, m-processor algorithm for the minimum-cost circulation problem, on a network with integer arc capacities of magni...

Castor plant (Ricinus communis L.) produces a unique seed oil with numerous industrial applications. However, castor seed contains toxin ricin and hyper-allergenic 2S albumins detrimental to castor grower and processor. Our project goal is to develop a safe source of castor oil through genetic engineering. The general approach is to generate a safe castor crop by blocking expression of the rici...

Massively parallel algorithms are presented for solving systems of fixed point equations, modeling state-dependent routing in large asymmetric circuit-switched networks. Our focus is on the Aggregated Least Busy Alternative (ALBA) routing policy of Mitra, Gibbens and Huang. On a 16384 processor MasPar parallel computer, about a minute is required to compute estimates of the call blocking probab...

The PIDOTS neutral particle transport code utilizes a red/black implementation of the Parallel Gauss-Seidel algorithm to solve SN approximation neutron equation on 3D Cartesian meshes. is designed for execution massively parallel platforms and capable using full resources modern, leadership class high performance computers. Initial testing revealed that some configurations PIDOTS’s Integral Tra...

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...