Skip to main content

Feedback Guided Scheduling of Nested Loops

  • Conference paper
  • First Online:
Applied Parallel Computing. New Paradigms for HPC in Industry and Academia (PARA 2000)

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

Included in the following conference series:

Abstract

In earlier papers ([2], [3],[6]) feedback guided loop scheduling algorithms have been shown to be very effective for certain loop scheduling problems which involve a sequential outer loop and a parallel inner loop and for which the workload of the parallel loop changes only slowly from one execution to the next. In this paper the extension of these ideas the case of nested parallel loops is investigated. We describe four feedback guided algorithms for scheduling nested loops and evaluate the performances of the algorithms on a set of synthetic benchmarks.

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 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.

References

  1. D. F. Bacon, S. L. Graham and O. J. Sharp, (1994) Compiler Transformations for High-Performance Computing, ACM Computing Surveys, vol. 26, no. 4, pp. 345–420.

    Google Scholar 

  2. J. M. Bull, (1998) Feedback Guided Loop Scheduling: Algorithms and Experiments, Proceedings of Euro-Par’98, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  3. J. M. Bull, R. W. Ford and A. Dickinson, (1996) A Feedback Based Load Balance Algorithm for Physics Routines in NWP, Proceedings of Seventh ECMWF Workshop on the Use of Parallel Processors in Meteorology, World Scientific.

    Google Scholar 

  4. A. R. Butz, (1971) Alternative Algorithm for Hilbert’s Space-Filling Curve, IEEE Trans. on Computers, vol. 20, pp. 424–426.

    MATH  Google Scholar 

  5. D. L. Eager and J. Zahorjan, (1992) Adaptive Guided Self-Scheduling, Technical Report 92-01-01, Department of Computer Science and Engineering, University of Washington.

    Google Scholar 

  6. R. W. Ford, D. F. Snelling and A. Dickinson, (1994) Controlling Load Balance, Cache Use and Vector Length in the UM, Proceedings of Sixth ECMWF Workshop on the Use of Parallel Processors in Meteorology, World Scientific.

    Google Scholar 

  7. S. F. Hummel, E. Schonberg and L. E. Flynn, (1992) Factoring: A Practical and Robust Method for Scheduling Parallel Loops, Communications of the ACM, vol. 35, no. 8, pp. 90–101.

    Google Scholar 

  8. S. Lucco, (1992) A Dynamic Scheduling Method for Irregular Parallel Programs, in Proceedings of ACM SIGPLAN’ 92 Conference on Programming Language Design and Implementation, San Francisco, CA, June 1992, pp. 200–211.

    Google Scholar 

  9. E. P. Markatos and T. J. LeBlanc, (1994) Using Processor Affinity in Loop Scheduling on Shared Memory Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 4, pp. 379–400.

    Article  Google Scholar 

  10. N. Mukhopadhyay, (1999) On the Effectiveness of Feedback-guided Parallelisation, PhD Thesis, Department of Computer Science, University of Manchester.

    Google Scholar 

  11. C. D. Polychronopoulos and D. J. Kuck, (1987) Guided Self-Scheduling: A Practical Scheduling Scheme for Parallel Supercomputers, IEEE Transactions on Computers, C-36(12), pp. 1425–1439.

    Article  Google Scholar 

  12. S. Subramaniam and D. L. Eager, (1994) Affnity Scheduling of Unbalanced Workloads, in Proceedings of Supercomputing’94, IEEE Comp. Soc. Press, pp. 214–226.

    Google Scholar 

  13. T. H. Tzen and L. M. Ni, (1993) Trapezoid Self-Scheduling Scheme for Parallel Computers, IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 1, pp. 87–98.

    Article  Google Scholar 

  14. Y. Yan, C. Jin and X. Zhang, (1997) Adaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems, IEEE Trans. on Parallel and Distributed Systems, vol. 8, no. 1, pp. 70–81.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freeman, T.L., Hancock, D.J., Bull, J.M., Ford, R.W. (2001). Feedback Guided Scheduling of Nested Loops. In: Sørevik, T., Manne, F., Gebremedhin, A.H., Moe, R. (eds) Applied Parallel Computing. New Paradigms for HPC in Industry and Academia. PARA 2000. Lecture Notes in Computer Science, vol 1947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70734-4_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-70734-4_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41729-3

  • Online ISBN: 978-3-540-70734-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics