Optimal Parallel Sorting in Multi-level Storage

Download or read book Optimal Parallel Sorting in Multi-level Storage written by University of Texas at Austin. Dept. of Computer Sciences and published by . This book was released on 1993 with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt: Abstract: "We adapt the Sharesort algorithm of Cypher and Plaxton to run on various parallel models of multi-level storage, and analyze its resulting performance. Sharesort was originally defined in the context of sorting n records on an n-processor hypercubic network. In that context, it is not known whether Sharesort is asymptotically optimal. Nonetheless, we find that Sharesort achieves optimal time bounds for parallel sorting in multi-level storage, under a variety of models that have been defined in the literature."