Data-driven control scheme for linear arrays: application to a stable insertion sorter

Abstract

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.

A Streaming High-Throughput Linear Sorter System with Contention Buffering

“…A special case of the systolic priority queue occurs if all inputs are loaded before starting queue extraction. The priority queue then becomes a systolic sorter [12], but the system requires a systolic array length equal to the number of all input elements to be sorted.…”

Edge-pancyclicity and path-embeddability of bijective connection graphs

“…as guest graphs [1,12,13,15,16,18,23,25,30], because these interconnection architectures are widely used in parallel computing systems. In particular, paths are the common structures used to model linear arrays in parallel processing [7,8,[20][21][22]24]. It is well known that cycles are popular interconnection architectures.…”

Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

“…Path embeddings are especially important because paths are the common structures used to model linear arrays in parallel processing [5], [6], [17], [18], [19], [20].…”