Author : Washington State University. Department of Computer Science
Publisher :
ISBN 13 :
Total Pages : 27 pages
Book Rating : 4.:/5 (123 download)
Book Synopsis Time-space Optimal Parallel Merging and Sorting by : Washington State University. Department of Computer Science
Download or read book Time-space Optimal Parallel Merging and Sorting written by Washington State University. Department of Computer Science and published by . This book was released on 1989 with total page 27 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "A parallel algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space per processor even when the number of processors is fixed. Previously published parallel merging and sorting algorithms fail to meet at least one of these criteria. In this paper, we present a parallel merging algorithm that, on an EREW PRAM with k processors, merges two sorted lists of total length n in O(n/k + log n). We also describe a stable version of our parallel merging algorithm that is similarly time- space optimal on an EREW PRAM. These two parallel merges naturally lead to time-space optimal parallel sorting algorithms."