Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Dawson (1982)
Improved effectiveness from a real time LISP garbage collector
H. Gelernter, J. Hansen, C. Gerberich (1959)
A FORTRAN-compiled list-processing language
Douglas Johnson (1991)
The case for a read barrier
M. Fuchs (1995)
Garbage Collection on an Open Network
T. Chikayama, Yasunori Kimura (1987)
Multiple Reference Management in Flat GHC
S. Jones (1987)
The Implementation of Functional Programming Languages
C. Queinnec, Barbara Beaudoing, J. Queille (1989)
Mark DURING Sweep rather than Mark THEN Sweep
D. Bevan (1987)
Distributed Garbage Collection Using Reference Counting
R. Ladin, B. Liskov (1992)
Garbage collection of a distributed heap[1992] Proceedings of the 12th International Conference on Distributed Computing Systems
J. Bennett (1987)
The design and implementation of distributed Smalltalk
Robert Courts (1988)
Improving locality of reference in a garbage-collecting memory management systemCommun. ACM, 31
J. Feldman, James Low, P. Rovner (1978)
Programming Distributed SystemsProceedings of the 1978 annual conference
P. Dickman (1991)
Distributed object management in a non-small graph of autonomous networks with few failures
T. Hickey, Jacques Cohen
Programming Techniques and Data Structures Performance Analysis of On.the.fly Garbage Collection
ABDULLAHI S. E.
25
B. Wegbreit (1972)
A generalised compactifying garbage collectorComput. J., 15
P. Wilson, Thomas Moher (1989)
Design of the opportunistic garbage collector
I. Williams (1988)
The design and evaluation of a high-performance smalltalk systemScience of Computer Programming, 11
J. McCarthy (1978)
History of LISP
E. Miranda (1987)
BrouHaHa- A portable Smalltalk interpreter
H. Lieberman, C. Hewitt (1983)
A real-time garbage collector based on the lifetimes of objectsCommun. ACM, 26
D. Moon (1984)
Garbage collection in a large LISP system
A. Black, N. Hutchinson, E. Jul, H. Levy, L. Carter (1987)
Distrbution and Abstract Types in EmeraldIEEE Transactions on Software Engineering, SE-13
R. Lins (1993)
Generational Cyclic Reference CountingInf. Process. Lett., 46
M. Ben-Ari (1984)
Algorithms for on-the-fly garbage collectionACM Trans. Program. Lang. Syst., 6
H. Schorr, W. Waite (1967)
An efficient machine-independent procedure for garbage collection in various list structuresCommun. ACM, 10
A. Appel, J. Ellis, Kai Li (1988)
Real-time concurrent collection on stock multiprocessors
A. Demers, M. Weiser, Barry Hayes, H. Boehm, D. Bobrow, S. Shenker (1989)
Combining generational and conservative garbage collection: framework and implementations
B. Goldberg (1989)
Generational reference counting: a reduced-communication distributed storage reclamation scheme
P. Ferreira, M. Shapiro (1994)
Garbage collection and DSM consistency
Y. Bekkers, O. Ridoux, Lucien Ungaro (1992)
Dynamic Memory Management for Sequential Logic Programming Languages
共立出版株式会社 (1978)
コンピュータ・サイエンス : ACM computing surveys
D. Zave (1975)
A Fast Compacting Garbage CollectorInf. Process. Lett., 3
P. Wilson, M. Lam, Thomas Moher (1991)
Effective “static-graph” reorganization to improve locality in garbage-collected systems, 26
B. Zorn (1993)
The measured cost of conservative garbage collectionSoftware: Practice and Experience, 23
H. Bal (1990)
Programming distributed systems
(1994)
Recycling garbage
I. Newman, M. Woodward (1982)
Alternative approaches to multiprocessor garbage collection
Inmos Corp (1984)
Occam Programming Manual
B. Lang, C. Queinnec, José Piquer (1992)
Garbage collecting the world
B. Zorn, D. Grunwald (1994)
Evaluating models of memory allocationACM Trans. Model. Comput. Simul., 4
Richard Jones, R. Lins (1993)
Cyclic Weighted Reference Counting without Delay
D. Clark, C. Green (1977)
An empirical study of list structure in LispCommun. ACM, 20
B. Zorn, P. Hilfmger (1988)
A memory allocation profiler for c and lisp
P. Denning (1968)
Thrashing: its causes and preventionProceedings of the December 9-11, 1968, fall joint computer conference, part I
D. Ungar (1987)
The design and evaluation of a high performance Smalltalk system
W. Tuck, B. Board (1990)
OSI and library services
S. Graham, R. Rivest (1978)
List Processing in Real Time on a Serial Computer
D. Kafura, Douglas Washabaugh, J. Nelson (1990)
Garbage collection of actors
(1993)
A comparative study of dynamic memory management techniques. Advances in Model
C. Chambers, D. Ungar, Elgin Lee (1989)
An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypesLISP and Symbolic Computation, 4
P. Watson, I. Watson (1987)
An Efficient Garbage Collection Scheme for Parallel Computer Architectures
Adele Goldberg, D. Robson (1983)
Smalltalk-80: The Language and Its Implementation
M. Atkinson, P. Bailey, Kenneth Chisholm, W. Cockshott, R. Morrison (1989)
An Approach to Persistent ProgrammingComput. J., 26
H. Gelernter, J. Hansen, C. Gerberich (1960)
A Fortran-Compiled List-Processing LanguageJ. ACM, 7
D. Bobrow (1980)
Managing Reentrant Structures Using Reference CountsACM Transactions on Programming Languages and Systems (TOPLAS), 2
M. Rudalics (1986)
Distributed copying garbage collection
José Piquer (1991)
Indirect Reference Counting: A Distributed Garbage Collection Algorithm
T. Ozawa, Akira Hosoi, A. Hattori (1990)
Generation Type Garbage Collection for Parallel Logic Languages
E. Dijkstra, L. Lamport, Alain Martin, C. Scholten, Elisabeth Steffens (1975)
On-the-fly garbage collection: an exercise in cooperation
R. Lins (1992)
Cyclic Reference Counting with Lazy Mark-ScanInf. Process. Lett., 44
P. Hudak, R. Keller (1982)
Garbage collection and task deletion in distributed applicative processing systems
B. Zorn, D. Grunwald (1992)
Empirical measurements of six allocation-intensive C programsACM SIGPLAN Notices, 27
L. Amsaleg, M. Franklin, O. Gruber (1995)
Efficient Incremental Garbage Collection for Client-Server Object Database Systems
W. Hansen (1969)
Compact list representation: definition, garbage collection, and system implementationCommun. ACM, 12
G. Andrews (1991)
Concurrent Programming: Principles and Practice
B. Zorn (1992)
The Measured Cost of Conservative Garbage Collection ; CU-CS-573-92
Jan Graba (1998)
Dynamic Memory Management
M. Shapiro, O. Gruber, D. Plainfossé (1990)
A garbage detection protocol for a realistic distributed object-support system
Alejandro Martínez, R. Wachenchauzer, R. Lins (1990)
Cycle Reference Counting with Local Mark-ScanInf. Process. Lett., 34
Jacques Cohen (1981)
Garbage Collection of Linked Data StructuresACM Comput. Surv., 13
John Foderaro, R. Fateman (1981)
Characterization of VAX Macsyma
D. Knuth (1997)
The art of computer programming: V.1.: Fundamental algorithms
Thomas Standish (1980)
Data Structure Techniques
D. Davies (1984)
Memory occupancy patterns in garbage collection systemsCommun. ACM, 27
H. Baecker (1972)
Garbage collection for virtual memory computer systemsCommun. ACM, 15
D. Knuth (1968)
The Art of Computer Programming
(1983)
Implementing the Smalltalk-80 system: The Tektronix experience
P. Hudak (1986)
A semantic model of reference counting and its abstraction (detailed summary)
M. Schelvis (1989)
Incremental distribution of timestamp packets: a new approach to distributed garbage collection
E. Dijkstra, C. Scholten (1980)
Termination Detection for Diffusing ComputationsInf. Process. Lett., 11
H. Boehm, M. Weiser (1988)
Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 18
S. Arnborg (1974)
Optimal memory management in a system with garbage collectionBIT Numerical Mathematics, 14
Barry Hayes (1991)
Using key object opportunism to collect old objects
Johannes Martin (1982)
An efficient garbage compaction algorithmCommun. ACM, 25
G. Collins (1960)
A method for overlapping and erasure of listsCommun. ACM, 3
L. Peterson, Bruce Davie (1996)
Computer Networks: A Systems Approach
Jacques Cohen, A. Nicolau (1983)
Comparison of Compacting Algorithms for Garbage CollectionACM Trans. Program. Lang. Syst., 5
S. Vestal (1987)
Garbage collection: an exercise in distributed, fault-tolerant programming
G. Agha (1985)
ACTORS - a model of concurrent computation in distributed systems
P. Wadler (1976)
Analysis of an algorithm for real time garbage collectionCommun. ACM, 19
(1990)
Hardware support for garbage collection of linked objects and arrays in real time
D. Dolev, C. Dwork, L. Stockmeyer (1983)
On the minimal synchronism needed for distributed consensus24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
M. Schelvis, Eddy Bledoeg (1988)
The Implementation of a Distributed Smalltalk
Daniel Friedman, David Wise (1976)
Garbage Collecting a Heap Which Includes a Scatter TableInf. Process. Lett., 5
Motoaki Terashima, E. Goto (1978)
Genetic Order and Compactifying Garbage CollectorsInf. Process. Lett., 7
R. Kain (1969)
Block structures, indirect addressing, and garbage collectionCommun. ACM, 12
J. Bartlett (1990)
A Generational, Compacting Garbage Collector for C
Ravi Sharma, M. Soffa (1991)
Parallel generational garbage collection
(1991)
Objectworks/Smalltalk Release 4 User's Guide
D. Plainfossé, M. Shapiro (1995)
A Survey of Distributed Garbage Collection Techniques
G. Tel, F. Mattern (1991)
The derivation of distributed termination detection algorithms from garbage collection schemesACM Trans. Program. Lang. Syst., 15
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
R. Fowler (1986)
The complexity of using forwarding addresses for decentralized object finding
G. Lindstrom (1974)
Copying list structures using bounded workspaceCommunications of the ACM, 17
D. Plainfossé, M. Shapiro (1992)
Experience with a Fault-Tolerant Garbage Collector in a Distributed List System
G. Coulouris, J. Dollimore (1988)
Distributed systems - concepts and design
Chris Cheney (1970)
A nonrecursive list compacting algorithmCommun. ACM, 13
José Piquer (1995)
Indirect Mark and Sweep: A Distributed GC
R. Fenichel, Jerome Yochelson (1969)
A LISP garbage-collector for virtual-memory computer systemsCommun. ACM, 12
R. Brooks, R. Gabriel, G. Steele (1982)
S-1 Common Lisp implementation
B. Liskov, R. Ladin (1986)
Highly available distributed services and fault-tolerant distributed garbage collection
E. Tick (1987)
Memory performance of Prolog architectures, 40
D. Ungar (1984)
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
L. Graham, Ronald Rivest, F. Morris (1978)
A time- and space-efficient garbage compaction algorithmCommun. ACM, 21
G. Krasner (1983)
Smalltalk-80: bits of history, words of advice
Daniel Friedman, David Wise (1979)
Reference Counting Can Manage the Circular Environments of Mutual RecursionInf. Process. Lett., 8
D. Clark, C. Green (1978)
A Note on Shared List Structure in LISPInf. Process. Lett., 7
Carl Dellar (1980)
Removing backing store administration from the CAP operating systemACM SIGOPS Oper. Syst. Rev., 14
E. Jul, H. Levy, N. Hutchinson, A. Black (1988)
Fine-grained mobility in the Emerald systemACM Trans. Comput. Syst., 6
L. Deutsch, D. Bobrow (1976)
An efficient, incremental, automatic garbage collectorCommun. ACM, 19
(1964)
GENERAL DISCUSSIONSAnnals of the New York Academy of Sciences, 116
John Hughes (1985)
A Distributed Garbage Collection Algorithm
J. Weizenbaum (1963)
Symmetric list processorCommun. ACM, 6
P. Wilson, M. Lam, Thomas Moher (1992)
Caching considerations for generational garbage collection
A. Birrell, Greg Nelson, S. Owicki, E. Wobber (1994)
Network objectsSoftware: Practice and Experience, 25
David Detlefs (1990)
Concurrent garbage collection for C
(1991)
Atomic incremental garbage collection and recovery for large stable heap, implementing persistent object bases: Principles and practice
D. Ungar, F. Jackson (1992)
An adaptive tenuring policy for generation scavengersACM Trans. Program. Lang. Syst., 14
F. Dehne, R. Lins (1994)
Distributed Cyclic Reference Counting
P. Bishop (1977)
Computer systems with a very large address space and garbage collection
Margaret Derbyshire (1990)
Mark scan garbage collection on a distributed architectureLISP and Symbolic Computation, 3
A. Birrell, D. Evers, Greg Nelson, S. Owicki, Ted Wobber (1993)
Distributed Garbage Collection for Network Objects
(1992)
Managing computer memory: Dynamic allocation and deallocation strategies
Arvind, Bob Iannucci (1987)
Two Fundamental Issues in Multiprocessing
J. White (1987)
Address/memory management for a gigantic LISP environment or, GC considered harmful
M. Shapiro, D. Plainfossé, P. Ferreira, L. Amsaleg (1994)
Some Key Issues in the Design of Distributed Garbage Collection and References
K. Knowlton (1965)
A fast storage allocatorCommun. ACM, 8
L. Amsaleg, M. Franklin, O. Gruber (1994)
Efficient incremental garbage collection for workstation/server database systems
N. Garnett, R. Needham (1980)
An asynchronous garbage collector for the Cambridge File ServerACM SIGOPS Oper. Syst. Rev., 14
C. Hoare (1974)
Optimization of Store Size for Garbage CollectionInf. Process. Lett., 2
H. Baker (1992)
The treadmill: real-time garbage collection without motion sicknessACM SIGPLAN Notices, 27
P. Wilson, Mark Johnstone, M. Neely, D. Boles (1995)
Dynamic Storage Allocation: A Survey and Critical Review
S. Abdullahi, E. Miranda, G. Ringwood (1992)
Collection Schemes for Distributed Garbage
R. Shaw (1988)
Empirical analysis of a LISP system
Joseph Falcone, J. Stinger (1983)
The Smalltalk-80 Implementation at Hewlett-Packard
D. Ungar, F. Jackson (1988)
Tenuring policies for generation-based storage reclamation
A. Newell, F. Tonge (1960)
An introduction to information processing language VCommunications of the ACM, 3
E. Kolodner, B. Liskov, W. Weihl (1989)
Atomic garbage collection: managing a stable heap
J. McCarthy (1959)
Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 3
David Brownbridge (1985)
Cyclic Reference Counting for Combinator Machines
E. AbdullahiSaleh, A. RingwoodGraem (1998)
Garbage collecting the InternetACM Computing Surveys
M. Rosenblum (1991)
The design and implementation of a log-structured file system, 303
N. Juul, E. Jul (1990)
Garbage collection in object oriented systems (workshop session)
Jacques Cohen, Laurent Trilling (1967)
Remarks on »garbage collection« using a two-level storageBIT Numerical Mathematics, 7
K. Nilsen (1988)
Garbage collection of strings and linked data structures in real timeSoftware: Practice and Experience, 18
D. Fisher (1974)
Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing EnvironmentInf. Process. Lett., 3
S. Rana (1983)
A Distributed Solution of the Distributed Termination ProblemInf. Process. Lett., 17
(1983)
The Dorado Smalltalk-80 implementation: Hardware architecture's impact on software architecture
P. Wilson (1992)
Uniprocessor Garbage Collection Techniques
Charles Lamb, Gordon Landis, Jack Orenstein, Daniel Weinreb (1991)
The ObjectStore database systemCommun. ACM, 34
R. Gabriel, L. Masinter (1982)
Performance of Lisp systems
B. Zorn (1989)
Comparative performance evaluation of garbage collection algorithms
M. Shapiro, P. Dickman, D. Plainfossé (1992)
Robust, distributed references and acyclic garbage collection
R. Lins, Richard Jones (1991)
Cyclic Weighted Reference Counting
O. Babaoglu, K. Marzullo (1993)
Consistent global states of distributed systems: fundamental concepts and mechanisms
J. Weizenbaum (1962)
Knotted list structuresCommun. ACM, 5
Joel Crichlow (1988)
An introduction to distributed and parallel computing
P. Wilson (1991)
Some issues and strategies in heap management and memory hierarchiesACM SIGPLAN Notices, 26
H. Glaser, P. Thompson (1987)
Lazy garbage collectionSoftware: Practice and Experience, 17
R. Bates, D. Dyer, Johannes Koomen (1982)
Implementation of Interlisp on the VAX
H. Jonkers (1979)
A Fast Garbage Compaction AlgorithmInf. Process. Lett., 9
(1984)
Reference counting with circular structures in virtual memory, applicative systems
(1960)
An introduction to IPL-V
David Detlefs, Jeannette Wing (1990)
Concurrent atomic garbage collection
M. Fischer, N. Lynch, M. Paterson (1983)
Impossibility of distributed consensus with one faulty process
G. Steele (1975)
Multiprocessing compactifying garbage collectionCommun. ACM, 18
C. Lermen, D. Maurer (1986)
A protocol for distributed reference counting
N. Juul, E. Jul (1992)
Comprehensive and Robust Garbage Collection in a Distributed System
(1983)
An MC68000-based Smalltalk-80 system
L. Augusteijn (1987)
Garbage Collection in a Distributed Environment
John DeTreville (1990)
Experience with Garbage Collection for Modula-2+ in the Topaz Environment
(1983)
Low-overhead storage reclamation in the Smalltalk-80 virtual machine
P. Hudak (1982)
Object and task reclamation in distributed applicative processing systems
K. Appleby, M. Carlsson, Seif Haridi, Dan Sahlin (1988)
Garbarge collection for Prolog based on WAMCommun. ACM, 31
David Wise, Daniel Friedman (1977)
The one-bit reference countBIT Numerical Mathematics, 17
K. Colton (1979)
The impact and use of computer technology by the policeCommun. ACM, 22
Johannes Martin (1990)
Garbage Collection in an Object Oriented, Distributed, Persistent Environment
K. Weng (1980)
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE
P. Steenkiste, J. Hennessy (1988)
Lisp on a reduced-instruction-set processor: characterization and optimizationComputer, 21
C. Delobel, C. Lécluse, P. Richard (1995)
Databases - from relational to object-oriented systems
S. North, John Reppy (1987)
Concurrent garbage collection on stock hardware
D. Barach, D. Taenzer (1982)
A technique for finding storage allocation errors in C-language programsACM SIGPLAN Notices, 17
J. Moss (1990)
Garbage Collecting Persistent Object Stores
Internet programming languages such as Java present new challenges to garbage-collection design. The spectrum of garbage-collection schema for linked structures distributed over a network are reviewed here. Distributed garbage collectors are classified first because they evolved from single-address-space collectors. This taxonomy is used as a framework to explore distribution issues: locality of action, communication overhead and indeterministic communication latency.
ACM Computing Surveys (CSUR) – Association for Computing Machinery
Published: Sep 1, 1998
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.