2002 · 20 citations · 14 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingCommunication OverheadDistributed Memory ParallelismInterprocess CommunicationParallel Computer ArchitectureParallel Computing SystemsParallel SortingBitonic SortCommunication-avoiding SortingExecution Time AnalysisKeysParallel Sort AlgorithmsParallel Sorting AlgorithmsReduce CommunicationSorting
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Bitonic sorting can be parallelized, however, a great portion of execution time is consumed due to O(log/sup 2/P) time of data exchange of N/P keys where P, N are the number of processors and keys, respectively. This paper presents an efficient way of data communication in bitonic sort to minimize the interprocessor communication and comparison time. Before actual data movement, each pair processor exchanges the minimum and maximum in its list of keys to determine which keys are to be sent to its partner. Very often no keys need to exchange, or only a fraction of them are exchanged. At least 20% or greater of execution time could be reduced on the T3E computer in our experiments. We believe the scheme is a good way to shorten the communication time in similar applications.
14
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
A survey of wormhole routing techniques in direct networks
Lionel M. Ni, Philip K. McKinley · Computer · 1993 · 1.4K citations
Optimal Sorting Algorithms for Parallel Computers
Baudet, Stevenson · IEEE Transactions on Computers · 1978 · 157 citations