scholarly journals ANALISIS PERBANDINGAN PERFORMA PEMROGRAMAN SEKUENSIAL DAN PARALEL DENGAN SKEMA UJI MATRIX, FILTER DAN QUICK SORT

2021 ◽  
Vol 6 (1) ◽  
pp. 19-24
Author(s):  
Griffani Megiyanto Rahmatullah ◽  
Andry Fajar Zulkarnain ◽  
M. Reza Hidayat
Keyword(s):  
Quick Sort

Komputasi sekuensial merupakan sebuah proses untuk melakukan pemecahan masalah dengan melakukan setiap langkah secara berurutan. Konsekuensi pemecahan sebuah masalah dengan menggunakan komputasi sekuensial adalah sebuah hasil akan muncul apabila langkah pengerjaan telah dilakukan. Pengembangan teknologi dari komputasi sekuensial adalah kom-putasi paralel yang melibatkan penggunaan sumber daya secara bersamaan. Khusus pada bidang IT, sumber daya tersebut dapat berupa core processor atau juga dimungkinkan untuk melibatkan graphical unit. Skema uji yang dilakukan yaitu ber-fokus pada perbandingan performa komputasi sekuensial dan komputasi paralel. Skema uji tersebut terdiri dari pengujian perkalian matrix, proses filter sebuah gambar, dan proses quick sort. Hasil skema uji 1 menunjukkan bahwa komputasi paralel dapat melakukan perkalian dengan dimensi 2000x2000 dengan hasil berkisar 4x lebih cepat dibandingkan komputasi serial. Berikutnya, hasil skema uji 2 menunjukkan proses filter dapat dilakukan oleh komputasi paralel dengan efisiensi 50% lebih baik menggunakan 4 buah core. Terakhir, hasil skema uji 3 menghasilkan nilai efektivitas tertinggi menggunakan CUDA yaitu berkisar 96% dengan proses quick sort pada data sebesar 32Mb.

Analisis Kinerja Algoritma Quick Double Merge Sort Paralel Menggunakan openMP

2020 ◽  
Vol 11 (2) ◽  
pp. 95-102
Author(s):  
I Nyoman Aditya Yudiswara ◽  
Abba Suganda
Keyword(s):  
Parallel Algorithms ◽  
The Other ◽  
Sorting Algorithm ◽  
Data Parallelism ◽  
Parallel Sorting ◽  
Sequential Algorithms ◽  
Sorting Algorithms ◽  
Merge Sort ◽  
Sort Algorithm ◽  
Quick Sort

Processor technology currently tends to increase the number of cores more than increasing the clock speed. This development is very useful and becomes an opportunity to improve the performance of sequential algorithms that are only done by one core. This paper discusses the sorting algorithm that is executed in parallel by several logical CPUs or cores using the openMP library. This algorithm is named QDM Sort which is a combination of sequential quick sort algorithm and double merge algorithm. This study uses a data parallelism approach to design parallel algorithms from sequential algorithms. The data used in this study are the data that have not been sorted and also the data that has been sorted is integer type which is stored in advance in a file. The parameter measured to determine the performance of the QDM Sort algorithm is speedup. In a condition where a large amount of data is above 4096 and the number of threads in QDM Sort is the same as the number of logical CPUs, the QDM Sort algorithm has a better speedup compared to the other parallel sorting algorithms discussed in this study. For small amounts of data it is still better to use sequential sorting algorithm.

scholarly journals RANCANG BANGUN SISTEM INFORMASI LOWONGAN KERJA DI JPC POLINEMA DENGAN METODE QUICK SORT

2018 ◽  
Vol 4 (4) ◽  
pp. 240
Author(s):  
Budi Harijanto ◽  
Deddy Kusbianto Purwoko Aji ◽  
Julia Intan Amini
Keyword(s):  
Quick Sort

Informasi batas waktu lowongan kerja JPC di Facebook keberadaanya bertumpuk dengan informasi-informasi yang baru. Sehigga sulit untuk menemukan informasi lowongan kerja yang sudah melewati batas waktu dan informasi lowongan kerja yang sesuai dengan kriteria pelamar.Dari permasalahan tersebut maka dibuat aplikasi Lowongan Kerja Di JPC Polinema yang mampu menampilkan informasi lowongan kerja berdasarkan batas waktu dan kriteria pelamar. Metode yang digunakan untuk mensorting semua informasi lowongan kerja yang masuk menggunakan metode Quick Sort. Hasil dari penelitian ini akan menampilkan lowongan kerja setelah melalui sorting dengan batas waktu dan kriteria data pelamar. Kriteria ini terdiri dari 6 kriteria yang berupa gender, jurusan, jenjang, umur, IPK, dan pengalaman kerja.

Dynamic Quick Sort Algorithmic Approach For Opitimizing Power And Spatial Mapping In SOC

2021 ◽  
Author(s):  
K. Sangeetha ◽  
K. Anuratha ◽  
R. Lakshmi Devi ◽  
S. Sweetline Shamini
Keyword(s):  
Spatial Mapping ◽  
Algorithmic Approach ◽  
Quick Sort

scholarly journals IMPLEMENTASI LOAD BALANCING BERBASIS CLOUD COMPUTING UNTUK MENDUKUNG INFRASTRUCTURE AS A SERVICE MENGGUNAKAN METODE QUICK SORT

Compiler ◽  
2018 ◽  
Vol 7 (1) ◽  
Author(s):  
Hero Wintolo ◽  
Lalu Suwandi Yusuf
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Data Storage ◽  
Data Delivery ◽  
Infrastructure As A Service ◽  
Server Design ◽  
Quick Sort

Implementation of load balancing in cloud computing applications using quick sort method is a study to determine the access speed of each server. Design a cloud computing application using 4 laptops as application users and 3 laptops or PCs as servers in data storage. In sending data performed by the user application, the data will be distributed to the server that has been selected by the system with a quick sort method that sort the rest of the server capacity and then choose the server with the largest capacity. The stored data is placed in the htdocs file on the server. Based on the tests performed, cloud computing applications can run on at least 2 laptops using the windows version. Testing the server is also done by directly using the command prompt. During testing each server receives ping from the application to determine server performance in using load balancing. Testing without load balancing that sends data 50 times of 10 Mb to one server yields speed 15 ms, with 2 server divided by two in its data delivery that is as much as 25 times 10 Mb then speed 12 ms.

scholarly journals Optimal group based testing strategy for detecting infected individuals: comparison of algorithms

2020 ◽  
Author(s):  
Viktor Skorniakov ◽  
Remigijus Leipus ◽  
Gediminas Juzeliūnas ◽  
Kęstutis Staliūnas
Keyword(s):  
Current Situation ◽  
Testing Strategy ◽  
Rigorous Analysis ◽  
Medical Test ◽  
Interesting Insight ◽  
Economical Benefit ◽  
Rigorous Treatment ◽  
Testing Algorithm ◽  
Pooled Samples ◽  
Quick Sort

AbstractWe investigate group based testing strategy targeted to identify infected patients by making use of a medical test which equally well applies to single and pooled samples. We demonstrate that, under assumed setting, quick sort grounded testing algorithm allows to reduce average costs, and the reduction is very significant when the infection percentage is low. Although the basic idea of test sampling is known, our major novelty is the rigorous treatment of the model. Another interesting insight following rigorous analysis is that an average number of tests per one individual scales like entropy of the prevalence of infection. One more reason for the paper is the context: taking into account the current situation with the coronavirus, dissemination of renowned ideas and the optimisation of algorithms can be of a great importance and of economical benefit.

Sign in / Sign up

Export Citation Format

Share Document