Title: A peer-to-peer approach to task scheduling in computation grid

Authors: Jiannong Cao, Oscar M.K. Kwong, Xianbing Wang, Wentong Cai

Addresses: Internet and Mobile Computing Laboratory, Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. ' Internet and Mobile Computing Laboratory, Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. ' School of Computing, National University of Singapore, 117543, Singapore; Singapore-MIT Alliance, 117576, Singapore. ' School of Computer Engineering, Nanyang Technological University, 639798, Singapore

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 homogenous policy on making decisions and limiting the system flexibility and scalability. In this paper, we propose a peer-to-peer (P2P)-based decentralised approach, which off-loads the intermediate server by letting the peers in the grid to make the scheduling decision among themselves using their own scheduling policies. A generic architecture for metascheduler on peers, called PGS (P2P grid scheduler), and the task scheduling framework based on PGS have been developed. Both push and pull modes are used for distributing the tasks to peers with the support of load balancing and fault tolerance. A prototype of the proposed architecture and mechanism has been developed and simple performance tests have been conducted.

Keywords: grid computing; peer-to-peer; task scheduling; P2P grid scheduler; resource management; metascheduler; push nodes; pull nodes; load balancing; fault tolerance.

DOI: 10.1504/IJGUC.2005.007056

International Journal of Grid and Utility Computing, 2005 Vol.1 No.1, pp.13 - 21

Published online: 16 May 2005 *

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