Operations research methods for resource management and scheduling in a computational grid: a survey

Computational grids are emerging as the new generation computing paradigm for tackling large scale hard problems in a wide range of scientific fields. Grids are highly complex distributed systems (involving multiple organizations with different goals and policies) which aim at providing computing services without the users need to know the location and features of the required resources. While the current and previous research efforts have been mainly concentrated on architectures and protocols, this paper deals with quantitative methods for grid resource management. In particular, three main issues are considered: performance forecasting, local scheduling (i.e., job scheduling within a single administrative domain) and distributed mechanisms for coordinating grid resources within several administrative domains. For each such a topic, the current literature is reviewed and new research avenues are highlighted.

[1]  Hanns Ruder,et al.  XPulsar@home - schools help scientists , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[2]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[3]  David P. Anderson,et al.  SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..

[4]  Francine Berman,et al.  Using Effective Network Views to Promote Distributed Application Performance , 1999, PDPTA.

[5]  Torben Hagerup,et al.  Allocating Independent Tasks to Parallel Processors: An Experimental Study , 1996, J. Parallel Distributed Comput..

[6]  Douglas C. Montgomery,et al.  Forecasting and time series analysis , 1976 .

[7]  Tuomas Sandholm,et al.  Distributed rational decision making , 1999 .

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

[9]  Jennifer M. Schopf,et al.  Using Regression Techniques to Predict Large Data Transfers , 2003, Int. J. High Perform. Comput. Appl..

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Philippe Chrétienne.  Tree Scheduling with Communication Delays , 1994, Discret. Appl. Math..

[12]  Edward D. Lazowska,et al.  The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems , 1991, IEEE Trans. Parallel Distributed Syst..

[13]  Yves Robert,et al.  Scheduling divisible workloads on heterogeneous platforms , 2003, Parallel Comput..

[14]  Gerhard Weiss,et al.  Multiagent Systems , 1999 .

[15]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[16]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[17]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[18]  Stephen A. Jarvis,et al.  Performance prediction technology for agent-based resource management in grid environments , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[19]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[20]  Javier García,et al.  TPC-W E-Commerce Benchmark Evaluation , 2003, Computer.

[21]  Joseph Y.-T. Leung,et al.  Packing Squares into a Square , 1990, J. Parallel Distributed Comput..

[22]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[23]  Chak-Kuen Wong,et al.  An effective quasi-human based heuristic for solving the rectangle packing problem , 2002, Eur. J. Oper. Res..

[24]  Zhou Lei,et al.  The portable batch scheduler and the maui scheduler on linux clusters , 2000 .

[25]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[26]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[27]  Lucio Grandinetti,et al.  Auction algorithms for decentralized parallel machine scheduling , 2006, Parallel Comput..

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

[29]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[30]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[31]  Rajkumar Buyya,et al.  Economic-based Distributed Resource Management and Scheduling for Grid Computing , 2002, ArXiv.

[32]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

[33]  Dean Sutherland,et al.  A resource query interface for network-aware applications , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[34]  Ian T. Foster,et al.  Globus: a Metacomputing Infrastructure Toolkit , 1997, Int. J. High Perform. Comput. Appl..

[35]  Yoichi Muraoka,et al.  The Markov Model Based Algorithm to Predict Networking Load on the Computational Grid , 2003, J. Math. Model. Algorithms.

[36]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[37]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[38]  Antonio Iovanella,et al.  Grid scheduling by on‐line rectangle packing , 2004, Networks.

[39]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[40]  Michel Gendreau,et al.  Design issues for combinatorial auctions , 2004, 4OR.

[41]  Henri Casanova,et al.  UMR: a multi-round algorithm for scheduling divisible workloads , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[42]  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.

[43]  Franciszek Seredynski,et al.  Competitive Coevolutionary Multi-Agent Systems: The Application to Mapping and Scheduling Problems , 1997, J. Parallel Distributed Comput..

[44]  Rajkumar Buyya,et al.  Weaving computational grids: how analogous are they with electrical grids? , 2002, Comput. Sci. Eng..

[45]  John F. Karpovich,et al.  The Legion Resource Management System , 1999, JSSPP.

[46]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[47]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..