A Scheduling Middleware for Scheduling on a Grid Environment

A grid consists of high-end computational, storage, and network resources that, while known a priori, are dynamic with respect to activity and availability. Efficient scheduling of requests to use grid resources must adapt to this dynamic environment while meeting administrative policies. This paper discusses the necessary requirements of such a scheduler and proposes a framework that can administrate grid policies and schedule complex. The paper design allows for a number of functional modules to flexibly plan and schedule workflows representing multiple applications on the grids. It also allows for performance evaluation of multiple algorithms for each functional module. We present early experimental results that effectively utilizes other grid infrastructure such as workflow management systems and execution systems

[1]  Jon B. Weissman Prophet: automated scheduling of SPMD programs in workstation networks , 1999, Concurr. Pract. Exp..

[2]  Jon B. Weissman Prophet: automated scheduling of SPMD programs in workstation networks , 1999 .

[3]  Francine Berman,et al.  Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .

[4]  Jennifer M. Schopf,et al.  A performance study of monitoring and information services for distributed systems , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[5]  Peter Z. Kunszt,et al.  Giggle: A Framework for Constructing Scalable Replica Location Services , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[6]  Tuomas Sandholm,et al.  Globus Toolkit 3 Core-A Grid Service Container Framework , 2003 .

[7]  Paul Avery,et al.  The griphyn project: towards petascale virtual data grids , 2001 .

[8]  William Gropp,et al.  Beowulf Cluster Computing with Linux , 2003 .

[9]  Sanjay Ranka,et al.  Heterogeneous computing on heterogeneous systems: Software and application issues , 1993, Supercomputing '93. Proceedings.

[10]  Tao Yang,et al.  On the Granularity and Clustering of Directed Acyclic Task Graphs , 1993, IEEE Trans. Parallel Distributed Syst..

[11]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[12]  Iosif Legrand,et al.  MonALISA : A Distributed Monitoring Service Architecture , 2003, ArXiv.

[13]  Arif Ghafoor,et al.  A distributed heterogeneous supercomputing management system , 1993, Computer.

[14]  Miron Livny,et al.  Condor: a distributed job scheduler , 2001 .

[15]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[16]  Rajkumar Buyya,et al.  High Performance Cluster Computing: Architectures and Systems , 1999 .

[17]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[18]  Sanjay Ranka,et al.  Runtime Support for Parallelization of Data-Parallel Applications on Adaptive, Nonuniform Computational Environments , 1997, J. Parallel Distributed Comput..

[19]  Alan D. George,et al.  GEMS: GOSSIP-ENABLED MONITORING SERVICE FOR HETEROGENEOUS DISTRIBUTED SYSTEMS , 2002 .

[20]  Robert A. Kowalski Software engineering and artificial intelligence in new generaton computing , 1984 .

[21]  Miron Livny,et al.  Condor and the Grid , 2003 .