An adaptive decentralized scheduling mechanism for peer-to-peer Desktop Grids

P2P desktop grid has recently been an attractive computing paradigm for high throughput applications. Desktop grid computing is complicated by heterogeneous capabilities, failures, volatility, and lack of trust because it is based on desktop computers. One of the important challenges of P2P desktop grid computing is the development of scheduling mechanisms that adapt to such a dynamic computing environment. This paper proposes an adaptive decentralized scheduling mechanism in which matchmaking is performed between resource requirements of outstanding tasks and resource capabilities of available workers. The matchmaking approach is based on fuzzy logic. Experimental results show that, implementing the proposed fuzzy matchmaking based scheduling mechanism maximized the resource utilization of executing workers without exceeding the maximum execution time of the task.

[1]  Madan M. Gupta,et al.  Fuzzy Sets, Fuzzy Logic, and Fuzzy Systems , 2003 .

[2]  Jarek Nabrzyski,et al.  Grid resource management: state of the art and future trends , 2004 .

[3]  George J. Klir,et al.  Fuzzy Sets, Fuzzy Logic, and Fuzzy Systems - Selected Papers by Lotfi A Zadeh , 1996, Advances in Fuzzy Systems - Applications and Theory.

[4]  Miron Livny,et al.  Condor and preemptive resume scheduling , 2004 .

[5]  Gilles Fedak,et al.  XtremWeb: a generic global computing system , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[6]  A.E. El-Desoky,et al.  A Pure Peer-To-Peer Desktop Grid framework with efficient fault tolerance , 2007, 2007 International Conference on Computer Engineering & Systems.

[7]  Douglas Thain,et al.  Distributed computing in practice: the Condor experience , 2005, Concurr. Pract. Exp..

[8]  Richard McClatchey,et al.  A Taxonomy and Survey of Grid Resource Planning and Reservation Systems for Grid Enabled Analysis Environment , 2004, ArXiv.

[9]  Gerd Finke,et al.  Scheduling with Discrete Resource Constraints , 2004, Handbook of Scheduling.

[10]  Luděk Matyska,et al.  Model of Grid Scheduling Problem , 2005 .

[11]  Andrew S. Grimshaw,et al.  Using Reflection for Incorporating Fault-Tolerance Techniques into Distributed Applications , 1998, Parallel Process. Lett..

[12]  Rajkumar Buyya,et al.  Peer-to-Peer Grid Computing and a .NET-Based Alchemi Framework , 2006 .

[13]  A.E. El-Desoky,et al.  Improving Fault Tolerance in Desktop Grids Based On Incremental Checkpointing , 2006, 2006 International Conference on Computer Engineering and Systems.

[14]  Andrew A. Chien,et al.  Resource management in the entropia system , 2004 .