Sciweavers

SPAA
1993
ACM
13 years 11 months ago
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
Thomas H. Cormen, Leonard F. Wisniewski
ICS
1992
Tsinghua U.
13 years 11 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
ICS
1992
Tsinghua U.
13 years 11 months ago
Optimizing for parallelism and data locality
Previous research has used program transformation to introduce parallelism and to exploit data locality. Unfortunately,these twoobjectives have usuallybeen considered independentl...
Ken Kennedy, Kathryn S. McKinley
ICS
1992
Tsinghua U.
13 years 11 months ago
A general algorithm for data dependence analysis
Christine Eisenbeis, Jean-Claude Sogno
ICS
1992
Tsinghua U.
13 years 11 months ago
Tolerating data access latency with register preloading
William Y. Chen, Scott A. Mahlke, Wen-mei W. Hwu, ...
ICPP
1992
IEEE
13 years 11 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss
ICPP
1992
IEEE
13 years 11 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç