F. R. Lumbanraja, Aristoteles Aristoteles, Nadila Rizqi Muttaqina
{"title":"平行计算分析使用放射和筛选方法对数据进行排序","authors":"F. R. Lumbanraja, Aristoteles Aristoteles, Nadila Rizqi Muttaqina","doi":"10.23960/KOMPUTASI.V8I2.2662","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":292117,"journal":{"name":"Jurnal Komputasi","volume":"846 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"ANALISA KOMPUTASI PARALEL MENGURUTKAN DATA DENGAN METODE RADIX DAN SELECTION\",\"authors\":\"F. R. Lumbanraja, Aristoteles Aristoteles, Nadila Rizqi Muttaqina\",\"doi\":\"10.23960/KOMPUTASI.V8I2.2662\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":292117,\"journal\":{\"name\":\"Jurnal Komputasi\",\"volume\":\"846 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Komputasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23960/KOMPUTASI.V8I2.2662\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Komputasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23960/KOMPUTASI.V8I2.2662","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ANALISA KOMPUTASI PARALEL MENGURUTKAN DATA DENGAN METODE RADIX DAN SELECTION
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
