VIRTUAL PARALLEL ENVIRONMENT USING PVM CASE STUDY BUBBLE SORT ALGORITHM

Iwan Pratama,


Abstract

Parallel computing is a technique to solve a problem using many CPUs. To perform parallel computing, it requires parallel computer, which is commonly known as supercomputer or multiprocessor computer. Nowadays, a supercomputer is still very expensive. Therefore, parallel algorithm is difficult to be applied in general. To resolve this problem, virtual parallel workstation is created. Virtual parallel workstation is a network of computers controlled by a program that can regulate the allocation of computational processes to processors across the entire network. This project uses PVM (Parallel Virtual Machine) to implement the parallel workstation environment to perform Bubble Sort Algorithm in parallel approach

Save to Mendeley



Keywords

Parallel Computing, PVM, Bubble Sort

Full Text:

PDF

References

Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek,

Vaidy Sunderam. PVM: Parallel Virtual Machine A Users’s Guide and Tutorial

for Network Parallel Computing, 1994. Diakses 28 September 2016 dari

http://www.netlib.org/pvm3/book/

Barry Wilkinson & Michael Allen. “Parallel Programming: Teknik dan

Aplikasi Menggunakan Jaringan Workstation & Komputer Paralel”. 2010

Intan Liswandini, Budhi Irawan, and Irzaman, “Studi Komparatif Antara

Paralel Virtual Machine (PVM) dan Message Passing Interface (MPI) Dengan

Memanfaatkan Local Area Network (LAN)”, Diakses 30 September 2016 dari

http://elib.unikom.ac.id/download.php?id=4636

Zaid Abdi Alkareem Alyasseri, Kadhim Al-Attar, Mazin Nasser and ISMAI,

“Parallelize Bubble and Merge Sort Algorithms Using Message Passing Interface

(MPI)”. Diakses 28 September 2016 dari https://arxiv.org/pdf/1411.5283.pdf

http://www.netlib.org/pvm3/

Article Metrics

Abstract viewed : 122 times
PDF files downloaded : 18 times

View My Stats