A peer-to-peer meta-scheduler for service-oriented grid environments

Meta-scheduling in a Grid is aimed at enabling the efficient sharing of computing resources managed by different local schedulers within a single organization or scattered across several administrative domains. Since current Grid metaschedulers operate in a centralized fashion and thus are single points of failure, we present a distributed meta-scheduler for a service-oriented Grid environment based on peer-to-peer (P2P) networking techniques and ant colony optimization algorithms adapted to a P2P network. In the proposed approach, the meta-scheduling process provides automatic load balancing, is completely decentralized, fault tolerant, scalable, and does not require complex administration. Experimental results demonstrate that scheduling decisions are made quickly and lead to a good balance of the computational load.

[1]  Ernest J. H. Chang,et al.  An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[2]  Eduardo Huedo,et al.  A framework for adaptive execution in grids , 2004, Softw. Pract. Exp..

[3]  Hein Meling,et al.  Messor: Load-Balancing through a Swarm of Autonomous Agents , 2002, AP2PC.

[4]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[5]  Jiming Liu,et al.  Macroscopic model of agent-based load balancing on grids , 2003, AAMAS '03.

[6]  Mario Lauria,et al.  The organic grid: self-organizing computation on a peer-to-peer network , 2004, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[7]  Bhaskar Ghosh,et al.  Dynamic load balancing on parallel and distributed networks by random matchings , 1994 .

[8]  David Abramson,et al.  A case for economy grid architecture for service oriented grid computing , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  Mario Lauria,et al.  Application-specific scheduling for the organic grid , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[10]  Fukuhito Ooshita,et al.  Biologically Inspired Self-Adaptation of Mobile Agent Population , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[11]  S. Muthukrishnan,et al.  Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) , 1994, SPAA '94.

[12]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[13]  David Abramson,et al.  Nimrod: a tool for performing parametrised simulations using distributed workstations , 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing.

[14]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[15]  Christian Reviewer-Blum,et al.  Review of Ant colony optimization by M.Dorigo, T.Stützle, MIT Press, Cambridge, MA, 2004 , 2005 .

[16]  David Abramson,et al.  Economic models for management of resources in peer-to-peer and grid computing , 2001, SPIE ITCom.

[17]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[18]  Fukuhito Ooshita,et al.  Self-Adaptation of Mobile Agent Population in Dynamic Networks: A Biologically Inspired Approach , 2005, Second International Conference on Autonomic Computing (ICAC'05).

[19]  David Abramson,et al.  Nimrod/G: an architecture for a resource management and scheduling system in a global computational grid , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[20]  Hein Meling,et al.  Anthill: a framework for the development of agent-based peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.