Parallel sorting on ILLIAC array processor

Authors:
Masumeh Damrudi;Kamal Jadidy Aval
Affiliations:
Computer Science, Islamic Azad University of Firuzkuh, Firuzkuh, Iran;Computer Science, Islamic Azad University of Firuzkuh, Firuzkuh, Iran
Venue:
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
Year:
2007

Citing 5
Cited 4

Multiway Merging in Parallel

IEEE Transactions on Parallel and Distributed Systems
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 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

A performance study of general-purpose applications on graphics processors using CUDA

Journal of Parallel and Distributed Computing
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

Nowadays, we need to speed up solving computer problems such as sorting. Because of limitations in processor's speed, using parallel algorithms is inevitable. In parallel algorithms, because of cost limitations and architecture complexity, it's not suitable to increase the number of processors to speed up. This is also infeasible where we have plenty of data. In this paper we issue a new sorting algorithm. The algorithm is implemented on ILLIAC architecture. The aim of issued algorithm is to reduce total cost of sorting with a trade off between the number of processors and execution time.