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

Efficient scalable mesh algorithms for merging, sorting and selection

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

1 Author(s)
Ramnath, S. ; Dept. of Comput. Sci., St. Cloud State Univ., MN, USA

Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from √n×√n to n×n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-ε) and log4/3 n respectively, of the optimal

Published in:

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Date of Conference:

15-17 Mar 1995

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.