skip to main content
10.1145/99370.99387acmconferencesArticle/Chapter ViewAbstractPublication PagesfpcaConference Proceedingsconference-collections
Article
Free Access

An abstract machine for parallel graph reduction

Authors Info & Claims
Published:01 November 1989Publication History
First page image

References

  1. 1.Arvind, Nikhil, R. S., and Pingali, K. K. lstructures: data structures for parallel computing. In Graph Reduction: Proceedings of a Workshop, J. H. Fasel and R. M. Keller, Eds., Springer-Verlag, 1987, pp. 336-369. Lecture Notes in Computer Science No. 279. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.B~ge, G., and Lindstrom, G. Committed choice functional programming. In Proc. International Conference on Fifth Generation Computer Systems (Tokyo, November 1988), Institute for New Generation Computer Technology (ICOT), pp. 666-674.Google ScholarGoogle Scholar
  3. 3.Burn, G., Peyton Jones, S. L., and Robson, J. D. The spineless g-machine. In Proc. of the 1988 A CM Conf. on Lisp and Functional Programming (July 1988), ACM, pp. 244-258. Conf. at Snowbird, Utah. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Burn, G. L. Evaluation Transformers- A Model for the Parallel Evaluation of Functional LaNguages. LNC$ P74, Springer-Verlag, 1987, pp. 446-470. Portland Oregon Proc., Ed. Gilles Kahn. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Clarke, T., Gladstone, P., and MacLean, N. A. SKIM - the s, k, i reduction machine. In The 1980 LISP Conference (August 1980), pp. 128-135. Stanford University. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Darlington, J., and Reve, M. ALICE: a multiprocessor reduction machine for the parallel evaluation of applicative languages. In Functional Programming Languages and Computer Architecture (October 1981), ACM, pp. 65-76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.George, L. Efficient Normal Order Evaluation Through Slriciness information. Master's thesis, University of Utah, March 1987.Google ScholarGoogle Scholar
  8. 8.Goldberg, B. E. Buckwheat: graph reduction on a shared memory multiprocessor. In Proc. of the 1988 A CM Conference on Lisp and Functional Programming (July 1988), ACM, pp. 40-51. Snowbird, Utah. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Goldberg, B.E. Multiprocessor Ezecution of Functional Programs. PhD thesis, Yale University, Dept. of Computer Science, April 1988. YALEU /I)CS/RR-61S. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Hankin, C. L., Osmon, P. E., and Shute, M. J. COBWEB: A Combinaior Reduction Architecture. LNC$ 201, Springer-Verlag, 1985, pp. 99-112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Harper, R. Introduction to Standard ML. LFCS Report Series ECS-LFCS-86-14, Computer Science Department, Edinburgh University, November 1986.Google ScholarGoogle Scholar
  12. 12.Itudak, P., and Goldberg, B. E. Serial Combinatots "Optimal" Grains of Parallelism. LNCS 201, Springer-Verlag, 1985, pp. 382-388.Google ScholarGoogle Scholar
  13. 13.Johnsson, T. Efficient compilation of lazy evaluation. In Proc. Syrup. on Compiler Construction (Montreal, 1984), ACM SIGPLAN. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.Johnsson, T. The < v, g >-machine: an abstract machine for parallel graph reduction. In Proc. WG 10.1 Workshop on Concepts and Characteristics of Declarative Systems (Budapest, October 1988), G. David, Ed., IFIP. Also appears in this proceedings.Google ScholarGoogle Scholar
  15. 15.Lindstrom, G. Static analysis of functional programs with logical variables. In Proc. Internatioual Workshop on Programming Language implementation and Logic Programming (PL~rLP '88), Springer Lecture Notes in Computer Science Number 348, Orleans, France, 1989, pp. 1-19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.Lindstrom, G., George, L., and Yeh, D. Generating efficient code from strictness annotations. In Proc.$econd Int. Join! Conf. on Theory and Prec. rice of Software Development (TAPSOFT) (March 1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.Peyton Jones, S. L. The implementation of Fuuctional Proyramminy Lauyuayes. Iuternational Se. ties In Compater Science, Prentice-Hall, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.Peyton Jones, S. L. Parallel implementations of functional programming languages. The Computer Journal g~, 2 (1989), 175-186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.Peyton Jones, S. L., Clack, C., Salkild, J., and Hardie, M. GRIP. a high performance architecture for parallel graph raductiou. LNCS ~74, Springer- Verlag, 1987, pp. 98-112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.Scheevel, M. NORMA: a graph reduction processor. In Proc. of the 1986 A CM Conference on Lisp and Functional Programming (August 1986), ACM, pp. 212-219. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.Stoye, W. It., Clarke, J. W., and Norman, A. C. Some practical methods for rapid combinator reduction. In Proc. of the A CM Conference on LISP aud Functioual Profmmming (August 1984), ACM, pp. 159-166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.Thomas, B., Gurwitz, B., Goodhue, J., and Allen, D. Butterfly parallel processor: overview. Tech. Rep. 6148, BBN Laboratories Incorporated, March 1986.Google ScholarGoogle Scholar
  23. 23.Turner, D. A. A new implementation technique for applicative languages. Software Practice and Ezperience 9 (1979), 31-49.Google ScholarGoogle ScholarCross RefCross Ref
  24. 24.Veh, D. Static Evaluation of a Functional Language Through Strictness Analysis. Master's thesis, University of Utah, December 1987.Google ScholarGoogle Scholar

Index Terms

  1. An abstract machine for parallel graph reduction

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture
                November 1989
                395 pages
                ISBN:0897913280
                DOI:10.1145/99370

                Copyright © 1989 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 November 1989

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader