Communication-Efficient Parallel Sorting
Published in SIAM Journal on Computing • Jan 1, 1999
NobleIDNI7P42W26R10S56
Authors:
Michael T. Goodrich
Abstract
We study the problem of sorting n numbers on a p-processor bulk-synchronous parallel (BSP) computer, which is a parallel multicomputer that allows for general processor-to-processor communication rounds provided each processor sends and receives at most h items in any round. We provide parallel sort...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!