Sciweavers

IPPS
1998
IEEE
13 years 8 months ago
Impact of Switch Design on the Application Performance of Cache-Coherent Multiprocessors
In this paper, the effect of switch design on the application performance of cache-coherent non-uniform memory access (CC-NUMA) multiprocessors is studied in detail. Wormhole rout...
Laxmi N. Bhuyan, Hu-Jun Wang, Ravi R. Iyer, Akhile...
IPPS
1998
IEEE
13 years 8 months ago
Hardware Reconfigurable Neural Networks
Jean-Luc Beuchat, Jacques-Olivier Haenni, Eduardo ...
IPPS
1998
IEEE
13 years 8 months ago
Rapid Development of Real-Time Systems Using RTExpress
This paper presents the RTExpressTM environment which is a software tool that assists a user in rapidly developing real-time embedded systems. RTExpressTM is a compiler and runtim...
Milissa M. Benincasa, Richard Besler, Diane Brassa...
IPPS
1998
IEEE
13 years 8 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
IPPS
1998
IEEE
13 years 8 months ago
Optimizing Parallel Applications for Wide-Area Clusters
Recent developments in networking technology cause a growing interest in connecting local-area clusters of workstations over wide-area links, creating multilevel clusters, or meta...
Henri E. Bal, Aske Plaat, Mirjam G. Bakker, Peter ...
IPPS
1998
IEEE
13 years 8 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
IPPS
1998
IEEE
13 years 8 months ago
Vector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel Machines
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split ...
Seungjo Bae, Dongmin Kim, Sanjay Ranka
IPPS
1998
IEEE
13 years 8 months ago
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks
Fully-populated tori, where every node has a processor attached, do not scale well since load on edges increases superlinearly with network size under heavy communication, resulti...
M. Cemil Azizoglu, Ömer Egecioglu