A Practical Performance Comparison of Parallel Sorting Algorithms on Homogeneous Network of Workstations

@inproceedings{Qureshi2006APP,
  title={A Practical Performance Comparison of Parallel Sorting Algorithms on Homogeneous Network of Workstations},
  author={Kalim Qureshi},
  booktitle={PDPTA},
  year={2006}
}
Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. A homogeneous cluster of workstations has been used to compare the algorithms implemented. The MPI library has been selected to establish the communication and synchronization between the processors. The time complexity for each parallel sorting algorithm will also be mentioned… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Practical Performance Comparison of Parallel Matrix Multiplication Algorithms on Network of Workstations.

Kalim Qureshi, Haroon Rashid, “A
IEE Transaction Japan, • 2005

A Practical Performance Comparison of Two Parallel Fast Fourier Transform Algorithms on Cluster of PCS ”

Kalim Qureshi, Masahiko Hatanaka
2004

Rashid,“ A Practical Performance Comparison of Two Parallel Fast Fourier Transform Algorithms on Cluster of PCS

Kalim Qureshi, Haroon
IEE Transaction Japan, • 2004

A Practical Approach of Task Partitioning and Scheduling on Heterogeneous Parallel Distributed Image Computing System,

Kalim Qureshi, Masahiko Hatanaka
Transaction of IEE Japan, Vol. 120-C, • 2000

A parallel exchange sort algorithm

Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings • 1989