Skip to main content

A Theoretical Application of Feedback Guided Dynamic Loop Scheduling

  • Conference paper
  • First Online:
Advanced Environments, Tools, and Applications for Cluster Computing (IWCC 2001)

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

Included in the following conference series:

  • 350 Accesses

Abstract

In this paper we briefly describe the Feedback-Guided Dynamic Loop Scheduling (FGDLS) algorithm that was proposed in Bull et al. [2] and Bull [1]. The FGDLS algorithm uses a feedback mechanism, based on measured execution times, to schedule a parallel loop within a sequential outer loop. We compare the FGDLS algorithm with other scheduling algorithms for a simple model problem — the parallel computation of the inverse of a triangular matrix.

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. J.M. Bull (1998) Feedback Guided Loop Scheduling: Algorithm and Experiments, Proceedings of Euro-Par’98, Lecture Notes in Computer Science, Springer Verlag.

    Google Scholar 

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

    Google Scholar 

  3. J.M. Bull, R.W. Ford, T.L. Freeman and D.J. Hancock (1999) A Theoretical Investigation of Feedback Guided Loop Scheduling, Proceedings of Ninth SIAM Conference on Parallel Processing for Scientific Computing, SIAM Press.

    Google Scholar 

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

  5. T.L. Freeman and C. Phillips (1992) Parallel Numerical Algorithms, Prentice Hall, New York.

    MATH  Google Scholar 

  6. T.L. Freeman, D.J. Hancock, J.M. Bull and R.W. Ford (2001) Feedback Guided Scheduling of Nested Loops, In Applied Parallel Computing, ed. T. Sørevik, F. Manne, R. Moe, A. H. Gebremedhin, Lecture Notes in Computer Science, vol. 1947, pp. 149–159, Springer-Verlag, Berlin.

    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.

    Article  Google Scholar 

  8. J. Jájá (1992) An Introduction to Parallel Algorithms, Addison-Wesley, Reading, Massachusetts.

    Google Scholar 

  9. C.P. Kruskal and A. Weiss (1985) Allocating Independent Subtasks on Parallel Processors, IEEE Trans. on Software Engineering, vol. 11, no. 10, pp. 1001–1016.

    Article  Google Scholar 

  10. S. Lakshmivarahan and S.K. Dhall (1990) Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems, McGraw-Hill, New York.

    Google Scholar 

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

    Article  Google Scholar 

  12. S. Subramanian and D.L. Eager (1994) Affinity Scheduling of Unbalanced Workloads, Proceedings of SuperComputing 94, IEEE Comp. Soc. Press, pp. 214–226.

    Google Scholar 

  13. R. Sakellariou (1997) On the Quest for Perfect Load Balance in Loop-Based Parallel Computation, PhD Thesis, Department of Computer Science, Manchester University.

    Google Scholar 

  14. G.W. Stewart (1973) Introduction to Matrix Computations, Academic Press, New York.

    MATH  Google Scholar 

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

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

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tabirca, T., Freeman, L., Tabirca, S. (2002). A Theoretical Application of Feedback Guided Dynamic Loop Scheduling. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-47840-X_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43672-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics