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)
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
| Hi-index | 0.00 |
In this paper, we are extending The NOD sorting algorithm which is implemented on Diamond architecture. This algorithm which we named it ENOD (Extended Neighborhood sort On Diamond) sort n data elements with 7/4n processors. However, most popular environments provide little explicit support for parallelism. leading to the common view that "concurrency is hard". There are architectures and sorting algorithms that are used but we always endeavor to find new and optimal ones. The algorithm on the Diamond architecture sorts data elements using 7/4n processors with a running time of O(log2n). This architecture is heterogeneous and uses cheaper processors more than expensive ones. Though, this architecture with the issued algorithm makes a tradeoff between number of processors and their cost. The ENOD algorithm is simpler and more intuitive than the algorithms that are available.