Cart (Loading....) | Create Account
Close category search window

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen, J. ; UMIST, Department of Electrical Engineering, Manchester, UK ; Dagless, E.L. ; Guo, Y.

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.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:131 ,  Issue: 2 )

Date of Publication:

March 1984

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.