Now showing items 1-6 of 6
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of efficient parallel algorithms for this ...
Practical Parallel Algorithms for Personalized Communication and Integer Sorting
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which efficiently execute on general-purpose parallel machines. With the emergence of message passing standards ...
A Randomized Parallel Sorting Algorithm with an Experimental Study
Previous achemes for sorting on general-purpose parallel machines have had to choose betwen poor load balancing and irregular communication or multiple rounds of all-to-all personalized communication. In this paper, ...
Sorting on Clusters of SMPs
Clusters of symmetric multiprocessors (SMPs) have emerged as the primary candidates for large scale multiprocessor systems. In this paper, we introduce an efficient sorting algorithm for clusters of SMPs. This algorithm ...
A Parallel Sorting Algorithm With an Experimental Study
Previous schemes for sorting on general-purpose parallel machines have had to choose between poor load balancing and irregular communication or multiple rounds of all-to-all personalized communication. In this paper, ...
A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good ...