Modelling of a self-led critical friend topology in inter-cooperative grid communities

Abstract For decades, much work has been done to increase the effectiveness and efficiency of job sharing amongst available computational resources. Resources can be organized into a variety of topologies, and recent work has shown that a decentralized distributed resource topology is a crucial but complicated scenario. This is because decentralized resources are normally grouped into independent virtual organizations (VOs) and isolated from each other by VO boundaries. To convey jobs across gaps between various virtual organizations, a novel resource topology called the self-led critical friend model (CFM) is proposed in this work. The CFM deals with trust credits between resources according to their historical collaboration records. This trust reveals a feasible, realistic, and transferable correlation to facilitate the resource selection process for job delegation between arbitrarily connected physical resources. Consequently, the CFM is able to overcome the constraints caused by virtual organization boundaries. Besides the theoretical model, a simulation-based implementation is carried out together with a complementary high-level community-aware scheduling protocol. After evaluating a number of compositional scenarios and criteria objectives, the observed results show the benefit of job scheduling across multiple VOs, as well as the capability of the self-led critical friend model as a novel cross-VO resource topology to represent and interconnect resources.

[1]  Dalibor Klusácek,et al.  Alea - Grid Scheduling Simulation Environment , 2007, PPAM.

[2]  Rizos Sakellariou,et al.  Towards increased expressiveness in service level agreements , 2007, Concurr. Comput. Pract. Exp..

[3]  Nik Bessis,et al.  Community-Aware Scheduling Protocol for Grids , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[4]  Wolfgang Ziegler,et al.  A Meta-scheduling Service for Co-allocating Arbitrary Types of Resources , 2005, PPAM.

[5]  Nik Bessis,et al.  Using Metadata Snapshots for Extending Ant-Based Resource Discovery Service in Inter-cooperative Grid Communities , 2009, 2009 First International Conference on Evolving Internet.

[6]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[7]  Alexandru Iosup,et al.  The Grid Workloads Archive , 2008, Future Gener. Comput. Syst..

[8]  Rajkumar Buyya,et al.  GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing , 2002, Concurr. Comput. Pract. Exp..

[9]  Pierre Kuonen,et al.  MaGate: An Interoperable, Decentralized and Modular High-Level Grid Scheduler , 2010, Int. J. Distributed Syst. Technol..

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

[11]  Amos Brocco,et al.  Solenopsis: A Framework for the Development of Ant Algorithms , 2007, 2007 IEEE Swarm Intelligence Symposium.

[12]  Pierre Kuonen,et al.  MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler , 2009, APPT.

[13]  Eduardo Huedo,et al.  The GridWay Framework for Adaptive Scheduling and Execution on Grids , 2001, Scalable Comput. Pract. Exp..

[14]  Stephen Gilmore,et al.  Evaluating the performance of pipeline-structured parallel programs with skeletons and process algebra , 2005, Scalable Comput. Pract. Exp..

[15]  Nik Bessis,et al.  Towards an Integrated Vision across Inter-cooperative Grid Virtual Organizations , 2009, FGIT.

[16]  Ye Huang,et al.  ARiA: A Protocol for Dynamic Fully Distributed Grid Meta-scheduling , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.