Optimized Parallel Sorting of 2D Arrays Using Row-Major Division and Final Merging Strategy

Author(s)	Ayaan Al Bari
Country	India
Abstract	In this paper, we present a novel approach to sorting 2D arrays that leverages row-major order partitioning followed by a single, parallelized merging stage. We demonstrate how this method optimizes cache usage and reduces overhead in high-performance computing environments. Our results indicate significant performance improvements compared to traditional parallel sorting techniques, particularly in large-scale datasets
Keywords	2D arrays, parallel sorting, row-major order, high-performance computing, merging algorithms, cache optimization
Field	Computer
Published In	Volume 6, Issue 6, November-December 2024
Published On	2024-11-07
Cite This	Optimized Parallel Sorting of 2D Arrays Using Row-Major Division and Final Merging Strategy - Ayaan Al Bari - IJFMR Volume 6, Issue 6, November-December 2024. DOI 10.36948/ijfmr.2024.v06i06.30144
DOI	https://doi.org/10.36948/ijfmr.2024.v06i06.30144
Short DOI	https://doi.org/g8qfsp

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9898-5948-55	editor@ijfmr.com

International Journal For Multidisciplinary Research