LOAD BALANCING DINAMIS MENGGUNAKAN ALGORITMA DYNAMIC DISTRIBUTION UPON DEMAND PADA SISTEM ENKRIPSI/DEKRIPSI DATA TERDISTRIBUSI

Authors

  • Lauw Reduardy I. Laulyta Program Studi Informatika, STMIK KHARISMA Makassar
  • Mohammad Fajar Program Studi Informatika, STMIK KHARISMA Makassar
  • Syamsul Bahri Program Studi Informatika, STMIK KHARISMA Makassar

:

https://doi.org/10.9744/informatika.13.2.51-55

Keywords:

Parallel/Distributed Computing, Encryption, Decryption, Dynamic Distribution upon Demand, Dynamic Load Balancing, Resource Allocation

Abstract

The diversity of capability of computers worker in distributed system influences resource allocation and completion time for each jobs on the system. This study aims to implement a dynamic load balancing technique using dynamic distribution upon demand (DDD) algorithm to optimize the resource allocation in distributed data encryption/decryption system. Evaluating was performed by comparing the proposed system with two other models that is a system without load balancing and with static load balancing method. Evaluation result showed that the resource allocation in the proposed system using DDD algorithm more optimized and at the decryption process of three and four characters with proper workload initialization values presented that the job completion time much faster than the two other systems.

References

Armando E. De Giusti, Marcelo R. Naiouf, Laura C. De Giusti & Franco Chichizola, Dynamic Load Balancing in Parallel Processing on Non-Homogeneous Clusters. Instituto de Investigación en Informática LIDI (III-LIDI), Facultad de Informática–UNLP, JCS&T, 5(4), 2005.

Blaise Barney, Introduction to Parallel Computing, Lawrence Livermore National Laboratory. Available on https://computing.llnl.gov/tutorials/ parallel_comp/

Gene M. Amdahl, Validity of the single processsor approach to achieving large scale computing capabilities, AFIPS spring joint computer conference, IBM Sunnyvale, California, 1967.

Jhongsong Hoya, Mohammad Fajar, Reduksi Waktu Enkripsi/Dekripsi pada Algoritma RSA menggunakan Komputasi Terdistribusi, Prosiding Konferensi Nasional Sistem Informasi (KNSI 2010), STMIK MDP Palembang, 2010.

N. Taing, Parallel and Distributed Computing. Retrieved May 14, 2014. from http://lycog.com/ distributed-systems/parallel-and-distributed-computing/

Quentin F. Stout, What is Parallel Computing? A Not Too Serious Explanation, Computer Science and Engineering. University of Michigan. Ann Arbor, MI 48109-2121. Retrieved May 11, 2014. from http://web.eecs.umich.edu/ ~qstout/parallel.html

Sherihan Abu Elenin & Masato Kitakami, Performance Analysis of Static Load Balancing in Grid, International Journal of Electrical & Computer Sciences IJECS-IJENS, 11(3), 2011.

Zubair Khan, Ravendra Singh, Jahangir Alam and Shailesh Saxen, Classification of Load Balancing Conditions for parallel and distributed systems. IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 5, No. 1, September 2011.

Downloads

Published

2016-02-01

How to Cite

Laulyta, L. R. I., Fajar, M., & Bahri, S. (2016). LOAD BALANCING DINAMIS MENGGUNAKAN ALGORITMA DYNAMIC DISTRIBUTION UPON DEMAND PADA SISTEM ENKRIPSI/DEKRIPSI DATA TERDISTRIBUSI. Jurnal Informatika, 13(2), 51-55. https://doi.org/10.9744/informatika.13.2.51-55

Issue

Vol. 13 No. 2 (2015): NOVEMBER 2015

Section

Articles

License

Authors who publish with this journal agree to the following terms:


  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).