Advertisement

Design for a multiprocessing heap with on-board reference counting

  • David S. Wise
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 201)

Keywords

Collection Mode Garbage Collection Address Space Memory Bank Circular Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H.G. Baker, Jr. List processing in real time on a serial computer. Comm. ACM 21, 4 (April, 1978), 280–294.Google Scholar
  2. 2.
    D.G. Bobrow. Managing reentrant structures using reference counts. ACM Trans. Prog. Lang. & Systems 2, 3 (July, 1980), 269–273.Google Scholar
  3. 3.
    D.W. Clark and C.C. Green. A note on shared structure in Lisp. Inform. Proc. Lirs. 7, 6 (October, 1978), 312–314.Google Scholar
  4. 4.
    G.E. Collins. A method for overlapping and erasure of lists. Comm. ACM 3, 12 (December, 1960), 655–657.Google Scholar
  5. 5.
    L.P. Deutsch and D.G. Bobrow. An efficient, incremental, real-time garbage collector. Comm. ACM 19, 9 (September, 1976), 522–526.Google Scholar
  6. 6.
    L.P. Deutsch and A.M. Schiffman. Efficient implementation of the Smalltalk-80 system. Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 297–302.Google Scholar
  7. 7.
    D.P. Friedman and D.S. Wise. Aspects of applicative programming for parallel processing. IEEE Trans. Computers C-27, 4 (April, 1978), 289–296.Google Scholar
  8. 8.
    D.P. Friedman and D.S. Wise. Sting-unless: a conditional, interlock-free store instruction. In M. B. Pursley and J. B. Crus, Jr. (eds.), Proc. 16th Annual Allerton Conf. on Communication, Control, and Computing, University of Illinois (Urbana-Champaign, 1978), 578–584.Google Scholar
  9. 9.
    D.P. Friedman and D.S. Wise. Reference counting can manage the circular environments of mutual recursion. Inform. Proc. Ltrs. 8, 1 (January, 1979), 41–44.Google Scholar
  10. 10.
    D.P. Friedman and D.S. Wise. An approach to fair applicative multiprogramming. In G. Kahn (ed.), Semantics of Concurrent Computation, Berlin, Springer (1979), 203–250.Google Scholar
  11. 11.
    D. Gries. An exercise in proving programs correct. Comm. ACM 20, 12 (December, 1977) 921–930.Google Scholar
  12. 12.
    A. Gottlieb, R. Girshman, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer—Designing an MIMD shared memory parallel computer. IEEE Trans. Computers C-32, 2 (February, 1983), 175–189.Google Scholar
  13. 13.
    P. Hudak and R.M. Keller. Garbage collection and task deletion in distributed applicative processing systems. Conf. Rec. 1982 ACM Symp. on LISP and Functional Programming (1982), 168–178.Google Scholar
  14. 14.
    R.J.M. Hughes. Reference counting with circular structures in virtual memory applicative systems. Programming Research Group, Oxford (1984).Google Scholar
  15. 15.
    D.H.H. Ingalls. The Smalltalk-76 programming system: design and implementation. Conf. Rec. 5th ACM Symp. on Principles of Programming Languages (1978), 9–15.Google Scholar
  16. 16.
    S.D.Johnson. Connection networks for output-driven list multiprocessing. Tech. Rept. 114, Computer Science Dept., Indiana University (October, 1981).Google Scholar
  17. 17.
    S.D. Johnson. Storage allocation for list multiprocessing. Tech. Rept. 168, Computer Science Dept., Indiana University (March, 1985).Google Scholar
  18. 18.
    A.T. Kohlstaedt. Daisy 1.0 reference manual. Tech. Rept. 119, Computer Science Dept., Indiana University (November, 1981).Google Scholar
  19. 19.
    H. Lieberman and C. Hewitt. A real-time garbage collector based on the lifetime of objects. Comm. ACM 26, 6 (June, 1983), 419–429.Google Scholar
  20. 20.
    D. Moon. Garbage collection in a large LISP system. Conf. Rec. 1984 ACM Symp. on LISP and Functional Programming (1982), 235–246.Google Scholar
  21. 21.
    H. Schorr and W.M. Waite. An efficient machine-independent procedure for garbage collection in various list structures. Comm. ACM 10, 8 (August, 1967), 501–506.Google Scholar
  22. 22.
    G.L. Steele, Jr. and G.J. Sussman. The revised report on SCHEME: a dialect of LISP. MIT A.I. Memo 452 (January, 1978).Google Scholar
  23. 23.
    W.R. Stoye, T.J.W. Clarke, and A.C. Norman. Some practical methods for rapid combinator reduction. Conf. Rec. 1984 ACM Symp. on LISP and Functional Programming (1982), 159–166.Google Scholar
  24. 24.
    N. Suzuki and M. Terada. Creating efficient systems for object-oriented languages. Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 290–296.Google Scholar
  25. 25.
    J. Von Neumann. Theory of Self-Reproducing Automata (Edited and compiled by A. W. Burks), Urbana, Univ. of Illinois Press (1966).Google Scholar
  26. 26.
    J. Weizenbaum. Symmetric list processor. Comm. ACM 6, 9 (December, 1963), 524–544.Google Scholar
  27. 27.
    D.S. Wise. Morris's garbage compaction algorithm restores reference counts. ACM Trans. Prog. Lang. & Systems 1, 1 (July, 1979), 115–120.Google Scholar
  28. 28.
    D.S. Wise. The applicative style of programming. Abacus 2, 2 (Winter, 1985), 20–32.Google Scholar
  29. 29.
    D.S. Wise and D.P. Friedman. The one-bit reference count. Nordisk. Tidskr. Informationsbehandling (BIT) 17, 3 (September, 1977), 351–359.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • David S. Wise
    • 1
  1. 1.Computer Science DepartmentIndiana UniversityBloomingtonUSA

Personalised recommendations