๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel sorting algorithms for tightly coupled multiprocessors

โœ Scribed by Michael J. Quinn

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
663 KB
Volume
6
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sorting with near linear speed-up on tig
Sorting with near linear speed-up on tightly coupled multiprocessors
โœ Wheat, Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 582 KB

A new parallel sorting algorithm, called parsort, suitable for implementation on tightly coupled multiprocessors is presented. The algorithm is based upon quicksort and two-way merging. An asynchronous parallel partitioning algorithm is used to distribute work evenly during merging to ensure a good