A new parallel sorting on diamond architecture

Authors:
Masumeh Damrudi;Kamal Jadidy Aval
Affiliations:
Computer Science Department, Islamic Azad University, Firuzkuh, Iran;Computer Science Department, Islamic Azad University, Firuzkuh, Iran
Venue:
ECC'10 Proceedings of the 4th conference on European computing conference
Year:
2010

Citing 7
Cited 0

A lower bound on the size of shellsort sorting networks

SIAM Journal on Computing
The worst case in Shellsort and related algorithms

Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)

Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers (2nd Edition)
Multi-mesh of trees with its parallel algorithms

Journal of Systems Architecture: the EUROMICRO Journal
Parallel sorting on ILLIAC array processor

ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
ROE sorting on ILLIAC array processor

ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a novel sorting algorithm which is implemented on Diamond architecture. This algorithm sorts n data elements with 7/4n processors. There are various architectures which use parallel algorithms but we always attempt to find new and optimal ones. Sorting algorithms with minimum comparisons, while there is no need for extra space to store data elements, is always concerned as standing open problem. This EREW PRAM algorithm runs n data elements in O(log2 n) time using 7/4n processors.