Towards a Generalised Runtime Environment for Parallel Haskells

  • Jost Berthold
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3038)


Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by the even more complex parallelism to maintain a high level of abstraction. Starting from two parallel dialects of the purely functional language Haskell and their implementations, we generalise the characteristics of Haskell-based parallel language implementations, abstracting over low-level details. This generalisation is the basis for a shared runtime environment which can support different coordination concepts and alleviate the implementation of new constructs by a well-defined API and a layered structure.


Runtime Environment Task Creation Node Task Automatic Parallelisation Placeholder Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Hammond, K., Michaelson, G. (eds.): Research Directions in Parallel Functional Programming. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  2. 2.
    Trinder, P., Loidl, H.W., Pointon, R.: Parallel and Distributed Haskells. J. of Functional Programming 12 (2002)Google Scholar
  3. 3.
    Reinke, C. (ed.): Haskell Communities and Activities Report. Fifth Edition (2003),
  4. 4.
    Trinder, P., Hammond, K., Mattson Jr., J., Partridge, A., Peyton Jones, S.: GUM: a Portable Parallel Implementation of Haskell. In: PLDI 1996, ACM Press, New York (1996)Google Scholar
  5. 5.
    Breitinger, S., Loogen, R., Ortega-Mallén, Y., Peña, R.: The Eden Coordination Model for Distributed Memory Systems. In: Euro-Par 1996. LNCS, vol. 1123, IEEE Press, Los Alamitos (1997)Google Scholar
  6. 6.
    Peyton Jones, S., Hall, C., Hammond, K., Partain, W., Wadler, P.: The Glasgow Haskell Compiler: a Technical Overview. In: JFIT 1993 (1993)Google Scholar
  7. 7.
    Trinder, P., Hammond, K., Loidl, H.W., Peyton Jones, S.: Algorithm + Strategy = Parallelism. J. of Functional Programming 8 (1998)Google Scholar
  8. 8.
    Loidl, H.W.: Granularity in Large-Scale Parallel Functional Programming. PhD thesis, Department of Computing Science, University of Glasgow (1998)Google Scholar
  9. 9.
    Berthold, J., Klusik, U., Loogen, R., Priebe, S., Weskamp, N.: High-level Process Control in Eden. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 732–741. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Loogen, R., Ortega-Mallén, Y., Peña, R., Priebe, S., Rubio, F.: Parallelism Abstractions in Eden. In: Rabhi, F.A., Gorlatch, S. (eds.) Patterns and Skeletons for Parallel and Distr. Computing. LNCS, vol. 2011, Springer, Heidelberg (2002)Google Scholar
  11. 11.
    Loidl, H.W., Hammond, K.: Making a Packet: Cost-Effective Comm. for a Parallel Graph Reducer. In: Kluge, W.E. (ed.) IFL 1996. LNCS, vol. 1268, Springer, Heidelberg (1997)Google Scholar
  12. 12.
    MPI Forum: MPI 2: Extensions to the Message-Passing Interface. Technical report, University of Tennessee, Knoxville (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jost Berthold
    • 1
  1. 1.Fachbereich Mathematik und InformatikPhilipps-Universität MarburgMarburgGermany

Personalised recommendations