This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1982 (vol. 31 no. 12)
pp. 1192-1201
H. Yasuura, Department of Information Science, Faculty of Engineering, Kyoto University
We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.
Index Terms:
VLSI, Bus connected cellular array, database machine, merging, multikey sort, parallel enumeration sort, parallel sorting algorithm, pipeline, sorting
Citation:
H. Yasuura, N. Takagi, S. Yajima, "The Parallel Enumeration Sorting Scheme for VLSI," IEEE Transactions on Computers, vol. 31, no. 12, pp. 1192-1201, Dec. 1982, doi:10.1109/TC.1982.1675943
Usage of this product signifies your acceptance of the Terms of Use.