This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter
January 1999 (vol. 10 no. 1)
pp. 23-28

Abstract—We present a strategy for designing stable insertion sorters based on linear arrays with data-driven control. The novelty of our approach lies in each data item carrying a control tag to specify how it is to be operated upon by a receiving cell and in performing two parallel comparisons within each cell. To assure first-in/first-out handling of equal key values, some data items must be marked to reflect their past histories. Such marking is conveniently carried out by modifying the data item's control tag. It is the combination of the above features that allows us to derive the first single-cycle priority queue that operates in fully pipelined mode, with no broadcasting of data values or control signals. By performing more than two parallel comparisons in each cell, the VLSI implementation cost of our stable sorter can be reduced. We show that highly cost-effective designs can be obtained by selecting an optimal cell size in terms of the number of comparators it contains.

[1] M. Afghahi and C. Svensson, "Performance of Synchronous and Asynchronous Schemes for VLSI Systems," IEEE Trans. Computers, vol. 41, no. 7, pp. 858-872, July 1992.
[2] B. Ahn and J.M. Murray, "A Pipelined, Expandable VLSI Sorting Engine Implemented in CMOS Technology," Proc. IEEE Int'l Conf. Circuits and Systems, pp. 134-137,Portland, Ore., May 1989.
[3] D. Audet, Y. Savaria, and N. Arel, "Pipelined Communications in Large VLSI/ULSI Systems," IEEE Trans. VLSI Systems, vol. 2, pp. 1-10, Mar. 1994.
[4] T.C. Chen, V.Y. Lum, and C. Tung, "The Rebound Sorter: An Efficient Sort Engine for Large Files," Proc. Fourth Int'l Conf. Very Large Databases, pp. 312-318, 1978.
[5] S. Karthik, I. de Souza, J.T. Rahmeh, and J.A. Abraham, "Interlocking Scheme for Micropipelines: Application to a Self-Timed Rebound Sorter," Proc. IEEE Int'l Conf. Computer Design, pp. 393-396,Cambridge, Mass., Oct. 1991.
[6] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[7] C.-Y. Lee and J.-M. Tsai, "A Shift Register Architecture for High-Speed Data Sorting," J. VLSI Signal Processing, vol. 11, pp. 273-280, Nov. 1995.
[8] D.T. Lee, H. Chang, and C.K. Wong, "An On-Chip Compare/Steer Bubble Sorter," IEEE Trans. Computers, vol. 30, no. 6, pp. 396-405, June 1981.
[9] Y.-C. Lin, "On Balancing Sorting on a Linear Array," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 5, pp. 566-571, May 1993.
[10] C. Mead and M. Rem, "Minimizing Propagation Delays in VLSI," IEEE J. Solid-State Circuits, vol. 17, pp. 773-775, Aug. 1982.
[11] J.D. Meindl, “Gigascale Integration: Is the Sky the Limit?” IEEE Circuits and Devices Magazine, vol. 12, no. 6, pp. 19-24, Nov. 1996.
[12] S.W. Moore and B.T. Graham, "Tagged Up/Down Sorter—A Hardware Priority Queue," The Computer J., vol. 38, pp. 695-703, Sept. 1995.
[13] B. Parhami, Introduction to Parallel Processing. Plenum, 1999.
[14] D. Picker and R.D. Fellman, "VLSI Priority Packeet Queue with Inheritance and Overwrite," IEEE Trans. VLSI, vol. 3, pp. 245-253, June 1995.
[15] H. Yasuura, N. Takagi, and S. Yajima, "The Parallel Enumeration Sorting Scheme for VLSI," IEEE Trans. Computers, vol. 31, no. 12, pp. 1,192-1,201, Dec. 1982.
[16] Y. Zhang and S.Q. Zheng, "Design and Analysis of a Systolic Sorting Architecture," Proc. Seventh IEEE Symp. Parallel and Distributed Processing, pp. 652-659, Oct. 1995.

Index Terms:
Data-driven architectures, distributed control, FIFO, linear processor arrays, priority queue, stable sorting, tagged insertion sorter, VLSI.
Citation:
Behrooz Parhami, Ding-Ming Kwai, "Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 1, pp. 23-28, Jan. 1999, doi:10.1109/71.744832
Usage of this product signifies your acceptance of the Terms of Use.