A Novel Deterministic Sampling Scheme with Applications to Broadcast-Efficient Sorting on the Reconfigurable Mesh

Olariu, Stephan; Schwing, J.L.

doi:10.1006/jpdc.1996.0015

Cited by 27 publications

(10 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The R-mesh algorithm (using irregular decomposition) presented here, unlike previous R-mesh algorithms (using regular decomposition), looks a little complicated at first sight. In contrast to our intuition, it is very simple to implement on Rmeshes, and as broadcast-efficient as the best known results obtained by [22].…”

Section: Discussionmentioning

confidence: 83%

“…[8,9,14,18]). The irregular decomposition scheme can be tuned to use the same number of broadcasts as the best know result [22]. Our algorithm also has the desirable property of being scalable.…”

Section: Introductionmentioning

confidence: 99%

“…Then a list of n bits, b0, bl,..., bn'-I is computed, where bi--if the number in PE(i, 0) is less than C. Count the number of l's in the list of n bits on each Me. We apply the parallel prefix sum algorithm of [14,22] for this computation. It takes [log n'/log x/J iterations and requires 6 broadcasts.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Sorting on Reconfigurable Meshes:An Irregular Decomposition Approach

Lai

Sheng

1999

VLSI Design

View full text Add to dashboard Cite

Most algorithms for reconfigurable meshes (R-meshes) are based on the divide-and-conquer (DAC) strategy. Although the strategy per se does not require the subproblems to be equal in size, existing DAC algorithms for R-meshes do divide the problem approximately evenly. This paper demonstrates that dividing a problem evenly is not necessarily a good way to decompose a problem. There are occasions on which an irregular decomposition scheme may be preferable. We take this approach and obtain a new sorting algorithm. Our sorting algorithm has several strengths: it is simple, scalable, and as broadcast-efficient as the best known result.

show abstract

Section: Discussionmentioning

confidence: 83%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sorting on Reconfigurable Meshes:An Irregular Decomposition Approach

Lai

Sheng

1999

VLSI Design

View full text Add to dashboard Cite

show abstract

“…Computing models for a p-sorter do exist. For example, it is known that p elements can be sorted in yI time on a reconfigurable mesh of size p Â p [13], [17], [19], [20]. A reconfigurable mesh is a multiprocessor system in which the processors are connected by a bus system whose configuration can be dynamically changed to suit computational needs.…”

Section: Introductionmentioning

confidence: 99%

How to sort N items using a sorting network of fixed I/O size

Olariu

Pinotti

Zheng

1999

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

“…[4,6,10]. Perhaps the most typical examples of these RN-MESH algorithms are the constant time sorting algorithms [4,9,12,14,17]. Obviously, there is a constant bounding the number of steps required for sorting n numbers by an nxn RN-MESH.…”

Section: Introductionmentioning

confidence: 99%

Single Step Undirected Reconfigurable Networks

Ben-Asher

Schuster

1999

VLSI Design

View full text Add to dashboard Cite

The reconfigurable mesh (RN-MESH) can solve a large class of problems in constant time, including problems that require logarithmic time by other, even shared memory, models such as the PRAM with a similar number of processors [3]. In this work we show that for the RN-MESH these constants can always be reduced to one, still using a polynomial number of processors. Given a reconfigurable mesh that computes a set of values in constant time, we show that it can be simulated by a single step reconfigurable mesh with maximum size that is polynomial in the size of the original mesh. The proof is constructive, where the construction of the single step RN-MESH holds for the relatively weak undirected RN-MESH model. In this model broadcasts made on buses arrive at all nodes that belong to the undirected connected component of the transmitting processor. A result similar to the one that is obtained in this work was previously obtained for the directed reconfigurable mesh model (DRN) [5]. However, the construction for the DRN-MESH relies on the fact that the buses are directed, and thus cannot be applied to the undirected case. In addition, the construction presented here is simpler and uses significantly fewer processors than the one obtained for the DRN-MESH.

show abstract

A Novel Deterministic Sampling Scheme with Applications to Broadcast-Efficient Sorting on the Reconfigurable Mesh

Cited by 27 publications

References 33 publications

Sorting on Reconfigurable Meshes:An Irregular Decomposition Approach

Sorting on Reconfigurable Meshes:An Irregular Decomposition Approach

How to sort N items using a sorting network of fixed I/O size

Single Step Undirected Reconfigurable Networks

Contact Info

Product

Resources

About