DocumentCode :
2184922
Title :
The distance bound for sorting on mesh-connected processor arrays is tight
Author :
Ma, Yiming ; Sen, Sandeep ; Scherson, Isaac D.
fYear :
1986
fDate :
27-29 Oct. 1986
Firstpage :
255
Lastpage :
263
Abstract :
In this paper, We consider the problem of sorting n2 numbers, initially distributed randomly in an n × n mesh-connected processor array with one element per processor. We show a lower bound, based on distance arguments, of 4n routing steps on mesh-connected processors operating in an SIMD mode with no wraparounds in rows or columns, We present an algorithm using a novel approach, which is optimal upto the conslant of the leading term, and hence, succeed in proving the tightness of the lower bound based on distance. Keeping in mind the practical difficulties in implementation of this algorithm, we also present an extremely practical O(n) algorithm amenable for VLSI implementation and for existing mesh- connected computers. All the results in this paper were derived by using a new method of analysis inspired by the discovery of shear-sort or row-column sort.
Keywords :
Algorithm design and analysis; Computational modeling; Gold; Indexing; Routing; Sorting; Spine; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1986., 27th Annual Symposium on
Conference_Location :
Toronto, ON, Canada
ISSN :
0272-5428
Print_ISBN :
0-8186-0740-8
Type :
conf
DOI :
10.1109/SFCS.1986.54
Filename :
4568216
Link To Document :
بازگشت