Performance Analysis of Multi-threaded Sorting for Unsorted Data Using Remote Procedure Call

Distributed procedures that use a message-passing approach communicate with one another by transferring bits of information in order to provide unique access to all available tasks. Almost every single modern computer now has a CPU with several cores, which provides additional computing capacity. Moreover, parallel execution is critical in the new age of big data to enhance performance to a reasonable threshold. Indeed, parallelization brings with it additional issues that must be tack-led. However, parallel algorithms are studied and contrasted in comparison to their consecutive equivalents. In our paper, we look at sorting the unsorted numbers in distributed systems. Multi-threaded methods and performance, along with the difficulty of defining time, affect speed as well. Following that, an experiment was conducted in which a set of algorithms was implemented as well as the data was gathered through benchmarking and testing. To establish the validity of parallelization, the data were inspected and analyzed with its associated source code. A review was carried out in order to obtain a better idea of the scope of sorting algorithms and parallel computing. In this paper, a multi-sorting threading algorithm approach has been conducted based on previous work. The primary idea behind the algorithm is simple as well as Remote Procedure Calls (RPCs) approach has been used.