Skip to main content
SpringerLink
Log in

Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing

  • Conference paper
High Performance Computing (ISHPC 2003)

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

Included in the following conference series:

Abstract.

Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (non-optimal) heuristic algorithms have to be used. One major drawback with heuristics is that we do not know if the result is close to optimal or not. Here, we present a method for finding an upper bound on the minimal completion time for a given program. The bound helps the user to determine when it is worth-while to continue the heuristic search for better allocations. Based on some parameters derived from the program, as well as some parameters describing the hardware platform, the method produces the minimal completion time bound. A practical demonstration of the method is presented using a tool that produces the bound.

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

Access this chapter

Log in via an institution
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.

Similar content being viewed by others

References

  1. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Heidelberg (1996) ISBN 3-540-61496-6

    MATH  Google Scholar 

  2. Broberg, M., Lundberg, L., Grahn, H.: Visualization and Performance Prediction of Multithreaded Solaris Programs by Tracing Kernel Threads. In: Proc. of the 13th International Parallel Processing Symposium, pp. 407-413 (1999)

    Google Scholar 

  3. Broberg, M., Lundberg, L., Grahn, H.: VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs. In: Proceedings of the 12th International Parallel Processing Symposium, pp. 770-776 (1998)

    Google Scholar 

  4. Bokhari, S.H.: Partitioning Problems in Parallel, Pipelined, and Distributed Computing. IEEE Transactions on Computers 37(1) (1988)

    Google Scholar 

  5. Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  6. Hagersten, E., Koster, M.: WildFire: A Scalable Path for SMPs. In: Proc. of the Fifth International Symposium on High Performance Computer Architecture, pp. 172-181 (1999)

    Google Scholar 

  7. Kleiman, S., Shah, D., Smaalders, B.: Programming with threads. Prentice Hall, Englewood Cliffs (1996)

    Google Scholar 

  8. Laudon, J., Lenoski, D.: The SGI Origin: A ccNUMA Highly Scalable Server. In: Proc. of the 24th Annual International Symposium on Computer Architecture (ISCA), pp. 241- 251 (1997)

    Google Scholar 

  9. Lennerstad, H., Lundberg, L.: An optimal Execution Time Estimate of Static versus Dynamic Allocation in Multiprocessor Systems. SIAM Journal of Computing 24(4), 751–764 (1995)

    Article  MathSciNet  Google Scholar 

  10. Lennerstad, H., Lundberg, L.: Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. SIAM Journal of Computing 29(6), 1816–1838 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lennerstad, H., Lundberg, L.: Optimal Worst Case Formulas Comparing Cache Memory Associativity. SIAM Journal of Computing 30(3), 872–905 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lovett, T., Clapp, R.: STiNG: A cc-NUMA Computer System for the Commercial Marketplace. In: Proc. of the 23rd Annual International Symposium on Computer Architecture (ISCA), pp. 308-317 (1996)

    Google Scholar 

  13. Lundberg, L., Lennerstad, H.: Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 9(4), 346–358 (1998)

    Article  Google Scholar 

  14. Lundberg, L., Lennerstad, H.: An Optimal Upper Bound on the Minimal Completion Time in Distributed Supercomputing. In: Proc. of the 1994 ACM International Conference on Supercomputing, pp. 196-203 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering and Computer Science, Blekinge Institute of Technology, S-372 25, Ronneby, Sweden

    Lars Lundberg, Magnus Broberg & Kamilla Klonowska

Authors
  1. Lars Lundberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magnus Broberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamilla Klonowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California (UCI), 3019 Donald Bren Hall, 92697-3435, Irvine, CA, USA

    Alex Veidenbaum

  2. Department of Information and Computer Science, Faculty of Science, Nara women’s University, Kitauoyanishi-machi, Nara-city, 630-8506, Nara, Japan

    Kazuki Joe

  3. Keio University, Hiyoshi, Kohoku, Yokohama, 223–8522, Kanagawa, Japan

    Hideharu Amano

  4. Tokyo University of Technology, 1404-1 Katakura, Hachioji, 192-0982, Tokyo, Japan

    Hideo Aiso

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lundberg, L., Broberg, M., Klonowska, K. (2003). Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing. In: Veidenbaum, A., Joe, K., Amano, H., Aiso, H. (eds) High Performance Computing. ISHPC 2003. Lecture Notes in Computer Science, vol 2858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39707-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39707-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39707-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation