Accelerating Large-Scale Sorting through Parallel Algorithms  

作　　者：Yahya Alhabboub Fares Almutairi Mohammed Safhi Yazan Alqahtani Adam Almeedani Yasir Alguwaifli Yahya Alhabboub;Fares Almutairi;Mohammed Safhi;Yazan Alqahtani;Adam Almeedani;Yasir Alguwaifli(College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia)

机构地区：[1]College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University, Dammam, Saudi Arabia

出　　处：《Journal of Computer and Communications》2024年第1期131-138,共8页电脑和通信（英文）

摘　　要：This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.

关 键 词：Sorting Algorithm Quick Sort QuickSort Parallel Parallel Algorithms 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]