Resource Based Optimized Decentralized Grid Scheduling Algorithm

Peer to peer (P2P) grid system has good potential for decentralized grid scheduling. The existing P2P grid resource management algorithms allow detection of resources after generation of task. Recently, few new P2P grid resource management schemes proposed discovery of resources before task is generated. These schemes simply shortlist best possible subset of grid resources on basis of one or many overlays. In this paper, we suggest that these algorithms have potential to include the step of organizing shortlisted resources in non-increasing order on basis of optimization criteria. Addition of this step will reduce time to find out schedule of DAG’s interdependent tasks on fully decentralized P2P grid. An optimization criterion is based on computation capability and communication cost of grid resources.

[1]  Maarten van Steen,et al.  An Epidemic Protocol for Managing Routing Tables in Very Large Peer-to-Peer Networks , 2003, DSOM.

[2]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[3]  Stephen Gilmore,et al.  Flexible Skeletal Programming with eSkel , 2005, Euro-Par.

[4]  Anne-Marie Kermarrec,et al.  Exploiting semantic proximity in peer-to-peer content searching , 2004, Proceedings. 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, 2004. FTDCS 2004..

[5]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[6]  Valentin Cristea,et al.  A decentralized strategy for genetic scheduling in heterogeneous environments , 2006, Multiagent Grid Syst..

[7]  Jennifer M. Schopf,et al.  Ten Actions When Grid Scheduling , 2004 .

[8]  Marcus Brunner,et al.  Self-Managing Distributed Systems , 2003, Lecture Notes in Computer Science.

[9]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[10]  Selim G. Akl,et al.  Scheduling Algorithms for Grid Computing: State of the Art and Open Problems , 2006 .

[11]  Márk Jelasity,et al.  A Robust and Scalable Peer-to-Peer Gossiping Protocol , 2003, AP2PC.

[12]  Larry Carter,et al.  Centralized versus Distributed Schedulers for Bag-of-Tasks Applications , 2008, IEEE Transactions on Parallel and Distributed Systems.

[13]  A. Forti,et al.  Dag scheduling for grid computing systems , 2006 .

[14]  Maarten van Steen,et al.  Epidemic-Style Management of Semantic Overlays for Content-Based Searching , 2005, Euro-Par.

[15]  Guillaume Pierre,et al.  On the Feasibility of Decentralized Grid Scheduling , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops.

[16]  Hai Jin,et al.  DAGMap: Efficient scheduling for DAG grid workflow job , 2008, 2008 9th IEEE/ACM International Conference on Grid Computing.

[17]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[18]  Henri E. Bal,et al.  Simple locality-aware co-allocation in peer-to-peer supercomputing , 2006 .

[19]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[20]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[21]  Sung-Chun Kim,et al.  Task Scheduling Algorithm in GRID Considering Heterogeneous Environment , 2004, PDPTA.

[22]  M. Lamanna.  The LHC computing grid project at CERN , 2004 .

[23]  David Zweig,et al.  Images of the World: Studying Abroad and Chinese Attitudes towards International Affairs* , 2010, The China Quarterly.