Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sorting on a mesh-connected parallel computer

Sorting on a mesh-connected parallel computer Two algorithms are presented for sorting n 2 elements on an n × n mesh-connected processor array that require O (n) routing and comparison steps. The best previous algoritmhm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional arrays are also given. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Sorting on a mesh-connected parallel computer

Communications of the ACM , Volume 20 (4) – Apr 1, 1977

Loading next page...
 
/lp/association-for-computing-machinery/sorting-on-a-mesh-connected-parallel-computer-5sXdLtcJAZ

References (11)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1977 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/359461.359481
Publisher site
See Article on Publisher Site

Abstract

Two algorithms are presented for sorting n 2 elements on an n × n mesh-connected processor array that require O (n) routing and comparison steps. The best previous algoritmhm takes time O(n log n). The algorithms of this paper are shown to be optimal in time within small constant factors. Extensions to higher-dimensional arrays are also given.

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Apr 1, 1977

There are no references for this article.