Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Graph reduction in a parallel virtual memory environment

  • Resource Control Issues
  • Conference paper
  • First Online:
Graph Reduction (GR 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 279))

Included in the following conference series:

Abstract

This paper discusses the problems of implementing a parallel machine architecture to support graph reduction. In particular it examines the area of memory organization and the mechanisms which are required to ensure that the full benefits of this implementation strategy are maintained whilst achieving an efficient physical structure. The major areas of interest are the maintenance of locality and the use of storage management techniques which minimize communication.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Referneces

  1. J. Darlington & M. Reeve, "ALICE-A Multi-Processor Reduction Machine for The Parallel Evaluation of Applicative Languages", Proc of 1981 ACM Conf on Functional Programming Languages & Computer Architecture.

    Google Scholar 

  2. J.R. Gurd, C.C. Kirkham, I. Watson, "The Manchester Prototype Dataflow Computer", Communications of the ACM, vol.28. no.1., Jan.85, pp.34–52.

    Google Scholar 

  3. A.J. Field, PhD. Thesis, Imperial College, University of London, 1985.

    Google Scholar 

  4. S.L. Peyton-Jones, "GRIP-a parallel graph reduction machine", University College London, Dept. of Computer Science, Internal Note 1665, 1985.

    Google Scholar 

  5. J.R.W. Glauert, N.P. Holt, J.R. Kennaway, M.R. Sleep, "An Active Term Rewrite Model for Parallel Computation", Internal Report, ept. Computing, University of East Anglia, Norwich, England, 1985.

    Google Scholar 

  6. D.R. Brownbridge, "Cyclic Reference Counting for Combinator Machines", Proc. ACM Functional Programming Languages and Computer Architecture, Nancy, France, 1985.

    Google Scholar 

  7. J. Hughes, "A Distributed Garbage Collection Algorithm", Proc. ACM Functional Programming Languages and Computer Architecture, Nancy, France, 1985.

    Google Scholar 

  8. P. Hudak & R.M. Keller, "Garbage Collection and Task Deletion in Distributed Applicative Processing Systems", Proc. Conf. on LISP and Functional Programming, ACM, 1984.

    Google Scholar 

  9. P. Watson, "Parallel Reduction of Lambda Calculus Expressions", PhD. Thesis, Dept. Computer Science, University of Manchester, England, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joseph H. Fasel Robert M. Keller

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Watson, I., Watson, P. (1987). Graph reduction in a parallel virtual memory environment. In: Fasel, J.H., Keller, R.M. (eds) Graph Reduction. GR 1986. Lecture Notes in Computer Science, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18420-1_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-18420-1_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18420-1

  • Online ISBN: 978-3-540-47963-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics