Skip to main content

Advanced Resource Management and Scheduling of Workflow Applications in JavaSymphony

  • Conference paper
High Performance Computing – HiPC 2005 (HiPC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3769))

Included in the following conference series:

Abstract

JavaSymphony is a high-level programming model for performance oriented distributed and parallel Java applications, which allows the programmer to control parallelism, load balancing, and locality at a high level of abstraction. In this paper, we describe an extension of JavaSymphony that deals with distributed workflow applications as graphs of software components, which can be executed on a distributed set computers. Workflows are not limited to DAGs, but also cover complex control flow including loops. Furthermore, we introduce a novel approach for workflow scheduling based on the HEFT algorithm and resource brokerage for a heterogeneous set of computers. We demonstrate the effectiveness of our approach with two real-world applications and compare our techniques against the widely known DAGMan Condor scheduler.

The work described in this paper is partially supported by the Austrian Grid Project, funded by the Austrian BMBWK (Federal Ministry for Education, Science and Culture) under contract GZ 4003/2-VI/4c/2004.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, T., Curbera, F., Dholakia, H., Goland, Y., Klein, J., Leymann, F., Liu, K., Roller, D., Smith, D., Systems, S., Thatte, S., Trickovic, I., Weerawarana, S.: Business process execution language for web services (bpel4ws). Specification version 1.1, Microsoft, BEA, and IBM (May 2003)

    Google Scholar 

  2. Baskiyar, S., SaiRanga, P.C.: Scheduling directed a-cyclic task graphs on heterogeneous network of workstations to minimize schedule length. In: Proc. of International Conference on Parallel Processing Workshops, Kaohsiung, Taiwan (October 2003)

    Google Scholar 

  3. Fahringer, T., Jugravu, A.: JavaSymphony: New Directives to Control and Synchronize Locality, Parallelism, and Load Balancing for Cluster and GRID-Computing. In: ACM Java Grande - ISCOPE 2002 Conference, Seattle. ACM, New York (2002)

    Google Scholar 

  4. Jugravu, A., Fahringer, T.: JavaSymphony, A Programming Model for the Grid. Future Generation Computer Systems (FGCS) 21(1), 239–246 (2005)

    Article  Google Scholar 

  5. Jugravu, A., Fahringer, T.: Scheduling Workflow Distributed Applications in JavaSymphony. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 272–281. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Krishnan, S., Wagstrom, P., von Laszewski, G.: GSFL: A Workflow Framework for Grid Services. Technical Report, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne, IL 60439, U.S.A (July 2002)

    Google Scholar 

  7. Kwok, Y.-K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing 59(3), 381–422 (1999)

    Article  MATH  Google Scholar 

  8. Blaha, P., Schwarz, K., Madsen, G., Kvasnicka, D., Luitz, J.: WIEN2k: An Augmented Plane Wave plus Local Orbitals Program for Calculating Crystal Properties. Vienna University of Technology (2001)

    Google Scholar 

  9. Ping, T.T., Sodhy, G.C., Yong, C.H., Haron, F., Buyya, R.: A Market-Based Scheduler for JXTA-Based Peer-to-Peer Computing System. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3046, pp. 147–157. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Radulescu, A., van Gemund, A.J.C.: Low-cost task scheduling for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems 13(6) (June 2002)

    Google Scholar 

  11. The Condor Team. Dagman (Directed Acyclic Graph Manager), http://www.cs.wisc.edu/condor/dagman/

  12. Topcuoglu, H., Hariri, S., Wu, M.-Y.: Task scheduling algorithms for heterogeneous processors. In: Eighth Heterogeneous Computing Workshop, pp. 3–14. IEEE C.S. Press, Los Alamitos (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jugravu, A., Fahringer, T. (2005). Advanced Resource Management and Scheduling of Workflow Applications in JavaSymphony. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_27

Download citation

  • DOI: https://doi.org/10.1007/11602569_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30936-9

  • Online ISBN: 978-3-540-32427-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics