Performance comparison analysis library communication cluster system using merge sort

被引:0
|
作者
Wulandari, D. A. R. [1 ]
Ramadhan, M. E. [2 ]
机构
[1] Univ Jember, Informat Syst Dept, Jember, Indonesia
[2] Univ Jember, Mech Engn Dept, Jember, Indonesia
关键词
D O I
10.1088/1742-6596/1008/1/012002
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 for processing, one of it is message passing Interface (MPI). MPI have many library, both of them OPENMPI and MPICH2. Performance of the cluster machine depend on suitable between performance characters of library communication and characters of the problem so this study aims to analyze the comparative performances libraries in handling parallel computing process. The case study in this research are MPICH2 and OpenMPI. This case research execute sorting's problem to know the performance of cluster system. The sorting problem use mergesort method. The research method is by implementing OpenMPI and MPICH2 on a Linux-based cluster by using five computer virtual then analyze the performance of the system by different scenario tests and three parameters for to know the performance of MPICH2 and OpenMPI. These performances are execution time, speedup and efficiency. 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. increased data size doesn't necessarily increased speed up and efficiency but only execution time example in 100000 data size. OpenMPI has a execution time greater than MPICH2 example in 1000 data size average execution time with MPICH2 is 0,009721 and OpenMPI is 0,003895 OpenMPI can customize communication needs.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] Performance analysis of a parallel sort merge join on cluster architectures
    Schikuta, E
    [J]. DISTRIBUTED AND PARALLEL COMPUTING, 2005, 3719 : 277 - 286
  • [2] Parallel merge sort using comparison matrices .2.
    Romm, YE
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 1995, 31 (04) : 484 - 505
  • [3] PARALLEL MERGE SORT USING COMPARISON MATRICES .1.
    ROMM, YE
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 1994, 30 (05) : 631 - 647
  • [4] Performance Comparison between Merge and Quick Sort Algorithms in Data Structure
    Ali, Irfan
    Nawaz, Haque
    Khan, Imran
    Chhajro, M. Ameen
    Rind, M. Malook
    Maitlo, Abdullah
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2018, 9 (11) : 192 - 195
  • [5] Parallel Merge Sort Based Performance Evaluation and Comparison of MPI and PVM
    Nanjesh, B. R.
    Tejonidhi, M. R.
    Rajesh, T. H.
    Kumar, Ashwin H., V
    [J]. 2013 IEEE CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES (ICT 2013), 2013, : 530 - 534
  • [6] The Analysis of Energy Performance in Use Parallel Merge Sort Algorithms
    Marszalek, Zbigniew
    [J]. INFORMATION TECHNOLOGY AND CONTROL, 2019, 48 (03): : 487 - 498
  • [7] Empirical Analysis Measuring the Performance of Multi-threading in Parallel Merge Sort
    Altarawneh, Muhyidean
    Inan, Umur
    Elshqeirat, Basima
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2022, 13 (01) : 72 - 78
  • [8] The application of Cluster analysis in Library system
    Li, JianWei
    Chen, PingHua
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING WORKSHOP PROCEEDINGS, VOLS 1 AND 2, 2008, : 907 - +
  • [9] Performance comparison of adaptive modulation scheme for OFDM system using cluster
    Cho, J
    Kim, H
    Lee, H
    Ahn, JY
    [J]. CONFERENCE RECORD OF THE THIRTY-SEVENTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, VOLS 1 AND 2, 2003, : 662 - 666
  • [10] Throughput Performance Analysis of the Multipath Communication Library MPT
    Almasi, Bela
    Szilagyi, Szabolcs
    [J]. 2013 36TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS AND SIGNAL PROCESSING (TSP), 2013, : 86 - 90