Open AccessANALISA KOMPUTASI PARALEL MENGURUTKAN DATA DENGAN METODE RADIX DAN SELECTION
Author(s) -
Favorisen Rosyking Lumbanraja,
Aristoteles Aristoteles,
Nadila Rizqi Muttaqina
Publication year - 2020
Publication title -
jurnal komputasi/jurnal komputasi
Language(s) - English
Resource type - Journals
eISSN - 2541-0350
pISSN - 2541-0296
DOI - 10.23960/komputasi.v8i2.2662
Subject(s) - sort , computer science , parallel computing , decimal , selection (genetic algorithm) , computation , radix (gastropod) , process (computing) , arithmetic , algorithm , mathematics , artificial intelligence , database , programming language , botany , biology
Increasing computing power is now achieved by replacing the programming paradigm with parallel programming. Parallel computing is a method of solving problems by dividing the computational load into small parts of the computation sub-process. This study describes the comparative analysis of parallel computations in the Selection Sort and Radix Sort algorithms. The data used are in the form of whole numbers and decimal numbers totaling 100 to 2 million data. The test was carried out with three scenarios, namely using two processors, four processors, and 3 computers connected to each other via a LAN network. The results showed that the parallel Selection Sort algorithm for small data was better than the parallel Radix Sort. On the other hand, parallel Radix Sort is better for millions of data than Selection Sort.