The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid

The Computational Grid is a promising platform for the efficient execution of parameter sweep applications over large parameter spaces. To achieve performance on the Grid, such applications must be scheduled so that shared data files are strategically placed to maximize reuse, and so that the application execution can adapt to the deliverable performance potential of target heterogeneous, distributed and shared resources. Parameter sweep applications are an important class of applications and would greatly benefit from the development of Grid middleware that embeds a scheduler for performance and targets Grid resources transparently. In this paper we describe a user-level Grid middleware project, the AppLeS Parameter Sweep Template (APST), that uses application-level scheduling techniques [1] and various Grid technologies to allow the efficient deployment of parameter sweep applications over the Grid. We discuss several possible scheduling algorithms and detail our software design. We then describe our current implementation of APST using systems like Globus [2], NetSolve [3] and the Network Weather Service [4], and present experimental results.

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

[2]  Francine Berman,et al.  Mapping Parallel Applications to Distributed Heterogeneous Systems , 1996 .

[3]  Francine Berman,et al.  Removing Useless Tokens from a Dataflow Computation , 1987, ICPP.

[4]  Francine Berman,et al.  Designing a parallel debugger for portability , 1994, Proceedings of 8th International Parallel Processing Symposium.

[5]  Peter Arbenz,et al.  The Remote Computation System , 1996, Parallel Comput..

[6]  Miron Livny,et al.  Harnessing the Capacity of Computational Grids for High Energy Physics , 2000 .

[7]  David Abramson,et al.  High performance parametric modeling with Nimrod/G: killer application for the global grid? , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[8]  Warren Smith,et al.  A Resource Management Architecture for Metacomputing Systems , 1998, JSSPP.

[9]  Francine Berman,et al.  Predicting the performance of large programs on scalable multicomputers , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..

[10]  Gary Shao.  Performance Efiects of Scheduling Strategies for Master/Slave Distributed Applications , 1998 .

[11]  Francine Berman,et al.  Unifying Programming Support for Parallel Computers , 1988 .

[12]  S Rogers,et al.  A comparison of implicit schemes for the incompressible Navier-Stokes equations with artificial compressibility , 1995 .

[13]  Andrew S. Grimshaw,et al.  Wide-Area Computing: Resource Sharing on a Large Scale , 1999, Computer.

[14]  Ian T. Foster,et al.  GASS: a data movement and access service for wide area computing systems , 1999, IOPADS '99.

[15]  Richard Wolski,et al.  Forecasting network performance to support dynamic scheduling using the network weather service , 1997, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[16]  Amitava Majumdar.  Parallel performance study of Monte Carlo photon transport code on shared-, distributed-, and distributed-shared-memory architectures , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[17]  Francine Berman,et al.  On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..

[18]  Francine Berman,et al.  Zoom: a Hierarchical Representation for Heterogeneous Applications , 1995 .

[19]  Francine Berman,et al.  Debugging mapped parallel programs , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..

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

[21]  D. Rogers,et al.  EGS4 code system , 1985 .

[22]  Francine Berman,et al.  Application Scheduling on the Information Power Grid , 2000 .

[23]  Chandra Krintz,et al.  Running EveryWare on the Computational Grid , 1999, ACM/IEEE SC 1999 Conference (SC'99).

[24]  Francine Berman,et al.  Architectural support for the efficient data-driven evaluation scheme , 1990, SPAA '90.

[25]  Neil Spring,et al.  Application level scheduling of gene sequence comparison on metacomputers , 1998 .

[26]  Francine Berman,et al.  Propositional Dynamic Logic is Weaker without Tests , 1981, Theor. Comput. Sci..

[27]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[28]  David Abramson,et al.  Modelling Photochemical Pollution using Parallel and Distributed Computing Platforms , 1994, PARLE.

[29]  Michael Mitzenmacher,et al.  How Useful Is Old Information? , 2000, IEEE Trans. Parallel Distributed Syst..

[30]  Miron Livny,et al.  Condor-a hunter of idle workstations , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[31]  Francine Berman,et al.  Performance of the Efficient Data-Driven Evaluation Scheme , 1993, J. Parallel Distributed Comput..

[32]  Francine Berman,et al.  Assessing partitioning/ scheduling/storage trade-offs for regular iterative algorithms , 1993, Integr..

[33]  Joel R. Stiles,et al.  Monte Carlo simulation of neuro-transmitter release using MCell, a general simulator of cellular physiological processes , 1998 .

[34]  Francine Berman.  From TeraGrid to Knowledge Grid. , 2001 .

[35]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[36]  Mitsuhisa Sato,et al.  Resource manager for Globus-based wide-area cluster computing , 1999, ICWC 99. IEEE Computer Society International Workshop on Cluster Computing.

[37]  Michael Mitzenmacher,et al.  How useful is old information (extended abstract)? , 1997, PODC '97.

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

[39]  Francine Berman,et al.  Mapping with External I/O : A Case Study , 1987, ICPP.

[40]  Francine Berman,et al.  Modeling the effects of contention on the performance of heterogeneous applications , 1996, Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing.

[41]  Francine Berman,et al.  Combining workstations and supercomputers to support grid applications: the parallel tomography experience , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[42]  Francine Berman,et al.  The AppLeS Project: A Status Report , 1997 .

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

[44]  Walfredo Cirne,et al.  Application Scheduling over Supercomputers: A Proposal , 1999 .

[45]  F. Berman,et al.  Adaptive Performance Prediction for Distributed Data-Intensive Applications , 1999, ACM/IEEE SC 1999 Conference (SC'99).

[46]  Francine Berman,et al.  Predicting slowdown for networked workstations , 1997, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[47]  D J Biester,et al.  Make your votes count! , 1992, Journal of pediatric nursing.

[48]  Michelle Miller,et al.  An integrated problem solving environment: the SCIRun computational steering system , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[49]  Ladislau Bölöni,et al.  A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[50]  T. Bartol,et al.  Miniature endplate current rise times less than 100 microseconds from improved dual recordings can be modeled with passive acetylcholine diffusion from a synaptic vesicle. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[51]  Henry Wallace Clark,et al.  The Gantt Chart , 1947 .

[52]  Micah Beck,et al.  The Internet Backplane Protocol: Storage in the Network , 1999 .

[53]  Francine Berman,et al.  Edge Grammars: Decidability Results and Formal Language Issues , 1984 .

[54]  Francine Berman,et al.  Panorama: a portable, extensible parallel debugger , 1993, PADD '93.

[55]  Francine Berman,et al.  Collections of Functions for Perfect Hashing , 1986, SIAM J. Comput..

[56]  Francine Berman,et al.  Performance prediction-How good is good? , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

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

[58]  Henri Casanova,et al.  NetSovle: A Network Server for Solving Computational Science Problems , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[59]  Francine Berman,et al.  Efficient Data-Driven Evaluation: Theory and Implementation , 1990, J. Parallel Distributed Comput..

[60]  Rajesh Raman,et al.  High Throughput Monte Carlo , 1999, PPSC.

[61]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Scalable Comput. Pract. Exp..

[62]  Henri Casanova,et al.  A Modular Scheduling Approach for Grid Application Development Environments , 2002 .

[63]  Francine Berman,et al.  Application-Level Scheduling on Distributed Heterogeneous Networks , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[64]  Francine Berman,et al.  Creating views for debugging parallel programs , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[65]  Francine Berman,et al.  Generalized Planar Matching , 1990, J. Algorithms.

[66]  Francine Berman,et al.  Performance prediction in production environments , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[67]  Francine Berman,et al.  Using Simulation to Evaluate Scheduling Heuristics for a Class of Applications in Grid Environments , 1999 .

[68]  Holly Dail,et al.  A Modular Framework for Adaptive Scheduling in Grid Application Development Environments , 2002 .

[69]  Francine Berman,et al.  Communication-Sensitive Heuristics and Algorithms for Mapping Compilers , 1988, PPOPP/PPEALS.

[70]  Henri Casanova,et al.  Netsolve: a Network-Enabled Server for Solving Computational Science Problems , 1997, Int. J. High Perform. Comput. Appl..

[71]  Francine Berman,et al.  Representing graph families with edge grammars , 1993, Inf. Sci..

[72]  F. Berman,et al.  Modeling Contention Effects in Clustered Environments , 1996 .