Sloping-and-shaking

Gao, Qingshi; Liu, Zhiyong

doi:10.1007/bf02916597

Cited by 5 publications

(44 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparison of latencies of sorting networks of N = n p inputs via the SS-Mk in [14] and our implementation. p = 2 p = 3 p = 4 [14] 1 + n 1 + 2n + ⌈log 2 n⌉…”

Section: Tablementioning

confidence: 99%

“…However, a 2-way merge is still used for the merging process. In [14], an n-way merging algorithm, named SS-Mk, based on the modified columnsort was proposed 2 with n-sorters as basic building blocks, where n is prime. For n sorted lists of m values each, the idea is to sort the m × n values first in each row and then in slope lines with decreasing slope rates.…”

Section: Introductionmentioning

confidence: 99%

“…• We analyze the performance of our approach by deriving the closed-form expressions of the latency and the number of sorters. We also derive the closed-form expression of the number of sorters for the SS-Mk [14], since it was not provided in [14]. Then we present extensive comparisons between the latency and the number of sorters required by our approach and the SS-Mk [14].…”

Section: Introductionmentioning

confidence: 99%

“…We also derive the closed-form expression of the number of sorters for the SS-Mk [14], since it was not provided in [14]. Then we present extensive comparisons between the latency and the number of sorters required by our approach and the SS-Mk [14]. • Finally, we show an implementation of a binary sorting network in threshold logic.…”

Section: Introductionmentioning

confidence: 99%

“…A modification of Leighton's columnsort algorithm was given in [8]. In [14], [15], merging networks with n-sorters as basic blocks are introduced based on the modified Leighton's columnsort algorithm.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An enhanced multiway sorting network based on n-sorters

Shi

Yan

Wagh

2014

2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

View full text Add to dashboard Cite

Abstract-Merging-based sorting networks are an important family of sorting networks. Most merge sorting networks are based on 2-way or multi-way merging algorithms using 2-sorters as basic building blocks. An alternative is to use n-sorters, instead of 2-sorters, as the basic building blocks so as to greatly reduce the number of sorters as well as the latency. Based on a modified Leighton's columnsort algorithm, an n-way merging algorithm, referred to as SS-Mk, that uses n-sorters as basic building blocks was proposed. In this work, we first propose a new multiway merging algorithm with n-sorters as basic building blocks that merges n sorted lists of m values each in 1 + ⌈m/2⌉ stages (n ≤ m). Based on our merging algorithm, we also propose a sorting algorithm, which requires O(N log 2 N ) basic sorters to sort N inputs. While the asymptotic complexity (in terms of the required number of sorters) of our sorting algorithm is the same as the SS-Mk, for wide ranges of N , our algorithm requires fewer sorters than the SS-Mk. Finally, we consider a binary sorting network, where the basic sorter is implemented in threshold logic and scales linearly with the number of inputs, and compare the complexity in terms of the required number of gates. For wide ranges of N , our algorithm requires fewer gates than the SS-Mk.

show abstract

“…Comparison of latencies of sorting networks of N = n p inputs via the SS-Mk in [14] and our implementation. p = 2 p = 3 p = 4 [14] 1 + n 1 + 2n + ⌈log 2 n⌉…”

Section: Tablementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%