Skip to main content

Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics

  • Chapter
Book cover Grid Computing

In this paper, we analyze the robustness of 20 static, makespan-centric, DAG scheduling heuristics of the literature. We also study if dynamically changing the order of the tasks on their assigned processor improves the robustness. Based on experimental results we investigate how robustness and makespan are correlated. Finally, the heuristics are experimentally evaluated and ranked according to their performance in terms of both robustness and makespan.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. I. Ahmad, M.K. Dhodhi, and R. Ul-Mustafa. DPS: Dynamic Priority Scheduling Heuristic for Heterogeneous Computing Systems. IEE Proceedings - Computers & Digital Techniques, 145(6), pp. 411-418, 1998.

    Article  Google Scholar 

  2. S. Ali, A. A. Maciejewski, H. J. Siegel, and J.-K. Kim. Measuring the Robustness of a resource Allocation. IEEE Transactions on Parallel and Distributed Systems, 15(7), pp. 630-641, July 2004.

    Article  Google Scholar 

  3. S. Ali, H.J. Siegel, M. Maheswaran, D. Hensgen and S. Ali. Task Execution Time Modeling for Heterogeneous Computing Systems. Proceedings of the 9th Heterogeneous Computing Workshop, pp. 185-199, 2000.

    Google Scholar 

  4. O. Beaumont, V. Boudet, and Y. Robert. The Iso-Level Scheduling Heuristic for Heterogeneous Processors. Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing (PDP2002), 2002.

    Google Scholar 

  5. G.B. Berriman, J.C. Good, A.C. Laity, A. Bergou, J. Jacob, D.S. Katz, E. Deelman, C. Kesselman, G. Singh, M. Su and R. Williams. Montage: a Grid Enabled Image Mosaci Service for the National Virtual Observatory. Astronomical Data Analysis Software and Systems XIII (ADASS XIII), Vol. 314, 2004.

    Google Scholar 

  6. J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, and K. Kennedy. Task Scheduling Strategies for Workflow-Based Applications in Grids. CCGrid 2005, 2005.

    Google Scholar 

  7. L. B öl öni and D. C. Marinescu. Robust scheduling of metaprograms. Journal of Scheduling, 5 (5), pp. 395-412, September 2002.

    MathSciNet  Google Scholar 

  8. T.D. Braun, H.J. Siegel, N. Beck, et al. A Comparison of Eleven Static Heuristic for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing, 61, pp. 810-837, 2001.

    Article  Google Scholar 

  9. L.-C. Canon and E. Jeannot. A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems. In HeteroPar’07, Sept. 2007.

    Google Scholar 

  10. H. Chen. On the Design of Task Scheduling in the Heterogeneous Computing Environments. IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, 2005.

    Google Scholar 

  11. D. England, J. Weissman, and J. Sadagopan. A New Metric for Robustness with Applica tion to Job Scheduling. Proceedings of the 14th IEEE International Symposium on High Performance Distributed Computing, pp. 135-143, July 2005.

    Google Scholar 

  12. T. Hagras and J. Janecek. A Simple Scheduling Heuristic for Heterogeneous Computing Environments. Proceedings of the 2nd International Symposium on Parallel and Distributed Computing, pp. 104-110, 2003.

    Google Scholar 

  13. M. Iverson, F. Ozguner, and G. Follen. Parallelizing Existing Applications in a Distributed Heterogeneous Environment. Proceedings of the 4th Heterogeneous Computing Workshop (HCW’95), 1995.

    Google Scholar 

  14. J.W.S. Liu and C.L. Liu. Bounds on scheduling algorithms for heterogeneous computing systems. Proceedings of IFIP Congress 74, pp. 349-353, 1974.

    Google Scholar 

  15. S. Manoharan and N. P. Topham. An Assessment of Assignment Schemes for Dependency Graphs. Parallel Computing, 21(1), pp. 85-107, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  16. H. Oh and S. Ha. A Static Scheduling Heuristic for Heterogeneous Processors. Proceedings of the 2nd International Euro-Par Conference, vol. 2, pp. 573-577, 1996.

    Google Scholar 

  17. A. Radulescu and A. Van Gemund. Fast and Effective Task Scheduling in Heterogeneous Systems. Proceedings of the 9th Heterogeneous Computing Workshop (HCW), pp. 229-238, 2000.

    Google Scholar 

  18. R. Sakellariou and H. Zhao. A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. Proceedings of the 13th Heterogeneous Computing Workshop (HCW), IEEE Computer Society Press, 2004.

    Google Scholar 

  19. R. Sakellariou and H. Zhao. A low-cost rescheduling policy for efficient mapping of work-flows on grid systems. Scientific Programming, 12(4), December 2004, pp. 253-262.

    Google Scholar 

  20. V. Shestak, J. Smith, H. J. Siegel, and A. A. Maciejewski. A Stochastic Approach to Measuring the Robustness of Resource Allocations in Distributed Systems. 2006 International Conference on Parallel Processing, August 2006.

    Google Scholar 

  21. Z. Shi, E. Jeannot, and J. J. Dongarra. Robust Task Scheduling in Non-Deterministic Heterogeneous Computing Systems. Proceedings of IEEE International Conference on Cluster Computing, September 2006.

    Google Scholar 

  22. G.C. Sih and E.A. Lee. A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architecture. IEEE Transactions on Parallel and Distributed Systems, 4(2), pp. 175-187, 1993.

    Article  Google Scholar 

  23. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems, 13(3), pp. 260-274, 2002.

    Article  Google Scholar 

  24. N. Woo and H.Y. Yeom. K-Depth Look-Ahead Task Scheduling in Network of Heterogeneous Processors. Lecture Notes in Computer Science, Vol. 2344, pp. 736-745, 2002.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Canon, LC., Jeannot, E., Sakellariou, R., Zheng, W. (2008). Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds) Grid Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09457-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09457-1_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09456-4

  • Online ISBN: 978-0-387-09457-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics