GUM: a portable parallel implementation of Haskell. GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained research interest in parallel functional programming, GUM is one of the first such systems to be made publicly available.GUM is message-based, and portability is facilitated by using the PVM communications harness that is available on many multi-processors. As a result, GUM is available for both shared-memory (Sun SPARCserver multiprocessors) and distributed-memory (networks of workstations) architectures. The high message-latency of distributed machines is ameliorated by sending messages asynchronously, and by sending large packets of related data in each message.Initial performance figures demonstrate absolute speedups relative to the best sequential compiler technology. To improve the performance of a parallel Haskell program GUM provides tools for monitoring and visualising the behaviour of threads and of processors during execution.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 13 articles )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Berthold, Jost; Loidl, Hans-Wolfgang; Hammond, Kevin: PAEAN: portable and scalable runtime support for parallel Haskell dialects (2016)
  2. Dieterle, M.; Horstmeyer, T.; Loogen, R.; Berthold, J.: Skeleton composition versus stable process systems in Eden (2016)
  3. de la Encina, Alberto; Rodríguez, Ismael; Rubio, Fernando: pHood: tool description, analysis techniques, and case studies (2014) ioport
  4. Jakšić, Svetlana; Padovani, Luca: Exception handling for copyless messaging (2014)
  5. Achten, Peter; van Eekelen, Marko; Koopman, Pieter; Morazán, Marco T.: Trends in trends in functional programming 1999/2000 versus 2007/2008 (2010)
  6. Loidl, Hans-Wolfgang; Trinder, Phil; Hammond, Kevin; Al Zain, Abdallah; Baker-Finch, Clem: Semi-explicit parallel programming in a purely functional style: GpH (2009)
  7. Martínez, Rafael; Peña, Ricardo: Building an interface between Eden and Maple: A way of parallelizing computer algebra algorithms (2004)
  8. Hidalgo-Herrero, Mercedes; Ortega-Mallén, Yolanda: Continuation semantics for parallel Haskell dialects (2003)
  9. Loidl, H.-W.; Rubio, F.; Scaife, N.; Hammond, K.; Horiguchi, S.; Klusik, U.; Loogen, R.; Michaelson, G. J.; Peña, R.; Priebe, S.; Rebón, Á. J.; Trinder, P. W.: Comparing parallel functional languages: Programming and performance (2003)
  10. Junaidu, Sahalu B.; Trinder, Phil W.: Parallelising large irregular programs: An experience with Naira (2002)
  11. Moreau, Luc: Tree rerooting in distributed garbage collection: Implementation and performance Evaluation (2001)
  12. Hammond, Kevin (ed.); Michaelson, Greg (ed.): Research directions in parallel functional programming (1999)
  13. Chakravarty, Manuel M.T.: On the massively parallel execution of declarative programs (1997)