ROE sorting on ILLIAC array processor

Authors:
Masumeh Damroudi;Mohammad R. Salehnamadi;Kamal Jadidy Aval
Affiliations:
Computer Science Department, Islamic Azad University of Firuzkuh, Firukuh, Iran;Computer Science Department, Islamic Azad University of Firuzkuh, Firukuh, Iran;Computer Science Department, Islamic Azad University of Firuzkuh, Firukuh, Iran
Venue:
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Year:
2008

Citing 10
Cited 3

Parallel Sorting in Two-Dimensional VLSI Models of Computation

IEEE Transactions on Computers
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
Multiway Merging in Parallel

IEEE Transactions on Parallel and Distributed Systems
Bounds to Complexities of Networks for Sorting and for Switching

Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Parallel Sorting Algorithms

Parallel Sorting Algorithms
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
Bitonic Sort on a Mesh-Connected Parallel Computer

IEEE Transactions on Computers

ENOD sort on diamond architecture

SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
A new parallel sorting on diamond architecture

ECC'10 Proceedings of the 4th conference on European computing conference
ENOD sort on diamond architecture

ELECTRO'10 Proceedings of the 8th WSEAS international conference on Applied electromagnetics, wireless and optical communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an algorithm for sorting on ILLIAC architecture. We need to speed up solving computer problems such as sorting. Because of limitations in processor's speed, using parallel algorithms is inevitable. This algorithm sorts 2N data elements using N processors with a running time of O(√N). The aim of issued algorithm is to reduce total cost of sorting with a trade off between the number of processors and execution time.