skip to main content
10.1145/1274971.1274980acmconferencesArticle/Chapter ViewAbstractPublication PagesicsConference Proceedingsconference-collections
Article

GridRod: a dynamic runtime scheduler for grid workflows

Published:17 June 2007Publication History

ABSTRACT

Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components either read or write data to conventional files, which are copied from one execution stage to another, or they are tightly coupled using IPC libraries such as MPI or distributed streaming. More flexible communication can be achieved by overloading conventional READ and WRITE operations with advanced IO mechanisms such as sockets, streams and pipes, as is done in the GriddLeS environment. Such flexibility allows the pipelining of temporally dependent components, or in contrast, delaying of tightly coupled computations based on the current resource availability and network connectivity. However, it is also harder to schedule the workflow, because the communication mode may not be decided until run time. In this paper, we propose a new scheduling model that leverages such communication flexibility and allows us to generate dynamic runtime schedules. The scheduler in this case, not only allocates components to distributed Grid resources, but also specifies the inter-component communication mechanism (socket, pipe etc.) The current model is implemented as a dynamic workflow scheduling tool called GridRod, which harnesses Nimrod/G's [1] Grid services and GriddLeS [2] web services.

References

  1. Abramson, D., et al., High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?, in International Parallel and Distributed Processing Symposium. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Abramson, D. and J. Komineni, A Flexible IO Scheme for Grid Workflows, in IPDPS-04. 2004: New Mexico.Google ScholarGoogle Scholar
  3. Ilkay Altintas, A. B., Kim Baldridge, Wibke Sudholt, Mark Miller, Celine Amoreira, Yohann Potier and Bertram Ludaescher. A Framework for the Design and Reuse of Grid Workflows. in Intl. Workshop on Scientific Applications on Grid Computing (SAG'04). 2005: Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. The Taverna Project. {cited; Available from: http://taverna.sourceforge.net.Google ScholarGoogle Scholar
  5. The Genie Project. {cited; Available from: http://www.genie.ac.ukGoogle ScholarGoogle Scholar
  6. Anthony Mayer, S. M., Nathalie Furmento, Jeremy Cohen, Murtaza Gulamali, Laurie Young, Ali Afzal Contact Information, Steven Newhouse and John Darlington. ICENI: An Integrated Grid Middleware to Support E-Science. in Workshop on Component Models and Systems for Grid Applications. 2004. Saint Malo, France: Springer US.Google ScholarGoogle Scholar
  7. K. Seymour, H. N., S. Matsuoka, D. Dongarra, C. Lee, and H. Casanova, GridRPC: A remote procedure call api for grid computing, in ICL Technical Report ICL-UT-02-06. June 2002, Innovative Computing Laboratory, Department of Computer Science, University of Tennessee: Baltimore, MD, USA.Google ScholarGoogle ScholarCross RefCross Ref
  8. The VrGrads Project. {cited; Available from: http://vgrads.rice.edu/.Google ScholarGoogle Scholar
  9. The Kepler Project. {cited; Available from: http://keplerproject.org/.Google ScholarGoogle Scholar
  10. Messerschmitt, E.A.L.a.D.G. Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing. in IEEE Transactions on Computers. Jan 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Thomas L. Adam, K. M. C., J. R. Dickson. A comparison of list schedules for parallel processing systems. in Communications of the ACM. 1974: ACM Press New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Messerschmitt, E.A.L.a.D.G. Synchronous Data Flow. in Proceedings of the IEEE. 1987.Google ScholarGoogle Scholar
  13. Kahn., G. The Semantics of a Simple language for Parallel Programming. in In Proceedings of IFIP Congress. 1974: North Holland Publishing Company.Google ScholarGoogle Scholar
  14. Matias, P.B.G.a.Y. New sampling-based summary statistics for improving approximate query answers. in Proceedings of the 1998 ACM SIGMOD international conference on Management of data. 1998. Seattle, Washington, United States. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Charu C. Aggarwal, J. H., Jianyong Wang, Philip S. Yu. A Framework for Clustering Evolving Data Streams in In Proceeings of the 29th VLDB conference. 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Liang Chen Reddy, K. A., G.GATES: a grid-based middleware for processing distributed data streams. in In Proceedings of IEEE Conference on High performance Distributed Computing, 2004. Proceedings. 4-6 June 2004: IEEE Computer Society Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ahmad, Y.-K.K.a.I. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. in ACM Computing Surveys. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Anthony Mayer, S. M., Nathalie Furmento, William Lee, Steven Newhouse, John Darlington. ICENI Dataflow and Workflow: Composition and Scheduling in Space and Time in Proceedings of the Workshop on Component Models and Systems for Grid Applications. 2003. Saint Malo, France: SpringerLink.Google ScholarGoogle Scholar
  19. Ron Oldfield, D. K., Applications of Parallel I/O Oct 1996.Google ScholarGoogle Scholar
  20. Abramson, D., Kommineni, J., McGregor, J. and Katzfey, J. An Atmospheric Sciences Workflow and its Implementation with Web Services. in The International Conference on Computational Sciences. June 6 - 9, 2004. Krakow Poland.Google ScholarGoogle ScholarCross RefCross Ref
  21. Jette., M. A. Performance Characteristics of Gang Scheduling in Multiprogrammed Environments. in In Proceedings of the 1997 ACM/IEEE conference on Supercomputing. Nov - 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Luiz Meyer, Mike Wilde, Marta Mattoso, Ian Foster. Planning spatial workflows to optimize grid performance. in Distributed systems and grid computing (DSGC). 2006: ACM Press New York, NY, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Casanova, H., et al. Heuristics for Scheduling Parameter Sweep Applications in Grid Environments. in In Proceedings of the 9th Heterogeneous Computing Workshop (HCW00). 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Casanova, H., et al., The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid, in In Proceedings of the Super Computing Conference (SC'2000). 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Abramson, J.K.a.D. GriddLeS Enhancements and Building Virtual Applications for the GRID with Legacy Components. in European grid conference. 2005. Amsterdam: Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Stiles, J. R., et al., Monte Carlo simulation of neuromuscular transmitter release using MCell, a general simulator of cellular physiological processes. Computational Neuroscience, 1998: p. 279--284. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Foster, I. and C. Kesselman, Globus: A Meta-computing Infrastructure Toolkit. International Journal of Supercomputer Applications, 1997. 11(2): p. 115--128.Google ScholarGoogle Scholar
  28. Hategan, M., et al., GridAnt - A Client Controllable Grid Workflow System. 2003, Argonne National Laboratory.Google ScholarGoogle Scholar
  29. Sarkar, V., Partitioning and Scheduling Parallel Programs for Multiprocessors. 1989: Paperback. 215. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. S. Cheng, J.S.a.K.R. Dynamic Scheduling of Groups of Tasks with Precedence Constraints in Distributed Hard Real-Time Systems. in Real-Time Symposium. December 1986.Google ScholarGoogle Scholar
  31. H. Topcuoglu, S. H., and M. Y. Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. in IEEE Trans. Parallel and Distributed Systems. 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Andrea C. Arpaci-Dusseau, D. E. C., Alan M. Mainwaring. Scheduling with Implicit Information in Distributed Systems. in Joint Conference Measurement and Modeling Computer Systems. 1998. Madison, Wisconsin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Python xml.domGoogle ScholarGoogle Scholar
  34. DAGMan (Directed Acyclic Graph Manager).Google ScholarGoogle Scholar
  35. Garg, A.a.R., Adrian Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio. in Proceedings Graph Drawing. 2002. Irvine, CA, USA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Rich Wolski, N.T.S., Jim Hayes. The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing in Future Generation Computer Systems. 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. GridRod: a dynamic runtime scheduler for grid workflows

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ICS '07: Proceedings of the 21st annual international conference on Supercomputing
          June 2007
          315 pages
          ISBN:9781595937681
          DOI:10.1145/1274971

          Copyright © 2007 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 17 June 2007

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate584of2,055submissions,28%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader