Equals - A fast parallel implementation of a lazy language

Journal of Functional Programming

Volumn 7, Issue 2, 1997, Pages 183-217

  Kaser, Owen ^a   Ramakrishnan, C R ^b   Ramakrishnan, I V ^b   Sekar, R C ^c  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b USA   (United States)

^c Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031508891     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796897002669     Document Type: Article

References (29)

1. Appel, A., Ellis, J. and Li, K. (1988) Real-time concurrent collection on stock multiprocessors. ACM Symposium on Programming Language Design and Implementation, pp. 11-20. ACM Press.
2. Arsac, J. and Kodratoff, Y. (1982) Some techniques for recursion removal from recursive functions. ACM Transactions on Programming Languages and Systems, 4(2), 295-322.
3. Augustsson, L. (1984) A compiler for lazy ML. ACM Symposium on Lisp and Functional Programming, pp. 218-227. ACM Press.
4. Augustsson, L. and Johnsson, T. (1989). Parallel graph reduction with the 〈v,G〉 machine. Symposium on Functional Programming Languages and Computer Architecture, pp. 202-213. ACM Press.
5. Bird, R. and Wadler, P. (1988) Introduction to Functional Programming. Prentice Hall.
6. Darlington, J. and Reeve, M. (1981) Alice: A multi-processor reduction engine for the parallel evaluation of applicative languages. Symposium on Functional Programming Languages and Computer Architecture, pp. 65-75. ACM Press.
7. George, L. (1989) An abstract machine for parallel graph reduction. Symposium on Functional Programming Languages and Computer Architecture, pp. 214-227. ACM Press.
8. Goldberg, B. (1988a) Buckwheat: Graph reduction on shared-memory multiprocessor. ACM Symposium on Lisp and Functional Programming, pp. 40-51. ACM Press.
9. Goldberg, B. (1988b) Multiprocessor execution of functional programs. PhD thesis, Yale University.
10. Hudak, P. (1987) A semantic model for reference counting and its abstraction. In: Abramsky, S. and Hankin, C. (eds.), Abstract Interpretation of Declarative Languages, pp. 45-62. Ellis Horwood.
11. Huelsbergen, L. and Larus, J. (1993). A concurrent copying garbage collector for languages that distinguish immutable data. Principles and Practice of Parallel Programming, pp. 73-82. ACM Press.
12. Huet, G. and Levy, J.-J. (1991) Computation in orthogonal rewriting systems. In: Lassez, J.-L. and Plotkin, G. (eds.), Essays in Computational Logic - Essays in Honor of Alan Robinson. MIT Press.
13. Hughes, R. J. M. (1982) Reference-counting with circular structures in virtual memory applicative systems. Technical Report, Programming Research Group, Oxford.
14. Hwang, S. and Rushall, D. (1992) The v-STG machine: A parallelized spineless tagless graph reduction machine in a distributed memory architecture. Fourth Workshop on Parallel Implementations of Functional Languages.
15. Kaser, O., Pawagi, S., Ramakrishnan, C. R., Ramakrishnan, I. V. and Sekar, R. C. (1992) Fast parallel implementation of lazy languages - the EQUALS experience. ACM Symposium on Lisp and Functional Programming, pp. 335-344. ACM Press.
16. Kaser, O., Ramakrishnan, C. R. and Sekar, R. C. (1994) A high performance runtime system for parallel evaluation of lazy languages. First International Symposium on Parallel Symbolic Computation, pp. 234-243. World Scientific.
17. Laville, A. (1988) Implementation of lazy pattern matching algorithms. European Symposium on Programming: Lecture Notes in Computer Science 300, pp. 298-316. Springer-Verlag.
18. Maranget, L. (1991) GAML: A parallel implementation of lazy ML. Symposium on Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 523, pp. 102-123. Springer-Verlag.
19. Mohr, E., Kranz, D. and Halstead, R. (1991) Lazy task creation: A technique for increasing the granularity of parallel programs. IEEE Transactions on Parallel and Distributed Systems, 2(3), 264-280.
20. Park, Y. and Goldberg, B. (1995) Static analysis for optimizing reference counting. Information Processing Letters, 55(4), 229-234.
21. Peyton Jones, S. L. (1992) Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2(2), 127-202.
22. Peyton Jones, S. L. and Launchbury, J. (1991) Unboxed values as first class citizens in a non-strict functional language. Symposium on Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 523, pp. 636-666. Springer-Verlag.
23. Peyton Jones, S. L., Clack, C., Salkild, J. and Hardie, M. (1987) GRIP - a high-performance architecture for parallel graph reduction. Symposium on Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 274, pp. 98-112. Springer-Verlag.
24. Puel, L., & Suarez, A. (1990). Compiling pattern matching by term decomposition. ACM Symposium on Lisp and Functional Programming, pp. 273-281. ACM Press.
25. Röjemo, N. (1991) A concurrent garbage collector for the 〈v,G〉-machine. Technical Report, Chalmers University.
26. Sekar, R. C., Pawagi, S. and Ramakrishnan, I. V. (1990) Small domains spell fast strictness analysis. ACM Symposium on Principles of Programming Languages, pp. 169-183. ACM Press.
27. Sekar, R. C., Ramesh, R. and Ramakrishnan, I. V. (1992) Adaptive pattern-matching. International Colloquium on Automata, Languages and Programming: Lecture Notes in Computer Science 623, pp. 247-260. Springer-Verlag.
28. Sequent Computer Systems (1987) Sequent guide to parallel programming.
29. Watson, P. and Watson, I. (1987) Evaluating functional programs on the FLAGSHIP machine. Symposium on Functional Programming Languages and Computer Architecture: Lecture Notes in Computer Science 274, pp. 80-97. Springer-Verlag.