How evenly should one divide to conquer quickly?
Information Processing Letters
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
Parallel Quicksort Using Fetch-And-Add
IEEE Transactions on Computers
Parallel Quicksort in hypercubes
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Computer architecture (2nd ed.): design and performance
Computer architecture (2nd ed.): design and performance
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A sorting algorithm on a PC cluster
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Von Neumann's First Computer Program
ACM Computing Surveys (CSUR)
Introduction to algorithms
Computing in Science and Engineering
Efficient Massively Parallel Quicksort
IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Support for parallel generic programming
Support for parallel generic programming
Multithreaded architectures and the sort benchmark
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
Computer Architecture, Fourth Edition: A Quantitative Approach
Computer Architecture, Fourth Edition: A Quantitative Approach
Parallel Programmability and the Chapel Language
International Journal of High Performance Computing Applications
C++ how to program, sixth edition
C++ how to program, sixth edition
Issue Mechanism for Embedded Simultaneous Multithreading Processor
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Automated tuning in parallel sorting on multi-core architectures
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
An Implementation of Sorting Algorithm Based on Java Multi-thread Technology
ICCSEE '12 Proceedings of the 2012 International Conference on Computer Science and Electronics Engineering - Volume 01
| Hi-index | 0.00 |
Sorting huge amounts of datasets have become essential in many computer applications, such as search engines, database and web-based applications, in order to improve searching performance. Moreover, due to the witnessed prevalence of the commercial Simultaneous Multithreaded architecture (SMT), parallel programming using multithreading becomes a dire need for efficiently using all available hardware resources for one application. In this paper, one of the efficient and quick algorithms, the Quicksort, is applied as a parallel multithreaded algorithm on SMT architecture, where virtual parallelization has been achieved using the POSIX threads (Pthreads) library. The proposed algorithm is evaluated and compared with its sequential counterpart. The obtained analytical and experimental results reveal that multithreading is a viable technique for implementing the parallel Quicksort algorithm efficiently on SMT architecture, where it has been shown both analytically and experimentally that the parallel multithreaded Quicksort algorithm outperforms the sequential Quicksort algorithm in terms of various performance metrics including; time complexity and speedup.