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

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.