By Topic

Integer sorting on a mesh-connected array of processors

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)
Krizanc, D. ; Dept. of Comput. Sci., Rochester Univ., NY, USA

Schnorr and Shamir and independently Kunde, have shown that sorting N=n2 inputs into snake-like ordering on a n×n mesh requires 3n-o(n) steps. Using a less restrictive, more realistic model the author shows that the sorting N=n 2 integers in the range [1. . .N] can be performed in 2n+o(n) steps on a n×n mesh

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990