Title: SPA-based task scheduling for hypercubic P2P grid systems

Authors: D. Doreen Hephzibah Miriam; K.S. Easwarakumar

Addresses: Department of Computer Science and Engineering, Anna University, Chennai - 600025, India. ' Department of Computer Science and Engineering, Anna University, Chennai - 600025, India

Abstract: Most of the existing solutions on task scheduling and resource management in grid computing are based on the traditional client/server model, enforcing a homogeneous policy on making decisions and limiting the flexibility, unpredictable reliability and scalability of the system. Thus, we need a well organised system architecture to provide high system availability with resource scheduling scheme for grid environment. In this paper, we integrate grid with P2P on to the hypercube topology with additional neighbourhood links for task scheduling and load balancing, which gives better makespan and balances the load. We propose the SPA-based task scheduling methodology in order to enhance system performance in hypercubic P2P grid (HPGRID). The simulation results show that the SPA-based min-mean scheduling minimises the makespan along with load balancing and guarantees the high system availability in system performance. At last, the min-mean algorithm is compared with min-min and max-min algorithm using SPA, by simulate experimentation, and it shows that the new algorithm has a better quality of system load balancing and the utilisation of system resources.

Keywords: hypercube topology; task scheduling; hypercubic grid systems; P2P grid systems; set pair analysis; SPA; distributed systems; peer-to-peer; resource management; grid computing; load balancing; simulation.

DOI: 10.1504/IJCNDS.2012.047899

International Journal of Communication Networks and Distributed Systems, 2012 Vol.9 No.1/2, pp.117 - 139

Published online: 30 Aug 2014 *

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