Skip to main content
Springer Nature Link
Log in

Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems

  • Conference paper
  • First Online:
High Performance Computing — HiPC 2000 (HiPC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1970))

Included in the following conference series:

  • 430 Accesses

Abstract

Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines in a heterogeneous environment where expected execution time of each task on each machine is known. Although this problem has been much studied in the past, we derive new insights into the effectiveness of different mapping heuristics by use of two metrics - efficacy (E) and utilization (U). Whereas there is no consistent rank ordering of the various previously proposed mapping heuristics on the basis of total task completion time, we find a very consistent rank ordering of the mapping schemes with respect to the new metrics. Minimization of total completion time requires maximization of the product E×U. Using the insights provided by the metrics, we develop a new matching heuristic that produces high-quality mappings using much less time than the most effective previously proposed schemes.

This work was supported in part by a grant from the Ohio Board of Regents.

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

Access this chapter

Log in via an institution

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

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. A.H. Alhusaini, V. K. Prasanna, and C. S. Raghavendra. A Unified Resource Scheduling Framework for Heterogeneous Computing Environments, 8th Heterogeneous Computing Workshop (HCW’ 99), Apr. 1999

    Google Scholar 

  2. R. Armstrong, D. Hensgen, and T. Kidd. The Relative Performance of Various Mapping Algorithms is Independent of Sizable Variances in Run-time Predictions, 7th IEEE Heterogeneous Computing Workshop (HCW’98), Mar. 1998, pp.79–87

    Google Scholar 

  3. B. Armstrong, R. Eigenmann. Performance Forecasting: Towards a Methodology for Characterizing Large Computational Applications. Proceedings of the 1998 International Conference on Parallel Processing, Aug. 1998, pp. 518–527

    Google Scholar 

  4. F. Berman, R. Wolski, S. Figueira, J. Schopf, and G. Shao. Aplication-Level Scheduling on Distributed Heterogeneous Networks, Proceedings of Supercomputing 1996

    Google Scholar 

  5. F. Berman and R. Wolski. Scheduling from the Perspective of the Application, from Proceedings of Symposium on High Performance Distributed Computing, 1996

    Google Scholar 

  6. T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran, A. I. Reuther, J. R. Robertson, M. D. Theys, Bin Yao, D. Hensgen, and R. F. Freund. A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems, 8th IEEE Heterogeneous Computing Workshop (HCW’99), Apr. 1999, pp.15–29

    Google Scholar 

  7. T.D. Braun, H.J. Siegel, N. Beck, L.L. Bölöni, M. Maheswaran, A.I. Reuther, J.P. Robertson, M.D. Theys, and B. Yao. A Taxonomy for Describing Matching and Scheduling Heuristics for Mixed-machine Heterogeneous Computing Systems, IEEE Workshop on Advances in Parallel and Distributed Systems, Oct. 1998, pp. 330–335

    Google Scholar 

  8. F. Chang, V. Karamcheti, Z. Kedem. Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management. Proceedings of the 13th International Parallel Processing Symposium / Symposium 10th Symposium on Parallel and Distributed Processing, Apr. 1999, pp.749–758

    Google Scholar 

  9. D. Feitelson, A. Weil. Utilization and Predictability in Scheduling the IBM SP/2 with Backfilling. Proceedings of the 12th International Parallel Processing / Symposium 9th Symposium on Parallel and Distributed Processing, Apr. 1998, pp. 542–548

    Google Scholar 

  10. I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, 1998

    Google Scholar 

  11. P. Holenarsipur, V. Yarmolenko, J. Duato, D.K. Panda, and P. Sadayappan, “Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems,” Technical report OSU-CISRC-2/00-TR07, Department of Computer and Information Science, Ohio State University, 2000

    Google Scholar 

  12. O. H. Ibarra and C. E. Kim. Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors. Journal of the ACM, Vol.24, No.1, Jan. 1977, pp. 280–289

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Kafil and I. Ahmad. Optimal Task Assignment in Heterogeneous Computing Systems. 6th IEEE Heterogeneous Computing Workshop (HCW’97), Apr. 1997, pp. 135–146

    Google Scholar 

  14. W. Leinberger, G. Karypis, and V. Kumar. Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints. Proceedings of the 1999 International Conference on Parallel Processing, Aug. 1999, pp. 404–413

    Google Scholar 

  15. M. Maheswaran, Shoukat Ali, H. J. Siegel, D. Hensgen, and R. F. Freund. Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. 8th IEEE Heterogeneous Computing Workshop (HCW’99), Apr. 1999, pp. 30–44

    Google Scholar 

  16. A. Radulescu and A. van Gemund. FLB: Fast Load Balancing for Distributed-Memory Machines. Proceedings of the 1999 International Conference on Parallel Processing, Aug. 1999, pp. 534–542

    Google Scholar 

  17. J. Schopf, F. Berman. Performance Prediction in Production Environments. Proceedings of the 12th International Parallel Processing/Symposium 9th Symposium on Parallel and Distributed Processing, Apr. 1998, pp. 647–654

    Google Scholar 

  18. G. Shao, R. Wolski and F. Berman. Performance Effects of Scheduling Strategies for Master/Slave Distributed Applications. UCSD Technical Report No. CS98-598

    Google Scholar 

  19. H. Singh and A. Youssef, Mapping and Scheduling Heterogeneous Task Graphs using Genetic Algorithms. 5th IEEE Heterogeneous Computing Workshop (HCW’96), Apr. 1996

    Google Scholar 

  20. H. Topcuoglu, S. Hariri, and Min-You Wu. Task Scheduling Algorithms for Heterogeneous Processors. 8th IEEE Heterogeneous Computing Workshop (HCW’99),Apr. 1999, pp. 3–14

    Google Scholar 

  21. L. Wang, H. J. Siegel and V. P. Roychowdhury. A Genetic-Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environments. 5th IEEE Heterogeneous Computing Workshop (HCW’96), Apr. 1996

    Google Scholar 

  22. L. A. Yan, J. K. Antonio. Estimating the Execution Time Distribution for a Task Graph in a Heterogeneous Computing System. 6th IEEE Heterogeneous Computing Workshop (HCW’97), Apr. 1997, pp. 172–184

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer and Information Science, The Ohio State University, 43210-1277, Columbus, OH

    Praveen Holenarsipur, Vladimir Yarmolenko, Jose Duato, D. K. Panda & P. Sadayappan

Authors
  1. Praveen Holenarsipur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Yarmolenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jose Duato
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. K. Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. P. Sadayappan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DAC-UPC,Computer Architecture Department, Technical University of Catalonia, Campus Nord,D6,Jordi Girona,1-3, Barcelona, Spain

    Mateo Valero

  2. Department of EE-Systems Computer Engineering Division, University of Southern California, 3740 McClintok Ave,EEB 200C, 90089-2562, Los Angeles, CA, USA

    Viktor K. Prasanna

  3. Indian Institute of Science, Sir C.V.Raman Avenue, 560012, Bangalore, India

    Sriram Vajapeyam

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holenarsipur, P., Yarmolenko, V., Duato, J., Panda, D.K., Sadayappan, P. (2000). Characterization and Enhancement of Static Mapping Heuristics for Heterogeneous Systems. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2000. HiPC 2000. Lecture Notes in Computer Science, vol 1970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44467-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44467-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41429-2

  • Online ISBN: 978-3-540-44467-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics