Comparative Analysis for Quick Sort Algorithm under four Different Modes of Execution
Mohammad Fasha

TL;DR
This paper compares the performance of the Quick Sort algorithm across four execution modes, including sequential, multi-threaded, OpenMP, and supercomputing, analyzing their efficiency and limitations.
Contribution
It provides a comprehensive performance comparison of Quick Sort under various parallel and sequential execution modes, highlighting potential improvements.
Findings
Parallel modes improve sorting speed for large arrays.
OpenMP implementation shows significant performance gains.
Limitations of sequential Quick Sort identified.
Abstract
This work presents a comparison for the performance of sequential sorting algorithms under four different modes of execution, the sequential processing mode, a conventional multi-threading implementation, multi-threading with OpenMP Library and finally parallel processing on a super computer. Quick Sort algorithm was selected to run the experiments performed by this effort and the algorithm was run using different arrays sizes and different number of processors. The results and findings were analyzed uncovering limitations as well as enhancement potentials of sequential sorting algorithms using parallelism.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression
