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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Business Information Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
