Article: Hierarchically distributed peer-to-peer architecture for load balancing and effective dynamic group scheduling in grid computing Journal: International Journal of Business Information Systems (IJBIS) 2019 Vol.32 No.3 pp.312 - 323 Abstract: The local or remote grid computing resources have been normally assigned the task of executing user jobs in a distributed environment. An important factor affecting grid processing is the network bandwidth that differs from network to network. In order to overcome this problem, a few typical algorithms are suggested keeping in view of computing grid resources based on load balancing across the grid system. These algorithms help in improving the performance to some extent, yet none of them has been found experimentally suitable to overcome the major short falls experienced in the grid computing system. A hierarchically distributed peer-to-peer (HDP2P) architecture is proposed to overcome all major problems encountered due to virtuality and heterogeneity. Results suggested that HDP2P architecture was of great use in balancing the load and allocating to the resources to the groups of jobs keeping MIPS accountability using grouping-based dynamic job scheduling algorithm (GBDJS). The proposed algorithm is compared with first come first served (FCFS) job scheduling algorithm and ant colony optimisation (ACO). There is a considerable improvement achieved in performance by using this novel architecture. Inderscience Publishers - linking academia, business and industry through research

Title: Hierarchically distributed peer-to-peer architecture for load balancing and effective dynamic group scheduling in grid computing

Authors: S. Gomathi; D. Manimegalai

Addresses: CSE Department, Francis Xavier Engineering College, Tirunelveli, Tamilnadu, India ' IT Department, National Engineering College, Kovilpatti, Tamilnadu, India

Abstract: The local or remote grid computing resources have been normally assigned the task of executing user jobs in a distributed environment. An important factor affecting grid processing is the network bandwidth that differs from network to network. In order to overcome this problem, a few typical algorithms are suggested keeping in view of computing grid resources based on load balancing across the grid system. These algorithms help in improving the performance to some extent, yet none of them has been found experimentally suitable to overcome the major short falls experienced in the grid computing system. A hierarchically distributed peer-to-peer (HDP2P) architecture is proposed to overcome all major problems encountered due to virtuality and heterogeneity. Results suggested that HDP2P architecture was of great use in balancing the load and allocating to the resources to the groups of jobs keeping MIPS accountability using grouping-based dynamic job scheduling algorithm (GBDJS). The proposed algorithm is compared with first come first served (FCFS) job scheduling algorithm and ant colony optimisation (ACO). There is a considerable improvement achieved in performance by using this novel architecture.

Keywords: grid system; load balancing; job scheduling; performance evaluation; hierarchically distributed peer-to-peer; HDP2P; grouping-based dynamic job scheduling algorithm; GBDJS.

DOI: 10.1504/IJBIS.2019.103081

International Journal of Business Information Systems, 2019 Vol.32 No.3, pp.312 - 323

Received: 01 May 2017
Accepted: 21 Jan 2018
Published online: 15 Oct 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Hierarchically distributed peer-to-peer architecture for load balancing and effective dynamic group scheduling in grid computing

Keep up-to-date