Performance measurements of scheduling strategies and parallel algorithms for a multiprocessor quick sort

J. Chen, E.L. Dagless, Yi Guo · IEE Proceedings E Computers and Digital Techniques · 1984

A variety of parallel algorithms running under a contention scheduler and a master/slave scheduler and implemented on the CYBA-M multiprocessor are described and a new predistributed quick sort is reported. Results show speed up factors of 7.88 for 13 processors, and processor utilisations greater than 75% for 10 or more processors are predicted when sorting large lists with long keys.

Read the paper · More papers on PaperTik