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

Algorithms for stable sorting to minimize communications in networks of workstations and their implementations in BSP

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 $13
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

2 Author(s)
Cerin, C. ; Univ. de Picardie, Amien, France ; Gaudiot, J.-L.

We introduce a novel approach to produce BSP (Bulk Synchronous Programming model) programs and we show their efficiency by implementing the stable sorting problem on clusters of PC. Experimental results on PCs based on Ethernet and Myrinet cards are compared with implementations on an SGI 2000. The algorithms presented in the paper are either developed under the theoretical framework of the Regular Sampling technique which guarantees good load balancing properties or are inspired by the technique in order to decrease the sequential work of each processor comparing to the Regular Sampling technique but impose no (theoretical) bound on load balancing. The main sequential block of code used in the algorithms for local sorting are derivatives of Shellsort (which is stable) and a new code based on Quicksort (which is not stable) plus a property on real numbers that is used for stable sorting under the framework of BSR (Broadcast with Selective Reduction)

Published in:

Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on

Date of Conference:


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.