Title :
Integer sorting in O(1) time on an n*n reconfigurable mesh
Author :
Olariu, S. ; Schwing, J.L. ; Zhang, J.
Author_Institution :
Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA
Abstract :
A constant-time integer sorting algorithm on a reconfigurable mesh is presented. More specifically, a sequence of n integers can be sorted in O(1) time on a reconfigurable mesh of size n*n. As applications of integer sorting, a constant-time algorithm to convert an edge-list representation of a graph to an adjacency-list representation and a constant-time algorithm to convert a parent-pointer representation of a rooted tree to standard form are described.<>
Keywords :
data structures; parallel algorithms; reconfigurable architectures; sorting; O(1) time; adjacency-list representation; constant-time integer sorting algorithm; edge-list representation; n*n reconfigurable mesh; parent-pointer representation; rooted tree; Algorithm design and analysis; Arithmetic; Broadcasting; Computer science; Concurrent computing; Data structures; Parallel machines; Sorting; Tree graphs; Very large scale integration;
Conference_Titel :
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-7803-0605-8
DOI :
10.1109/PCCC.1992.200594
