Skip to main content

Hierarchical Cross-Organizational Workflow Scheduling Algorithm in Cloud Environments

  • Conference paper
  • First Online:
  • 3991 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8944))

Abstract

Using DAG (Directed Acyclic Diagram) to model the Cross-Organization Workflow has been widely applied in Cloud Computing Environments. But cost optimization problem within the time constraint still needs to be addressed. As some algorithms, such as MCP (Minimum Critical Path) and DBL (Deadline Bottom Level), do not consider the structure of the relevant level, this paper proposes an algorithm for the Structure Aware Hierarchical Cross-Organizational Workflow Scheduling (SAH). Through analyzing the structure of each level, the redundant time can be partitioned more reasonably. The experiments demonstrate that SAH has better performance than MCP and DBL.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armbrust, M., Fox, A., Griffith, R., Joseph Anthony, D., Randy, K., et al.: A view of cloud computing. Communications of the ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  2. Foster, Y., Zhao, I., Raicu, S., et al.: Cloud computing and grid computing 360-degree compared, Grid Computing Environments Workshop, GCE 2008, 1–10. IEEE (2008)

    Google Scholar 

  3. Tannenbaum, T., Wright, D., Miller, K., Livny, M.: Condor: a distributed job scheduler, In: Beowulf cluster computing with Linux, pp. 307–350. MIT press (2001)

    Google Scholar 

  4. Berman, F., Casanova, H., Chien, A., et al.: New grid scheduling and rescheduling methods in the GrADS project. International Journal of Parallel Programming 33(3), 209–229 (2005)

    Article  Google Scholar 

  5. Deelman, E., Blythe, J., Gil, Y., et al.: Mapping abstract complex workflows onto grid environments. Journal of Grid Computing 1(1), 25–39 (2003)

    Article  Google Scholar 

  6. Yu, J., Buyya, R., Tham, C.K.: Cost-based scheduling of scientific workflow applications on utility grids. First International Conference on e-Science and Grid Computing, 140–147. IEEE press, Melbourne Australia (2005)

    Google Scholar 

  7. Yuan, Y., Li, X., Wang, Q., Zhang, Y.: Bottom Level Based Heuristic for Workflow Scheduling in Grids. Chinese Journal of Computers 31(2), 282–290 (2008)

    Article  Google Scholar 

  8. Tan, W., Jiang, C., Li, L., Lv, Z.: Role-oriented process-driven enterprise cooperative work using the combined rule scheduling strategies. Information Systems Frontiers 10(5), 519–529 (2008)

    Article  Google Scholar 

  9. Grefen, P., Aberer, K., Ludwig, H., Hoffner, Y.: Crossflow: Cross-organizational workflow management for service outsourcing in dynamic virtual enterprises. Bulletin of the Technical Committee on Data Engineering 24(1), 52–57 (2001)

    Google Scholar 

  10. Demeulemeester, E.L., Herroelen, W.S., Elmaghraby, S.E.: Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research 88(1), 50–68 (1996)

    Article  MATH  Google Scholar 

  11. Yu, J., Buyya, R.: A taxonomy of workflow management systems for grid computing. Journal of Grid Computing 3(3–4), 171–200 (2005)

    Article  Google Scholar 

  12. Yu, J., Buyya, R., Ramamohanarao, K.: Workflow scheduling algorithms for grid computing. Metaheuristics for scheduling in distributed computing environments, 173–214. Springer, Berlin Heidelberg (2008)

    Google Scholar 

  13. De, P., James Dunne, E., Ghosh, J.B., et al.: The discrete time-cost tradeoff problem revisited. European Journal of Operational Research 81(2), 225–238 (1995)

    Article  MATH  Google Scholar 

  14. Sulistio, A., Buyya, R.: A grid simulation infrastructure supporting advance reservation. In: 16th International Conference on Parallel and Distributed Computing and Systems (PDCS 2004), pp. 9–11 (2004)

    Google Scholar 

  15. Tan, W., Sun, Y., Li, L.X., Lu, G.: A trust service-oriented scheduling model for workflow applications in cloud computing. IEEE Systems Journal 8(3), 868–878 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wen’an Tan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tan, W., Peng, J., Sun, Y., Chen, S., Tang, A., Tang, S. (2015). Hierarchical Cross-Organizational Workflow Scheduling Algorithm in Cloud Environments. In: Zu, Q., Hu, B., Gu, N., Seng, S. (eds) Human Centered Computing. HCC 2014. Lecture Notes in Computer Science(), vol 8944. Springer, Cham. https://doi.org/10.1007/978-3-319-15554-8_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15554-8_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15553-1

  • Online ISBN: 978-3-319-15554-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics