Nothing Special   »   [go: up one dir, main page]

Skip to main content

Abstract

Heterogeneous computing (HC) environment consists of different resources connected with high-speed links to provide a variety of computational capabilities for computing-intensive applications having multifarious computational requirements. The problem of optimal assignment of tasks to machines in HC environment is proven to be NP-complete requiring use of heuristics to find the near optimal solution. In this work we conduct a performance study of task scheduling heuristics in HC environment. Overall we have implemented 16 heuristics, among them 7 are proposed in this paper. Based on experimental results we specify the circumstances under which one heuristic will outperform the others.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Braun, T.D., et al.: A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing 61, 810–837 (2001)

    Article  MATH  Google Scholar 

  2. El-Rewini, H., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. PTR Prentice Hall, New Jersey (1994)

    Google Scholar 

  3. Kim, J.K., et al.: Dynamically Mapping Tasks with Priorities and Multiple Deadlines in a Heterogeneous Environment. Journal of Parallel and Distributed Computing 67, 154–169 (2007)

    Article  MATH  Google Scholar 

  4. Kwok, Y.K., et al.: A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing system. Journal of Parallel and Distributed Computing 66, 77–98 (2006)

    Article  MATH  Google Scholar 

  5. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman Publishers, San Francisco (1999)

    Google Scholar 

  6. Kwok, Y.K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys 31, 406–471 (1999)

    Article  Google Scholar 

  7. Maheswaran, M., et al.: Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. In: Proceedings of the 8th IEEE Heterogeneous Computing Workshop, pp. 30–44 (1999)

    Google Scholar 

  8. Wu, M.Y., Shu, W., Zhnag, H.: Segmented min-min: A Static Mapping Algorithm for Meta-Tasks on Heterogeneous Computing Systems. In: Proceedings of the 9th Heterogeneous Computing Workshop, pp. 375–385 (2000)

    Google Scholar 

  9. Sakellariou, R., Zhao, H.: A Hybrid Heuristic for Dag Scheduling on Heterogeneous Systems. In: Proceedings of the 13th Heterogeneous Computing Workshop (2004)

    Google Scholar 

  10. Ali, S., et al.: Task Execution Time Modeling for Heterogeneous Computing Systems. In: Proceedings of the 9th Heterogeneous Computing Workshop, pp. 185–200 (2000)

    Google Scholar 

  11. Freund, R.F., et al.: Scheduling Resources in Multi-User, Heterogeneous, Computing Environments with Smartnet. In: Proceedings of the 7th Heterogeneous Computing Workshop, pp. 184–199 (1998)

    Google Scholar 

  12. Yarmolenko, V., Duato, J., Panda, D.K., Sadayappan, P.: Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems. In: International Conference on Parallel Processing, pp. 437–444 (2000)

    Google Scholar 

  13. Luo, P., Lu, K., Shi, Z.Z.: A Revisit of Fast Greedy Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Computing Systems. Journal of Parallel and Distributed Computing 67, 695–714 (2007)

    Article  MATH  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-Verlag Berlin Heidelberg

About this paper

Cite this paper

Munir, E.U., Li, J., Shi, S., Zou, Z., Rasool, Q. (2008). A Performance Study of Task Scheduling Heuristics in HC Environment. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics