A novel approach to parenting in functional program evaluation

Authors:
Julian R. Dermoudy
Affiliations:
School of Computing, University of Tasmania, GPO Box 252-100, Hobart 7001, Tasmania
Venue:
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Year:
2003

Citing 6
Cited 0

GRIP—A high-performance architecture for parallel graph reduction

Proc. of a conference on Functional programming languages and computer architecture
Parallel implementations of functional programming languages

The Computer Journal - Special issue on Lazy functional programming
GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Bypassing of Channels in Eden

SFP '99 Selected papers from the 1st Scottish Functional Programming Workshop (SFP99)
The Glasgow Haskell Compiler: A Retrospective

Proceedings of the 1992 Glasgow Workshop on Functional Programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph components may be shared. Shared closures, however, compound the difficulty of priority management.The original GUM runtime system does not track which threads require the evaluation of which closures or which sparks relate to which threads. These problems are remedied in the novel implementation of GUM presented here which introduces dynamic thread hierarchies and supports prioritised scheduling.