See this document in CiteSeerX!

Parallel Graph Reduction with the -machine (1989)  (Make Corrections)  
Lennart Augustsson, Thomas Johnsson
FPCA '89, The Fourth International Conference on Functional Programming Languages and Computer Architecture



  Home/Search   Context   Related

 
View or download:
md.chalmers.se/~jo...ductionnug.ps.gz
cs.chalmers.se/~jo...ductionnug.ps.gz
math.chalmers.se/~...ductionnug.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  md.chalmers.se/~johnsson/ (more)
From:  math.chalmers.se/~johnsson/
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We have implemented a parallel graph reducer on a commercially available shared memory multiprocessor (a Sequent Symmetry TM ), that achieves real speedup compared to a a fast compiled implementation of the conventional Gmachine. Using 15 processors, this speedup ranges between 5 and 11, depending on the program. Underlying the implementation is an abstract machine called the h; Gi-machine. We describe the sequential and the parallel h; Gi-machine, and our implementation of them. We provide... (Update)

Similar documents based on text:   More   All
0.3:   Parallel Evaluation of Functional Programs: The G-machine approach - Johnsson (1991)   (Correct)
0.3:   Implementing lazy functional languages on stock hardware: the.. - Jones (1992)   (Correct)
0.2:   Target code generation from G-machine code - Johnsson (1986)   (Correct)

BibTeX entry:   (Update)

@inproceedings{ augustsson89parallel,
    author = "Lennart Augustsson and Thomas Johnsson",
    title = "{Parallel Graph Reduction with the $\langle{v,G}\rangle$-machine}",
    booktitle = "{FPCA '89, The Fourth International Conference on Functional Programming Languages and Computer Architecture}",
    publisher = "ACM Press, New York",
    address = "Imperial College, London, September 11--13",
    pages = "202--213",
    year = "1989",
    url = "citeseer.ist.psu.edu/augustsson89parallel.html" }
Citations (may not include all citations):
94   Real-time Concurrent Collection on Stock Multiprocessors - Appel, Ellis et al. - 1988
85   Garbage collection can be faster than stack allocation - Appel - 1987
84   Lambda Lifting: Transforming Programs to Recursive Equations - Johnsson - 1985
66   Efficient Compilation of Lazy Evaluation - Johnsson - 1984
59   A Compiler for Lazy ML (context) - Augustsson - 1984
42   Multiprocessor Execution of Functional Programs (context) - Goldberg - 1988
39   The Spineless Tagless G-machine (context) - Jones, Salkild - 1989
35   Super Combinators---A New Implementation Method for Applicat.. (context) - Hughes - 1982
22   The HDG-machine: A Highly Distributed Graph Reducer for a Tr.. - Kingdon, Lester et al. - 1989
20   Alice: A Multi-Processor Reduction Machine for the Parallel .. (context) - Darlington - 1981
12   Evaluating Functional Programs on the FLAGSHIP Machine (context) - Watson, Watson - 1987
9   Serial Combinators: Optimal Grains of Parallelism (context) - Goldberg, Hudak - 1985
9   Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor (context) - Goldberg - 1988
9   GRIP: A Parallel Graph Reduction Machine (context) - Jones - 1987
8   A Shared Memory Parallel Gmachine Based on the Evaluation Tr.. (context) - Burn - 1988

[Article contains additional citations not shown here]

Documents on the same site (http://www.md.chalmers.se/~johnsson/):   More
Parallel Evaluation of Functional Programs: The G-machine approach - Johnsson (1991)   (Correct)
The GRIN Project: A Highly Optimising Back End for Lazy.. - Boquist, Johnsson (1996)   (Correct)
Efficient Compilation of Lazy Evaluation - Johnsson (1984)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC