ANALISIS PERBANDINGAN HIGH PERFORMANCE OPENMPI DAN MPICH2 PADA SISTEM CLUSTER
Begins by using a single processor, to increase the speed of computing time, the use of multi-processor was introduced. The second paradigm is known as parallel computing, example cluster. The cluster must have the communication potocol to computing process by using parallel computing, one of them i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Theses and Dissertations NonPeerReviewed |
| Published: |
[Yogyakarta] : Universitas Gadjah Mada
2012
|
| Subjects: | |
| Online Access: | https://repository.ugm.ac.id/99453/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=55973 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universitas Gadjah Mada |
| Summary: | Begins by using a single processor, to increase the speed of computing time, the use of multi-processor was introduced. The second paradigm is known as parallel computing, example cluster. The cluster must have the communication potocol to computing process by using parallel computing, one of them is message passing Interface (MPI). MPI have many library, both of them OPENMPI and MPICH2.
This study aims to analyze the comparative performances of MPICH2 and openMPI in handling parallel computing process to solve the sorting problems using mergesort and quicksort method based on speedup and efficiency. The research method is by implementing OpenMPI and MPICH2 on a Linux-based cluster using five computer virtual cloud service and then analyze the performance of the system by different scenario tests.
The results of this study showed that the addition of each data size makes OpenMPI and MPICH2 have an average speed-up and efficiency tend to increase but at a large data size decreases. OpenMPI has a speed-up and efficiency greater than MPICH2 but at such a large data size, the efficiency and speed-up openMPI are greater than MPICH2 but the difference in speed-up of 3.1429 and efficiency of 0.754. Mergesort is more efficient using openMPI but quicksort for large data size is more efficient using MPICH2 with a difference of 0.726 because quicksort has many computational steps but mergesort just a little but need great communication. MPICH2 so that it can be concluded more efficiently used at a lot of computation steps. |
|---|