234 search results - page 4 / 47 » Sorting and Selection on Distributed Memory Bus Computers |
EUROPAR
1997
Springer
14 years 22 days ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
CODES
2004
IEEE
14 years 9 days ago
2004
IEEE
Separation between computation and communication in system design allows the system designer to explore the communication architecture independently of component selection and map...
IPPS
1998
IEEE
14 years 25 days ago
1998
IEEE
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
IEEEPACT
2006
IEEE
14 years 2 months ago
2006
IEEE
The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to critical information leakage such as encryp...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...