Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System

He, Min; Wu, Xiaolong; Zheng, S. Q.; Englert, Burkhard

doi:10.1109/tpds.2009.68

Cited by 7 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…He et al proposed two novel optimal sorting algorithms based on a model that uses linear array with The Linear Array with Reconfigurable Pipelined Bus System (LARPBS) [14]. The first one is an extension of Leighton's seven-phase column sort algorithm and the second is an optimal multiway merge sort algorithm.…”

Section: Related Workmentioning

confidence: 99%

Parallel Multidimensional Lookahead Sorting Algorithm

et al. 2019

View full text Add to dashboard Cite

This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads, word size, memory/processor communication overhead, and the dimension of the algorithm. The proposed technique is ideally suited for general purpose graphic processing units and shared-memory massively parallel processor systems. It ensures that data being processed exhibits temporal and spatial locality to maximize the utilization of processor cache. The algorithm achieves a speedup even when a single processor is used. A lookahead algorithm is also proposed to achieve even higher speedup. The performance of the proposed algorithm is verified numerically and experimentally.

show abstract

Section: Related Workmentioning

confidence: 99%