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

Skip to main content

Automatic spark strategies and granularity for a parallel functional language reducer

  • Conference paper
  • First Online:
Parallel Processing: CONPAR 94 — VAPP VI (VAPP 1994, CONPAR 1994)

Abstract

This paper considers the issue of dynamic task control in the context of a parallel Haskell implementation on the GRIP multiprocessor. For the first time, we report the effect of our task control strategies on task granularity, as measured in terms of dynamic heap allocations. This gives a concrete means of measuring the effectiveness of these strategies other than wall-clock timings, which are notoriously uninformative.

This work is supported by a Royal Society of Edinburgh Research Fellowship, and the SERC AQUA Project.

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

Access this chapter

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. Achten P, “Annotations for Load Distribution”, Proc 3rd. Intl. Workshop on Parallel Impl. of Funct. Langs., Glaser H (ed.), Univ. of Southampton, (June 1991).

    Google Scholar 

  2. Aharoni G, Feitelson DG, and Barak A, “A Run-Time Algorithm for Managing the Granularity of Parallel Functional Programs”, Journal of Functional Programming 2∶4, (October 1992), pp. 387–405.

    Google Scholar 

  3. Burton FW and Rayward-Smith VJ, “Worst Case Scheduling for Parallel Functional Programming”, To appear in Journal of Functional Programming, (1994).

    Google Scholar 

  4. Cole MI, Algorithmic Skeletons, Pitman/MIT Press, (1988).

    Google Scholar 

  5. Debray, SK, Lin N-W, and Hermenegildo, “Task Granularity Analysis in Logic Programs”, Proc. ACM Conf. on Prog. Lang. Design and Impl., (June 1990).

    Google Scholar 

  6. Eager DL, Zahorjan J and Lazowska ED, “Speedup versus efficiency in parallel systems”, Dept of Computational Science, University of Sasketchewan, 1986.

    Google Scholar 

  7. Hammond K, and Peyton Jones SL, “Some Early Experiments on the GRIP Parallel Reducer”, Proc 2nd. Intl. Workshop on Parallel Implementation of Functional Languages, Plasmeijer MJ (ed.), University of Nijmegen, (July 1990).

    Google Scholar 

  8. Hammond K, and Peyton Jones SL, “Profiling Scheduling Strategies on the GRIP Multiprocessor”, Proc 4th. Intl. Workshop on Parallel Implementation of Functional Languages, Küchen H (ed.), Aachen University, (September 1992).

    Google Scholar 

  9. Hammond K, “Implementation on a Parallel Machine: GRIP”, In Functional Languages Applied to Realistic Examplars: the FLARE Project, Runciman C and Wakeling D (eds.), Cambridge University Press, to appear (1994).

    Google Scholar 

  10. Hartel P, and Vree WG, “Benchmarking Lazy Functional Languages”, Proc. FPCA 93, Copenhagen, Denmark, (June 1993).

    Google Scholar 

  11. Hudak P, “Para-functional programming”, IEEE Computer 19(8), (August 1986).

    Google Scholar 

  12. Kelly PHJ, Functional Programming for Loosely-Coupled Multiprocessors, Pitman/MIT Press, (1989).

    Google Scholar 

  13. Mohr E, Kranz DA, and Halstead RH, “Lazy Task Creation — a Technique for Increasing the Granularity of Parallel Programs”, IEEE Transactions on Parallel and Distributed Systems, 2(3), (July 1991).

    Google Scholar 

  14. Ostheimer G, Parallel Functional Programming for Message-Passing Multiprocessors, PhD Thesis, University of St. Andrews, (March 1993).

    Google Scholar 

  15. Peyton Jones SL, Clack C, Salkild J, and Hardie, M, “GRIP — a high-performance architecture for parallel graph reduction”, Proc FPCA '87, Portland, Oregon, Kahn G (ed.), Springer-Verlag LNCS 274, (1987).

    Google Scholar 

  16. Peyton Jones SL, Hall CV, Hammond K, Partain WD and Wadler PL, “The Glasgow Haskell Compiler: a Technical Overview”, Proc. JFIT 93, Keele, (March 1993).

    Google Scholar 

  17. Ruggiero CA, and Sargeant J, “Control of parallelism in the Manchester dataflow machine”, Proc FPCA '87, Springer Verlag LNCS 274, (1987), pp. 1–15.

    Google Scholar 

  18. Sands DA, “A Naive Model of Time Complexity and its Theory of Cost Equivalence”, Internal Report, DIKU, Copenhagen, (June 1993).

    Google Scholar 

  19. Sargeant J, and Watson I, “Some Experiments in Controlling the Dynamic Behaviour of Parallel Functional Programs”, Proc 3rd. Intl. Workshop on Parallel Impl. of Funct. Langs., Glaser H (ed.), Univ. of Southampton, (June 1991).

    Google Scholar 

  20. Sargeant J, “Improving Compilation of Implicit Parallel Programs by Using Runtime Information”, Proc. Workshop on Compilation of Symbolic Langs. for Parallel Computers, Argonne National Lab. Technical Report ANL-91/34, pp. 129–148.

    Google Scholar 

  21. Siedl H, and Wilhelm R, “Probabilistic Load Balancing for Parallel Graph Reduction”, Proc IEEE TENCON 89, Bombay, India, (November 1989), pp. 879–884.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon L. Peyton Jones .

Editor information

Bruno Buchberger Jens Volkert

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hammond, K., Mattson, J.S., Jones, S.L.P. (1994). Automatic spark strategies and granularity for a parallel functional language reducer. In: Buchberger, B., Volkert, J. (eds) Parallel Processing: CONPAR 94 — VAPP VI. VAPP CONPAR 1994 1994. Lecture Notes in Computer Science, vol 854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58430-7_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-58430-7_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48789-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics