article

Free access

A bibliography on garbage collection and related topics

Author:

Nandakumar SankaranAuthors Info & Claims

ACM SIGPLAN Notices, Volume 29, Issue 9

Pages 149 - 158

https://doi.org/10.1145/185009.185040

Published: 01 September 1994 Publication History

PDF eReader

References

[1]

{1} Guy L. Steele, Jr. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495-508, September 1975.

Digital Library

Google Scholar

[2]

{2} L. Lamport. Garbage collection with multiple processes: An exercise in co-operation. Technical Report CA-7602-2511, Computer Associates, Wakefield, Mass., February 1976.

Google Scholar

[3]

{3} L. Lamport. Garbage collection with multiple processes: An exercise in parallelism. In Proc. IEEE conf. Parallel Processing, August 1976.

Google Scholar

[4]

{4} K. G. Muller. On the feasibility of concurrent garbage collection. PhD thesis, Tech. Hogeschool Delft, The Netherlands, March 1976.

Google Scholar

[5]

{5} H.T. Kung and S.W. Song. An efficient parallel garbage collection system and its correctness proof. In IEEE Symposium on Foundations of Computer Science , pages 120-131, Providence, Rhode Island, October 1977. Also a Technical Report at CMU, Comp. Sci. Dept.

Digital Library

Google Scholar

[6]

{6} Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):966-975, November 1978. Also E. W. Dijkstra Note EWD496, June 1975.

Digital Library

Google Scholar

[7]

{7} A. K. Nori. A storage reclamation scheme for applicative multiprocessor systems. Master's thesis, University of Utah, December 1979.

Google Scholar

[8]

{8} M. Ben-Ari. On-the-fly garbage collection: New algorithms inspired by program proofs. In ICALP {252}, 1982. pages 14-22.

Digital Library

Google Scholar

[9]

{9} P. Hudak. Object and Task Reclamation in Distributed Applicative Processing Systems. PhD thesis, University of Utah, Salt Lake City, Utah, July 1982.

Digital Library

Google Scholar

[10]

{10} P. Hudak and R.M. Keller. Garbage collection and task deletion in distributed applicative processing systems. In ACM Symposium on LISP and Functional Programming {251}, pages 168-178.

Digital Library

Google Scholar

[11]

{11} I. A. Newman, R. P. Stallard, and M. C. Woodward. Performance of parallel garbage collection algorithms. Computer Studies, 166, September 1982.

Google Scholar

[12]

{12} P. Hudak. Distributed graph marking. Research Report 268, Yale University, January 1983.

Google Scholar

[13]

{13} Ramesh and Mehndiratta. The liveness property of on-the-fly garbage collector-a proof. Information Processing Letters, 1983.

Google Scholar

[14]

{14} ¿Mordechai Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3): 333-344, July 1984.

Digital Library

Google Scholar

[15]

{15} K. A. Mohammed-Ali. Object-Oriented Storage Management and Garbage Collection in Distributed Processing Systems. PhD thesis, Royal Institute of Technology, Dept. of Computer Systems, Stockholm, Sweden, 1984.

Google Scholar

[16]

{16} John Hughes. A distributed garbage collection algorithm. In Jouannaud {255}, pages 256-272.

Digital Library

Google Scholar

[17]

{17} Steven D. Johnson. Storage allocation for list multiprocessing. Technical Report 168, Indiana University, 1985.

Google Scholar

[18]

{18} Paul Rovner. On adding garbage collection and run-time types to a strongly-typed, statically checked, concurrent language. Technical Report CSL-84-7, Xerox Palo Alto Research Center, Palo Alto, California, July 1985.

Google Scholar

[19]

{19} Heonshik Shin and Miroslaw Malek. Parallel garbage collection with associative tag. In Proc. IEEE conf. Parallel Processing, pages 369-375, 1985.

Google Scholar

[20]

{20} S. R. Wiseman. A garbage collector for a large distributed address space. Technical Report 85009, Royal Signals and Radar Establishment, Malvern, United Kingdom, 1985.

Google Scholar

[21]

{21} Khayri A. M. Ali and Seif Haridi. Global garbage collection for distributed storage systems. International Journal of Parallel Programming, 15(5): 339-387, October 1986.

Digital Library

Google Scholar

[22]

{22} C.W. Lermen and D. Maurer. A protocol for distributed reference counting. In Functional Programming Languages and Computer Architecture, pages 343-350, 1986.

Digital Library

Google Scholar

[23]

{23} Martin Rudalics. Distributed copying garbage collection. In ACM Symposium on LISP and Functional Programming {256}, pages 364-372.

Digital Library

Google Scholar

[24]

{24} I. Watson. An analysis of garbage collection for distributed systems. Technical report, University of Manchester Dept. of Computer Science, Manchester, United Kingdom, 1986.

Google Scholar

[25]

{25} Santosh G. Abraham and Janak H. Patel. Parallel garbage collection on a virtual memory system. In E. Chiricozzi and A. D'Amato, editors, International Conference on Parallel Processing and Applications, pages 243-246, L'Aquila, Italy, September 1987. Elsevier North-Holland.

Google Scholar

[26]

{26} Lex Augenstein. Garbage collection in a distributed environment. In de Bakker et al. {258}, pages 75-93.

Digital Library

Google Scholar

[27]

{27} Nader Bagherzadeh. Distributed resource management: garbage collection. PhD thesis, University of Texas, Austin, 1987.

Digital Library

Google Scholar

[28]

{28} David I. Bevan. Distributed garbage collection using reference counting. In de Bakker et al. {258}, pages 176-187.

Digital Library

Google Scholar

[29]

{29} J.D. Eckart and R.J. LeBlanc. Distributed garbage collection. In SIGPLAN 1987 Symposium on Interpreters and Interpretive Techniques {260}, pages 264- 273.

Digital Library

Google Scholar

[30]

{30} Stanley M. Gray. Garbage collection in a parallel processing environment. Master's thesis, East Texas State University, 1987.

Google Scholar

[31]

{31} Shogo Matsui, Yoshinobu Kato, Shinsuke Teramura, Tomoyuki Tanaka, Noboyuki Mohri, Atsushi Maeda, and Masakazu Nakanishi. SYNAPSE: A multimicroprocessor lisp machine with parallel garbage collector. Parallel Algorithms and Architectures International Workshop, May 1987.

Digital Library

Google Scholar

[32]

{32} I. A. Newman, R. P. Stallard, and M. C. Woodward. A hybrid multiple processor garbage collection algorithm. Computer Journal, 30(2), April 1987.

Digital Library

Google Scholar

[33]

{33} S. C. North and J. H. Reppy. Concurrent garbage collection on stock hardware. In Kahn {259}, pages 113-133.

Digital Library

Google Scholar

[34]

{34} R. Rashid, A. Tevanian, M. Young, et al. Machine-independent virtual memory management for paged uniprocessor and multiprocessor architectures. In Second International Conference on Architectural Support for Programming Languages and Operating Systems {257}, pages 31-39.

Crossref

Google Scholar

[35]

{35} Gerard Tel, Richard B. Tan, and Jan van Leeuwen. The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols. In the Fourth Annual Symposium on Theoretical Aspects of Computer Science, January 1987. Springer-Verlag. pages 445-455. F. J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors.

Digital Library

Google Scholar

[36]

{36} ¿S. C. Vestal. Garbage Collection: An Exercise in Distributed, Fault- Tolerant Programming. PhD thesis, University of Washington, Seattle, Washington, January 1987.

Digital Library

Google Scholar

[37]

{37} P. Watson and I. Watson. An efficient garbage collection scheme for parallel computer architecture. In de Bakker et al. {258}, pages 432-443.

Digital Library

Google Scholar

[38]

{38} ¿Andrew W. Appel, John R. Ellis, and Kai Li. Real-time concurrent garbage collection on stock multiprocessors. In Proceedings of the Nineteenth Annual SIGPLAN Symposium on Programming Language Design and Implementation {262}, pages 11-20. Refinement of Baker's algorithm.

Digital Library

Google Scholar

[39]

{39} M. Rudalics. Multiprocessor List Memory Management . PhD thesis, Johannes Kepler University, Austria, December 1988.

Google Scholar

[40]

{40} Simon Robert Wiseman. Garbage collection in distributed systems. PhD thesis, University of Newcastle upon Tyne, 1988.

Google Scholar

[41]

{41} David I. Bevan. An efficient reference counting solution to the distributed garbage collection problem. Parallel Computing, 9(2): 179-192, 1989.

Crossref

Google Scholar

[42]

{42} J. Crammond. A garbage collection algorithm for shared memory parallel processors. International Journal of Parallel Programming, 17(6): 497-522, December 1989.

Digital Library

Google Scholar

[43]

{43} Ian Foster. A multicomputer garbage collector for a single assignment language. International Journal of Parallel Programming, 18(3): 181-203, June 1989.

Digital Library

Google Scholar

[44]

{44} Benjamin Goldberg. Generational reference counting: A reduced-communication distributed storage reclamation scheme. In Proceedings of the Twentieth Annual SIGPLAN Conference on Programming Language Design and Implementation {266}, pages 313- 320. Published as SIGPLAN Notices 24 (7), July 1989.

Digital Library

Google Scholar

[45]

{45} David Lester. An efficient distributed garbage collection algorithm. In Odijik et al. {265}.

Google Scholar

[46]

{46} Barbara Liskov and Rivka Ladin. Highly-available distributed services and fault-tolerant distributed garbage collection. In Fifth ACM Symposium on the Principles of Distributed Computing, pages 29-39, 1989.

Digital Library

Google Scholar

[47]

{47} J. Eliot B. Moss. Addressing large distributed collections of persistent objects: The Mneme project's approach. In Second International Workshop on Database Programming Languages, pages 269-285, Glenedon Beach, Oregon, June 1989. Also available as Technical Report 89-68, University of Massachusetts Dept. of Computer and Information Science, Amherst, Massachusetts, 1989.

Digital Library

Google Scholar

[48]

{48} Toshihiro Ozawa, Akira Hosoi, and Akira Hattori. Generation type garbage collection for parallel logic languages. Technical Report TR-512, Institute for New Generation Computer Technology (ICOT), October 1989.

Google Scholar

[49]

{49} M. Schelvis. Incremental distribution of timestamp packets: a new approach to distributed garbage collection. In Conference on Object Oriented Programming Systems, Languages and Applications {264}, pages 37- 48.

Digital Library

Google Scholar

[50]

{50} H. Corporaal, T. Veldman, and A. J. Goor, van de. An efficient, reference weight based garbage collection method for distributed systems. In Proceedings of the PARBASE-90 Conference, pages 463-465. IEEE, 1990.

Google Scholar

[51]

{51} Margaret H. Derbyshire. Mark scan garbage collection on a distributed Architecture. Lisp and Symbolic Computation, 3(2): 135-170, April 1990.

Digital Library

Google Scholar

[52]

{52} ¿David L. Detlefs. Concurrent, atomic garbage collection. In OOPSLA {269}.

Google Scholar

[53]

{53} David L. Detlefs. Concurrent garbage collection for C++. Technical Report CMU-CS-90-119, Carnegie-Mellon University, May 1990.

Google Scholar

[54]

{54} John DeTreville. Experience with concurrent garbage collectors for Modula-2+. Technical Report 64, Digital Equipment Corporation Systems Research Center, Palo Alto, California, August 1990.

Google Scholar

[55]

{55} ¿A. El-Habbash, C. Horn, and M. Harris. Garbage Collection in an Object Oriented, Distributed, Persistent Environment. In OOPSLA {269}.

Google Scholar

[56]

{56} ¿Maurice Herlihy and J. Eliot B. Moss. Nonblocking garbage collection for multiprocessors. Technical Report 90/9, Cambridge Research Labs, DEC, 1990. Available by anonymous ftp from crl.dec.com in the /pub/DEC/CRL/tech-reports directory.

Google Scholar

[57]

{57} Niels Christian Juul. A distributed faulting garbage collector for emerald. In OOPSLA {269}.

Google Scholar

[58]

{58} ¿Kai Li. Real-time concurrent collection in user mode. In OOPSLA {269}.

Google Scholar

[59]

{59} M. Shapiro, O. Gruber, and D. Plainfosse. Garbage detection protocol for a realistic distributed object support system. Technical Report Rapport de Recherche RR-1320, Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau Rocquencourt, B. P. 105, 78153 Le Chesnay Cedex, France, 1990.

Google Scholar

[60]

{60} ¿Marc Shapiro, David Plainfossé, and Olivier Gruber. A garbage detection protocol for a realistic distributed object-support system. In OOPSLA {269}.

Google Scholar

[61]

{61} Francis Vaughan, T. Schunke, B. Koch, A. Dearle, C. Marlin, and C. Barter. A persistent distributed architecture supported by the mach operating system. In Workshop Proceedings: Mach, pages 123-140, Burlington, Vermont, October 1990. USENIX Association.

Google Scholar

[62]

{62} ¿Ichisuki Yuuji and Akinori Yonezawa. Distributed garbage collection using group reference counting. In OOPSLA {269}.

Google Scholar

[63]

{63} N. Bagherzadeh, S. Heng, and C. Wu. A parallel asynchronous garbage collection algorithm for distributed systems. IEEE Transactions on Knowledge and Data Engineering, 3(1): 100-107, March 1991.

Digital Library

Google Scholar

[64]

{64} ¿Hans-J. Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In PLDI {274}, pages 157-164. Published as SIGPLAN Notices 26(6), June 1992.

Digital Library

Google Scholar

[65]

{65} ¿S. C. Crawley. Local and global distributed garbage collection. In OOPSLA {272}.

Google Scholar

[66]

{66} David L. Detlefs. Concurrent, Atomic Garbage Collection . PhD thesis, Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, November 1991. Technical report CMU-CS-90-177.

Google Scholar

[67]

{67} Peter Dickman. Distributed Object Management in a Non-Small Graph of Autonomous Networks With Few Failures. PhD thesis, University of Cambridge, United Kingdom, September 1991.

Google Scholar

[68]

{68} ¿Shinichi Furusou, Satoshi Matsuoka, and Akinori Yonezawa. Parallel conservative garbage collection with fast allocation. In OOPSLA {272}.

Google Scholar

[69]

{69} Maurice P. Herlihy and J. Eliot B. Moss. Lock-free garbage collection for multiprocessors. Proceedings of the ACM Symposium on Parallel Algorithms and Architectures , 1991. pages 229-236.

Digital Library

Google Scholar

[70]

{70} J. Heymann. A comprehensive analytical model for garbage collection algorithms. SIGPLAN Notices, 26(8):50-59, August 1991.

Digital Library

Google Scholar

[71]

{71} Wolfgang W. Küchlin. A space-efficient parallel garbage compaction algorithm. In Proc. Fifth ACM International Conference on Supercomputing, pages 40-46, Cologne, Germany, June 1991. ACM Press.

Digital Library

Google Scholar

[72]

{72} Wolfgang W. Küchlin and Nicholas J. Nevin. On multi-threaded list-processing and garbage collection. In Proc. Third IEEE Symp. on Parallel and Distributed Processing, pages 894-897, Dallas, TX, December 1991. IEEE Press.

Google Scholar

[73]

{73} Rafael D. Lins. A shared memory architecture for parallel cyclic reference counting. Microprocessing and Microprogramming, 34: 31-35, September 1991.

Google Scholar

[74]

{74} Luigi Mancini and S. K. Shrinivastava. Fault-tolerant reference counting for garbage collection in distributed systems. Computer Journal, 34(6): 503-513, December 1991.

Digital Library

Google Scholar

[75]

{75} Luigi V. Mancini, Rotella Vittoria, and Simonetta Venosa. Copying garbage collection for distributed object stores. In 10th Symposium on Reliable Distributed Systems, Pisa, Italy, September 1991.

Crossref

Google Scholar

[76]

{76} J. Eliot B. Moss. Lock-free garbage collection for multiprocessors. In Parallel Algorithms and Architectures, July 1991.

Digital Library

Google Scholar

[77]

{77} J. M. Piquer. Indirect reference counting, a distributed garbage collection algorithm. In Parallel Architectures and Languages Europe, 1991.

Digital Library

Google Scholar

[78]

{78} ¿David Plainfossé and Marc Shapiro. A distributed garbage collection as an operating system component. In OOPSLA {272}.

Google Scholar

[79]

{79} Marc Shapiro. A fault-tolerant, scalable, low-overhead distributed garbage detection protocol. In Tenth Symposium on Reliable Distributed Systems, Pisa, Italy, September 1991. IEEE Computer Society Press.

Crossref

Google Scholar

[80]

{80} Ravi Sharma and Mary Lou Soffa. Parallel generational garbage collection. In Paepcke {273}, pages 16- 32. Published as SIGPLAN Notices 26 (11), November 1991.

Digital Library

Google Scholar

[81]

{81} ¿Masahiro Yasugi and Akinori Yonezawa. Towards user (application) language-level garbage collection in object-oriented concurrent languages. In OOPSLA {272}.

Google Scholar

[82]

{82} Saleh E. Abdullahi, Eliot E. Miranda, and Graem A. Ringwood. Distributed garbage collection. In Bekkers and Cohen {275}, pages 43-81.

Google Scholar

[83]

{83} ¿Terence J. Critchlow. A distributed garbage collection algorithm. Master's thesis, University of Utah, Salt Lake City, Utah, August 1992.

Google Scholar

[84]

{84} Peter Dickman. Optimizing weighted reference counts for scalable fault-tolerant distributed object-support systems. Submitted for HICSS 26, June 1992.

Google Scholar

[85]

{85} Niels Christian Juul and Eric Jul. Comprehensive and robust garbage collection in a distributed system. In Bekkers and Cohen {275}.

Google Scholar

[86]

{86} R. Kessler, H. Carr, L. Stoller, and M. Swanson. Implementing concurrent scheme for the mayfly distributed parallel processing system. International Journal on Lisp and Symbolic Computation, 5(1):73- 93, May 1992.

Digital Library

Google Scholar

[87]

{87} Robert Kordale, John Shilling, and Mustaque Ahamad. Garbage collection in distributed shared memory systems. Technical Report GIT-CC-92/45, Georgia Institute of Technology, 1992.

Google Scholar

[88]

{88} Rivka Ladin and Barbara Liskov. Garbage collection of a distributed heap. In Principles of Distributed Computing, pages 708-715, 1992.

Crossref

Google Scholar

[89]

{89} Bernard Lang, Christian Queinnec, and José Piquer. Garbage collecting the world. In POPL {278}, pages 39-50. Published as SIGPLAN Notices.

Digital Library

Google Scholar

[90]

{90} Rafael D. Lins. A multi-processor shared memory architecture for parallel cyclic reference counting. Microprocessing and Microprogramming, 35:563-568, September 1992.

Crossref

Google Scholar

[91]

{91} U. Maheshwari. Distributed garbage collection in a client-server transaction system. Master's thesis, MIT EECS Department, 1992.

Google Scholar

[92]

{92} David Plainfosse and Marc Shapiro. Experience with fault tolerant garbage collection in a distributed Lisp system. In Bekkers and Cohen {275}, pages 116-133.

Digital Library

Google Scholar

[93]

{93} M. Shapiro, P. Dickman, and D. Plainfosse. Robust, distributed references and acyclic garbage collection. In Symposium on Principles of Distributed Computing, August 1992.

Digital Library

Google Scholar

[94]

{94} M. ¿Shapiro, P. Dickman, and D. Plainfosse. SSP chains: Robust, distributed references supporting acyclic garbage collection. Technical Report RR-1799, Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau Rocquencourt, B. P. 105, 78153 Le Chesnay Cedex, France, November 1992.

Digital Library

Google Scholar

[95]

{95} ¿Nalini Venkatasubramanian, Gul Agha, and Carolyn Talcott. Scalable distributed garbage collection for systems of active objects. In Bekkers and Cohen {275}, pages 134-147.

Digital Library

Google Scholar

[96]

{96} Taichi Yuasa. Memory management and garbage collection of an extended Common Lisp system for massively parallel SIMD architecture, In Bekkers and Cohen {275}, pages 490-506.

Digital Library

Google Scholar

[97]

{97} ¿Alvaro E. Campos. Distributed, Garbage-Collected, Persistent, Virtual Address Spaces. PhD dissertation, Princeton University, Department of Computer Science, June 1993.

Digital Library

Google Scholar

[98]

{98} Akira Imai and Evan Tick. Evaluation of parallel copying garbage collection on a shared-memory multiprocessor. IEEE Trans. on Parallel and Distributed Systems , 4(9):1030-1040, September 1993.

Digital Library

Google Scholar

[99]

{99} R. Kordale and M. Ahamad. A scalable cyclic garbage detection algorithm for distributed systems. In Paepcke {281}. Published as ACM SIGPLAN Notices 28(10), October 1993.

Digital Library

Google Scholar

[100]

{100} R. Kordale, M. Ahamad, and J. Shilling. Distributed/concurrent garbage collection in distributed shared memory systems. In IWOOOS {279}, 1993.

Google Scholar

[101]

{101} ¿Robert Kordale and M. Ahamad. A scalable cyclic garbage detection algorithm for distributed systems. In OOPSLA {280}.

Google Scholar

[102]

{102} ¿Umesh Maheshwari. Distributed garbage collection in a client-server persistent object system. In OOPSLA {280}.

Google Scholar

[103]

{103} ¿Scott Nettles, James O'Toole, and David Gifford. Concurrent garbage collection of persistent heaps. Technical Report CMU-CS-93-137, Computer science Department, Carnegie-Mellon University, April 1993.

Digital Library

Google Scholar

[104]

{104} ¿James O'Toole and Scott Nettles. Concurrent replicating garbage collection. In OOPSLA {280}.

Google Scholar

[105]

{105} ¿James O'Toole and Scott Nettles. Concurrent replication garbage collection: An implementation report. Technical Report CMU-CS-93-138, Computer science Department, Carnegie-Mellon University, April 1993. Also appears as MIT-LCS-TR-570.

Digital Library

Google Scholar

[106]

{106} ¿Marc Shapiro. Flexible bindings for fine-grain and fragmented objects in distributed systems. Technical Report Rapport de Recherche RR-2007, Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau Rocquencourt, B. P. 105, 78153 Le Chesnay Cedex, France, 1993.

Google Scholar

[107]

{107} ¿Pedro Sousa. Garbage collection of persistent objects in a distributed object-oriented platform. In OOPSLA {280}.

Google Scholar

[108]

{108} ¿Gerard Tel and Friedmann Mattern. The derivation of distributed termination detection algorithms from garbage collection schemes. ACM Transactions on Programming Languages and Systems, 15(1):1-35, January 1993.

Digital Library

Google Scholar

[109]

{109} C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 1(20):44-61, January 1973.

Digital Library

Google Scholar

[110]

{110} Peter L. Deutsch and Daniel G. Bobrow. An efficient, incremental, automatic garbage collector. Communications of the ACM, 19(9):522-526, September 1976.

Digital Library

Google Scholar

[111]

{111} Philip L. Wadler. Analysis of an algorithm for real time garbage collection. Communications of the ACM, 19(9):491-500, September 1976.

Digital Library

Google Scholar

[112]

{112} ¿Henry G. Baker, Jr. and Carl Hewitt. The incremental garbage collection of processes. In Proc. Symposium on A. I. and Programming Languages, 1977. Also appeared as SIGPLAN Notices 12:(8), 55-59, August 1977.

Digital Library

Google Scholar

[113]

{113} Jr. Baker, H. J. and Carl Hewitt. Incremental garbage collection of processes. A.I. Lab Memo 454, MIT, December 1977.

Google Scholar

[114]

{114} H. Baker. Actor Systems for Real-Time Computation . Laboratory of computer science technical report MIT/LCS/TR-197, MIT, March 1978.

Digital Library

Google Scholar

[115]

{115} Henry. G. Baker, Jr, Acrot systems for real-time computation. Report TR-197, MIT, March 1978.

Digital Library

Google Scholar

[116]

{116} ¿Henry G. Jr. Baker. List processing in real time on a serial computer. Communications of the ACM, 21(4):280-294, April 1978.

Digital Library

Google Scholar

[117]

{117} Henry Lieberman and Carl Hewitt. A real-time garbage collector that can recover temporary storage quickly. Artificial Intelligence Laboratory Memo 569, MIT, April 1980.

Google Scholar

[118]

{118} Jeffrey L. Dawson. Improved effectiveness from a real-time LISP garbage collector. In ACM Symposium on LISP and Functional Programming {251}, pages 159- 167.

Digital Library

Google Scholar

[119]

{119} ¿Henry Lieberman and Carl Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the ACM, 26(6):419-429, June 1983.

Digital Library

Google Scholar

[120]

{120} Rodney A. Brooks. Trading data space for reduced time and code space in real-time collection on stock hardware. In ACM Symposium on LISP and Functional Programming {253}, pages 108-113.

Digital Library

Google Scholar

[121]

{121} Bernard Lang and Francis Dupont. Incremental incrementally compacting garbage collection. In SIGPLAN 1987 Symposium on Interpreters and Interpretive Techniques {260}, pages 253-263.

Digital Library

Google Scholar

[122]

{122} W. Zhao, K. Ramamritham, and J. A. Stankovic. Scheduling tasks with resource requirements in hard real-time systems. IEEE Transactions on Software Engineering, 5(13): 564-577, May 1987.

Digital Library

Google Scholar

[123]

{123} S. Cheng, J. A. Stankovic, and K. Ramamritham. Scheduling algorithms for hard real-time systems-a brief survey. In J. A. Stankovic and K. Ramamritham, editors, Tutorial on Hard Real-Time Systems, pages 150-173. IEEE Computer Society Press, 1988.

Digital Library

Google Scholar

[124]

{124} Seng-Lai Heng. Performance evaluation of numerous garbage collection algorithms by real-time simulation. Master's thesis, University of Texas at Austin, 1988.

Google Scholar

[125]

{125} Kelvin Nilsen. Garbage collection of strings and linked data structures in real time. Software Practice and Experience, 18(7):613-640, July 1988.

Digital Library

Google Scholar

[126]

{126} ¿Mats Bengtsson and Boris Magnusson. Real-time compacting garbage collection. In OOPSLA {269}.

Google Scholar

[127]

{127} Elliot Kolodner. Atomic incremental garbage collection and recovery for large stable heap. In Dearle et al. {267}.

Google Scholar

[128]

{128} J. P. Lehoczky. Fixed priority scheduling of periodic tasks with arbitrary deadlines. In IEEE Real-Time Systems Symposium, pages 201-209, December 1990.

Crossref

Google Scholar

[129]

{129} ¿Kelvin Nilsen and William J. Schmidt. Hardware support for garbage collection of linked obects and arrays in real time. In OOPSLA {269}.

Google Scholar

[130]

{130} Kelvin Nilsen and William J. Schmidt. A high-level overview of hardware assisted real-time garbage collection. Technical Report TR 90-18a, Dept. of Computer Science, Iowa State University, Ames, Iowa, 1990.

Google Scholar

[131]

{131} Susan Mayer Stapleton. Real-time garbage collection for general-purpose languages. Master's thesis, Iowa State University, 1990.

Google Scholar

[132]

{132} Douglas M. Wasahbaugh and Dennis Kafura. Incremental garbage collection of concurrent objects for real-time applications. In IEEE Real-Time Systems Symposium, pages 21-30, December 1990.

Google Scholar

[133]

{133} Taichi Yuasa. Real-time garbage collection on general-purpose machines. Journal of Systems and Software, 11: 181-198, 1990.

Digital Library

Google Scholar

[134]

{134} ¿Henry G. Baker, Jr. The Treadmill: Real-time garbage collection without motion sickness. In OOPSLA {272}. Also appears as SIGPLAN Notices 27(3):66-70, March 1992.

Digital Library

Google Scholar

[135]

{135} ¿Steven L. Engelstad and James E. Vandendorpe. Automatic storage management for systems with real time constraints. In OOPSLA {272}.

Google Scholar

[136]

{136} Douglas Johnson. The case for a read barrier. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems {271}, pages 96-107.

Digital Library

Google Scholar

[137]

{137} K. B. Kenny and K. Lin. Flexible real-time systems using the flex language. IEEE Transactions on Computers , pages 70-78, May 1991.

Digital Library

Google Scholar

[138]

{138} ¿Kelvin Nilsen. A high-performance architecture for real-time garbage collection. In OOPSLA {272}.

Google Scholar

[139]

{139} Benjamin Goldberg. Incremental garbage collection without tags. In the Fourth European Symposium on Programming, B. Krieg-Bruckner, editor. February 1992. pages 200-218. Springer-Verlag.

Digital Library

Google Scholar

[140]

{140} Antony L. Hosking, J. Eliot B. Moss, and Darko Stefanovic. A comparative performance evaluation of write barrier implementations. In Paepcke {277}, pages 92-109.

Digital Library

Google Scholar

[141]

{141} Richard L. Hudson and J. Eliot B. Moss. Incremental collection of mature objects. In Bekkers and Cohen {275}, pages 388-403.

Digital Library

Google Scholar

[142]

{142} Ralph E. Johnson. Reducing the latency of a real-time garbage collector. ACM Letters on Programming Languages and Systems, 1(1): 46-58, March 1992.

Digital Library

Google Scholar

[143]

{143} Elliot K. Kolodner and William E. Weihl. Atomic Incremental Garbage Collection. In Bekkers and Cohen {275}, pages 365-387.

Google Scholar

[144]

{144} Thierry Le Sergent and Bernard Berthomieu. Incremental multi-threaded garbage collection on virtually shared memory architectures. In Bekkers and Cohen {275}, pages 179-199. Rapport de Recherche LAASCNRS 92077.

Digital Library

Google Scholar

[145]

{145} F. W. Miller. The performance of a mixed priority real-time scheduling algorithm. Operating Systems Review , 26(4):5-13, October 1992.

Digital Library

Google Scholar

[146]

{146} Scott Nettles, O'Toole James, Nicholas Haines, and David Pierce. Replication-based incremental copying collection. In Bekkers and Cohen {275}, pages 357-364.

Digital Library

Google Scholar

[147]

{147} ¿Kelvin Nilsen. Memory cycle accountings for hardware-assisted real-time garbage collection. Technical Report 91-21(c), Iowa State University, Computer Science Department, 1992.

Google Scholar

[148]

{148} ¿Kelvin Nilsen and W. J. Schmidt. Hardware-assisted general-purpose garbage collection for hard real-time systems. Technical Report 92-15, Iowa State University, Computer Science Department, 1992.

Google Scholar

[149]

{149} ¿William J. Schmidt. Issues in the Design and Implementation of a Real-Time Garbage Collection Architecture . PhD thesis, Iowa State University, Ames, Iowa, 1992. Technical report ISUTR 92-25.

Digital Library

Google Scholar

[150]

{150} ¿K. Tindell. An extendible approach for analyzing fixed priority hard real-time tasks. Technical Report YCS189, Computer Science Department, University of York, December 1992.

Google Scholar

[151]

{151} ¿P. T. Withington. How real is "real time" garbage collection? OOPSLA '92 Workshop on Garbage Collection in Object-Oriented Systems, 1992.

Google Scholar

[152]

{152} ¿Wade Hennessey. Real-time garbage collection in a multimedia programming language. In OOPSLA {280}.

Google Scholar

[153]

{153} Elliot K. Kolodner and William E. Weihl. Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap. In Proceedings of the 1993 ACM SIGMOD International Conference on the Management of Data, pages 177-186, Washington, DC, May 1993. Also Technical Report MIT/LCS/TR-534, feb 1992.

Digital Library

Google Scholar

[154]

{154} ¿Kelvin Nilsen. Reliable real-time garbage collection of C++. In OOPSLA {280}.

Google Scholar

[155]

{155} ¿Kelvin Nilsen and William J. Schmidt. A high-performance hardware assisted real-time garbage collection. Journal of Programming Language Design and Implementation, 1993. To Appear.

Google Scholar

[156]

{156} ¿Paul R. Wilson and Mark S. Johnstone. Real-time non-copying garbage collection. In OOPSLA {280}.

Google Scholar

[157]

{157} J. Xu and D. L. Parnas. On satisfying timing constraints in hard real-time systems. IEEE Transactions on Software Engineering, 19(1):70-84, January 1993.

Digital Library

Google Scholar

[158]

{158} K. Nilsen and W. J. Schmidt. Cost-effective object-space management for hardware-assisted real-time garbage collection. ACM Letters on Programming Languages and Systems, 1(4):338-354, December 1993.

Digital Library

Google Scholar

[159]

{159} ¿K. Tindell, A. Burns, and A. Wellings. Allocating real-time tasks (an NP-hard problem made easy). Real-Time Systems, To Appear.

Digital Library

Google Scholar

[160]

{160} D. T. Ross. The AED free storage package. Communications of the ACM, 10(8):481-492, August 1967. Memory is split into zones. Different zones can be managed differently. Ross says that automatic collection in zones is inefficient. No mechanism to handle interzonal pointers.

Digital Library

Google Scholar

[161]

{161} H. D. Baecker. On a missing mode in algol 68. SIGPLAN Notices, 7(12): 20-30, December 1972. Proposes adding areas or regions to algol 68. Each region maintains a table of objects that reside in the region.

Digital Library

Google Scholar

[162]

{162} D. B. Lomet. Scheme for invalidating references to freed storage. IBM Journal of Research and Development , pages 26-35, January 1975. no interarea links. though he maintains objects in regions.

Digital Library

Google Scholar

[163]

{163} Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, May 1977. Technical report MIT/LCS/TR-178.

Google Scholar

[164]

{164} ¿David M. Ungar. Generation scavenging: A nondisruptive high-performance storage reclamation algorithm. In Peter Henderson, editor, Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments , pages 157-167, Pittsburgh, Pennsylvania, April 1984. Also distributed as ACM SIGPLAN Notices 19(5): 157-167, May, 1984 and Software Engineering Notes 9(3):157-167, May, 1984.

Digital Library

Google Scholar

[165]

{165} Christina Ruggieri. Dynamic Memory Allocation Techniques Based on the Lifetimes of Objects. PhD thesis, Purdue University, West Lafayette, Indiana, August 1987.

Digital Library

Google Scholar

[166]

{166} Christina Ruggieri and Thomas P. Murtagh. Lifetime analysis of dynamically allocated objects. In Proceedings of the Seventeenth Annual SIGPLAN Symposium on Programming Language Design and Implementation {263}, pages 285-293.

Digital Library

Google Scholar

[167]

{167} Patrick G. Sobalvarro. A lifetime-based garbage collector for LISP systems on general-purpose computers. B.S. thesis, Massachusetts Institute of Technology EECS Department, Cambridge, Massachusetts, 1988.

Google Scholar

[168]

{168} David Ungar and Frank Jackson. Tenuring policies for generation-based storage reclamation. In Meyrowitz {261}, pages 1-17. Also published as ACM SIGPLAN Notices 19(5):157-167, May, 1987.

Digital Library

Google Scholar

[169]

{169} Andrew W. Appel. Simple generational garbage collection and fast allocation. Software Practice and Experience , 19(2):171-183, February 1989.

Digital Library

Google Scholar

[170]

{170} Joel F. Bartlett. Mostly-copying collection picks up generations and c++. Technical Report TN-12, DEC Western Research Laboratory, October 1989.

Google Scholar

[171]

{171} ¿Joel F. Bartlett. A generational, compacting garbage collector for c++. In OOPSLA {269}.

Google Scholar

[172]

{172} Alan Demers, Mark Weiser, Barry Hayes, Daniel Bobrow, and Scott Shenker. Combining generational and conservative garbage collection: Framework and implementations. In Proceedings of the Seventeenth Annual SIGPLAN Symposium on Programming Language Design and Implementation {270}, pages 261- 269.

Digital Library

Google Scholar

[173]

{173} Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Caching consideration for generational garbage collection: A case for large and set-associative caches. Technical Report UIC-EECS-90-5, University of Illinois at Chicago EECS Dept., Chicago, Illinois, December 1990. Also See {175}.

Google Scholar

[174]

{174} Barry Hayes. Using key object opportunism to collect old objects. In Paepcke {273}, pages 33-46.

Digital Library

Google Scholar

[175]

{175} ¿Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Caching considerations for generational garbage collection. In ACM Symposium on LISP and Functional Programming {276}, pages 32-42.

Digital Library

Google Scholar

[176]

{176} ¿Henry G. Baker, Jr. 'Infant Mortality' and generational collection. ACM SIGPLAN Notices, 28(4):55- 57, April 1993.

Digital Library

Google Scholar

[177]

{177} ¿Urs Hölzle. A fast write barrier for generational garbage collectors. In OOPSLA {280}.

Google Scholar

[178]

{178} ¿David Tarditi and Amer Diwan. The full cost of a generational copying garbage collection implementation. In OOPSLA {280}.

Google Scholar

[179]

{179} A. Newell and J. C. Shaw. Programming the logic theory machine. In Proceedings of the Western Joint Computing Conference, pages 230-240, 1957.

Digital Library

Google Scholar

[180]

{180} ¿John McCarthy. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM, 3(4): 184-195, April 1960.

Digital Library

Google Scholar

[181]

{181} Marvin Minsky. A LISP garbage collector algorithm using serial secondary storage. A.I Memo 58, MIT Project MAC, Cambridge, Massachusetts, October 1963.

Google Scholar

[182]

{182} Cohen and Trilling. Remarks on "garbage collection" using a two-level storage. BIT, 7(1):22-30, 1967.

Crossref

Google Scholar

[183]

{183} B. K. Haddon and W. M. Waite. A compaction procedure for variable-length storage elements. Computer Journal, 10(2): 162-165, August 1967.

Crossref

Google Scholar

[184]

{184} Robert R. Fenichel and Jerome C. Yochelson. A LISP garbage-collector for virtual-memory computer systems. Communications of the ACM, 12(11):611-612, November 1969.

Digital Library

Google Scholar

[185]

{185} ¿C. J. Cheney. A nonrecursive list compacting algorithm. Communications of the ACM, 13(11):677-678, November 1970.

Digital Library

Google Scholar

[186]

{186} Robert R. Fenichel. List tracing in systems allowing multiple cell types. Communications of the ACM, 14(8):522-526, August 1971.

Digital Library

Google Scholar

[187]

{187} Lars-Erik Thorelli. Marking algorithms. BIT, 12(4): 555-568, 1972.

Crossref

Google Scholar

[188]

{188} D. C. Walden. A note on cheney's nonrecursive list-compacting algorithm. Communications of the ACM, 15(4): 275, April 1972.

Digital Library

Google Scholar

[189]

{189} B. Wegbreit. A generalized compactifying garbage collection. Computer Journal, 15(3): 204-208, August 1972.

Crossref

Google Scholar

[190]

{190} B. Wegbreit. A space efficient list structure tracing algorithm. IEEE Transactions on Computers, C21: 1009-1010, September 1972.

Digital Library

Google Scholar

[191]

{191} G. Lindstrom. Copying list structures using bounded workspace. Information Processing Letters, 2(2): 47- 51, June 1973.

Crossref

Google Scholar

[192]

{192} G. Lindstron. Copying list structures using bounded workspace. Communications of the ACM, 17(4): 198- 202, April 1974.

Digital Library

Google Scholar

[193]

{193} D. A. Fisher. Copying cyclic list structure in linear time using bounded workspace. Communications of the ACM, 18(5):251-252, May 1975.

Digital Library

Google Scholar

[194]

{194} T. Kurokawa. New marking algorithms for garbage collection. In Proc. 2nd USA-Japan Computer Conference , pages 580-584. 1975.

Google Scholar

[195]

{195} D. A. Zave. A fast compacting garbage collector. Information Processing Letters, 3(6):167-169, July 1975.

Crossref

Google Scholar

[196]

{196} D. W. Clark. An efficient list moving algorithm using constant workspace. Communications of the ACM, 19(6):352-354, June 1976.

Digital Library

Google Scholar

[197]

{197} Lars-Erik Thorelli. A fast compactifying garbage collector. BIT, 16(4): 426-441, 1976.

Crossref

Google Scholar

[198]

{198} J. L. Baer and Fries H. On the efficiency of some list marking algorithms. In B. Gilchrist, editor, Information Processing: Proceedings of the IFIP Congress, pages 751-756. North-Holland, Amsterdam, 1977.

Google Scholar

[199]

{199} J. M. Robson. A bounded storage algorithm for copying cyclic structures. Communications of the ACM, 20(6):431-433, June 1977.

Digital Library

Google Scholar

[200]

{200} L. Yelowitz and Duncan A. G. Abstractions, instantiations and proofs of marking algorithms. In Proc. Symp. Artificial Intelligence and Programming Languages , pages 13-21, August 1977. Also appeared as SIGPLAN Notices 12:8.

Digital Library

Google Scholar

[201]

{201} D. W. Clark. A fast algorithm for copying list structures. Communications of the ACM, 21(5):351-357, May 1978.

Digital Library

Google Scholar

[202]

{202} J. P. Fitch and A. C. Norman. A note on compacting garbage collection. Computer Journal, 21(1):31-34, February 1978.

Crossref

Google Scholar

[203]

{203} F. Lockwood Morris. A time- and space-efficient garbage compaction algorithm. Communications of the ACM, 21(8), August 1978.

Digital Library

Google Scholar

[204]

{204} M. Terashima and E. Goto. Genetic order and compactifying garbage collectors. Information Processing Letters, 7(1):27-32, January 1978.

Crossref

Google Scholar

[205]

{205} S. L. Gerhart. A Derivation Oriented Proof of Schorr-Waite Marking Algorithm, volume 69 of Lecture Notes in Computer Science, pages 472-492. Springer Verlag, New York, 1979.

Google Scholar

[206]

{206} D. Gries. The schorr-waite graph marking algorithm. Acta Informatica, 11(3):223-232, 1979.

Digital Library

Google Scholar

[207]

{207} H. B. M. Jonkers. A fast garbage compaction algorithm. Information Processing Letters, 9(1):26-30, July 1979.

Crossref

Google Scholar

[208]

{208} T. Kurokawa. A new fast and safe marking algorithm. Toshiba Research and Development Center, Kawasaki 210, Japan, January 1979.

Google Scholar

[209]

{209} S. Lee, de Roever W. P., and Gerhart S. The evolution of list-copying algorithms. In POPL {250}, pages 53- 56.

Digital Library

Google Scholar

[210]

{210} Proceedings of the Sixth Annual SIGPLAN Symposium on Programming Language Design and Implementation , San Antonio, Texas, January 1979.

Google Scholar

[211]

{211} R. Topor. The correctness of the schorr-waite list marking algorithm. Acta Informatica, 11(3):211-221, 1979.

Digital Library

Google Scholar

[212]

{212} ¿Henry G. Baker, Jr. The paging behavior of the Cheney list copying algorithm. Technical report, University of Rochester Computer Science Department, 1980.

Google Scholar

[213]

{213} K. P. Lee. A linear algorithm for copying binary trees using bounded workspace. Communications of the ACM, 23(3):159-162, March 1980.

Digital Library

Google Scholar

[214]

{214} Johannes J. Martin. An efficient garbage compaction algorithm. Communications of the ACM, 25(8):571- 581, August 1982.

Digital Library

Google Scholar

[215]

{215} Morris. Another compacting garbage collector. IPL, 1982.

Google Scholar

[216]

{216} Jacques Cohen and Alexandru Nicolau. Comparison of compacting algorithms for garbage collection. ACM Transactions on Programming Languages and Systems, 5(4):532-553, October 1983.

Digital Library

Google Scholar

[217]

{217} Morris. Letter on: Another compacting garbage collector. IPL, 1983.

Google Scholar

[218]

{218} Joseph Y. Halpern, Albert R. Meyer, and B. A. Trakhtenbrot. The semantics of local storage, or what makes the free-list free? In Proceedings of the Eleventh Annual SIGPLAN Symposium on Programming Language Design and Implementation {254}, pages 245- 257.

Digital Library

Google Scholar

[219]

{219} Kai Li and Paul Hudak. A new list compaction method. Software Practice and Experience, 16(2): 145- 163, February 1986.

Digital Library

Google Scholar

[220]

{220} Joel F. Bartlett. Compacting garbage collection with ambiguous roots. Technical Report 88/2, Digital Equipment Corporation Western Research Laboratory, Palo Alto, California, February 1988.

Digital Library

Google Scholar

[221]

{221} ¿Svante Carlsson, Christer Mattsson, and Mats Bengtsson. A fast expected-time compacting garbage collection algorithm. In OOPSLA {269}.

Google Scholar

[222]

{222} Benjamin Zorn. Comparing mark-and-sweep and stop-and-copy garbage collection. In ACM Symposium on LISP and Functional Programming {268}, pages 87-98.

Digital Library

Google Scholar

[223]

{223} ¿Henry G. Baker, Jr. Cache-conscious copying collection. Unpublished paper at OOPSLA '91 Workshop on Garbage Collection in Object-Oriented Systems., October 1991.

Google Scholar

[224]

{224} D. R. Edelson. A mark-and-sweep collector for c++. In POPL {278}, pages 51-58.

Digital Library

Google Scholar

[225]

{225} ¿Scott Nettles. A larch specification of copying garbage collection. Technical Report CMU-CS-92-219, Computer science Department, Carnegie-Mellon University, December 1992.

Digital Library

Google Scholar

[226]

{226} ¿Amer Diwan, David Tarditi, and Eliot Moss. Memory sybsystem performance of programs using copying garbage collection. Technical Report CMU-CS-93-210, Computer science Department, Carnegie-Mellon University, December 1993.

Digital Library

Google Scholar

[227]

{227} ¿George E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 2(12):655- 657, December 1960.

Digital Library

Google Scholar

[228]

{228} J. Harold McBeth. On the reference counter method. Communications of the ACM, 6(9):575, September 1963.

Digital Library

Google Scholar

[229]

{229} J. Weizenbaum. Symmetric list processor. Communications of the ACM, 6(9):524-544, 1963.

Digital Library

Google Scholar

[230]

{230} J. Weizenbaum. More on the reference counter method. Communications of the ACM, 7(1):38, 1964.

Digital Library

Google Scholar

[231]

{231} G. E. Collins. REFCO III, a reference count list processing system for the IBM 7094. Research Report RC-1436, IBM, May 1965.

Google Scholar

[232]

{232} David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351-359, 1977.

Crossref

Google Scholar

[233]

{233} D. M. Berry, L. M. Chirica, J. B. Johnston, D. F. Martin, and A. Sorkin. Time required for reference count management in retention block-structured languages part-i. International Journal of Computer and Information Sciences, 7(1): 11-64, March 1978.

Crossref

Google Scholar

[234]

{234} D. M. Berry, L. M. Chirica, J. B. Johnston, D. F. Martin, and A. Sorkin. Time required for reference count management in retention block-structured languages part-ii. International Journal of Computer and Information Sciences, 7(2):91-119, June 1978.

Crossref

Google Scholar

[235]

{235} D. P. Friedman and D.S. Wise. Reference counting can manage the circular environments of mutual recursion. Information Processing Letters, 8(1): 41-44, January 1979.

Crossref

Google Scholar

[236]

{236} David S. Wise. Morris's garbage compaction algorithm restores reference counts. ACM Transactions on Programming Languages and Systems, 1(1):115-120, July 1979.

Digital Library

Google Scholar

[237]

{237} Daniel G. Bobrow. Managing reentrant structures using reference counts. ACM Transactions on Programming Languages and Systems, 2(3):269-273, July 1980.

Digital Library

Google Scholar

[238]

{238} R. John M. Hughes. Reference counting with circular structures in virtual memory applicative systems. Departmental research report, Programming Research Group, Oxford University, United Kingdom, 1982.

Google Scholar

[239]

{239} Thomas W. Christopher. Reference count garbage collection. Software Practice and Experience, 14(6):503- 507, June 1984.

Crossref

Google Scholar

[240]

{240} D. R. Brownbridge. Cyclic reference counting for combinator machines. In Jouannaud {255}, pages 273-288.

Digital Library

Google Scholar

[241]

{241} Jean-Pierre Jouannaud, editor. ACM Conference on Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, Nancy, France, 1985. Springer-Verlag.

Digital Library

Google Scholar

[242]

{242} Paul Hudak. A semantic model of reference counting and its abstraction. In ACM Symposium on LISP and Functional Programming {256}, pages 351-363.

Digital Library

Google Scholar

[243]

{243} Jon D. Salkild. Implementation and analysis of two reference counting algorithms. Master's thesis, University College, London, United Kingdom, 1987.

Google Scholar

[244]

{244} E. J. H. Pepels, M. C. J. D. Eekelen, van, and M. J. Plasmeijer. A cyclic reference counting algorithm and its proof. Technical report 88-10, Computing Science Department, University of Nijmegen, 1988.

Google Scholar

[245]

{245} T.H. Axford. Reference counting of cyclic graphs for functional programs. Computer Journal, 33(5):466- 470, 1990.

Digital Library

Google Scholar

[246]

{246} Rafael D. Lins and Richard E. Jones. Cyclic weighted reference counting. Technical Report 95, University of Kent, Canterbury, United Kingdom, December 1991.

Google Scholar

[247]

{247} Rafael D. Lins and Márcio A. Vasques. A comparative study of algorithms for cyclic reference counting. Technical Report 92, University of Kent, Canterbury, United Kingdom, August 1991. Submitted to Software Practice and Experience.

Google Scholar

[248]

{248} Richard E. Jones and Rafael D. Lins. Cyclic weighted reference counting without delay. Technical Report 28-92, University of Kent, Canterbury, United Kingdom, December 1992.

Google Scholar

[249]

{249} ¿Munenori Maeda, Hiroki Konaka, Yutaka Ishikawa, Takashi Tomokiyo, and Atsushi Hori. An incremental, weighted, cyclic reference counting for object-based languages. In OOPSLA {280}.

Google Scholar

[250]

{250} Proceedings of the Sixth Annual SIGPLAN Symposium on Programming Language Design and Implementation , San Antonio, Texas, January 1979.

Google Scholar

[251]

{251} ACM Symposium on LISP and Functional Programming , Pittsburgh, Pennsylvania, August 1982. ACM Press.

Google Scholar

[252]

{252} M. Nielsen and E. M. Schmidt, editors. Ninth International Colloquium on Automata, Languages and Programming, Aarhus, Denmark, July 1982. Springer-Verlag.

Digital Library

Google Scholar

[253]

{253} ACM Symposium on LISP and Functional Programming , Austin, Texas, August 1984, ACM Press.

Google Scholar

[254]

{254} Proceedings of the Eleventh Annual SIGPLAN Symposium on Programming Language Design and Implementation , Salt Lake City, Utah, January 1984. ACM Press.

Google Scholar

[255]

{255} Jean-Pierre Jouannaud, editor. ACM Conference on Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, Nancy, France, 1985. Springer-Verlag.

Digital Library

Google Scholar

[256]

{256} ACM Symposium on LISP and Functional Programming , Cambridge, Massachusetts, August 1986. ACM Press.

Google Scholar

[257]

{257} Second International Conference on Architectural Support for Programming Languages and Operating Systems , Palo Alto, California, October 1987.

Google Scholar

[258]

{258} Jacobus W. de Bakker, L. Nijman, and Philip C. Treleaven, editors. Parallel Architectures and Languages Europe, number 258, 259 in Lecture Notes in Computer Science, Eindhoven, The Netherlands, June 1987. Springer-Verlag.

Digital Library

Google Scholar

[259]

{259} Gilles Kahn, editor. ACM Conference on Functional Programming Languages and Computer Architecture, number 274 in Lecture Notes in Computer Science. Springer-Verlag, September 1987.

Digital Library

Google Scholar

[260]

{260} SIGPLAN 1987 Symposium on Interpreters and Interpretive Techniques, Saint Paul, Minnesota, June 1987. ACM Press.

Crossref

Google Scholar

[261]

{261} Norman Meyrowitz, editor. Conference on Object Oriented Programming Systems, Languages and Applications , San Diego, California, September 1988. ACM Press. Published as SIGPLAN Notices 23(11), November 1988.

Crossref

Google Scholar

[262]

{262} Proceedings of the Nineteenth Annual SIGPLAN Symposium on Programming Language Design and Implementation , Atlanta, Georgia, June 1988. ACM Press.

Google Scholar

[263]

{263} Proceedings of the Seventeenth Annual SIGPLAN Symposium on Programming Language Design and Implementation, San Diego, California, January 1988. ACM Press.

Google Scholar

[264]

{264} Norman Meyrowitz, editor. Conference on Object Oriented Programming Systems, Languages and Applications , New Orleans, Louisiana, 1989. ACM Press. Published as SIGPLAN Notices 24(10), October 1989.

Crossref

Google Scholar

[265]

{265} Eddy Odijik, M. Rem, and Jean-Claude Sayr, editors. Parallel Architectures and Languages Europe, number 365, 366 in Lecture Notes in Computer Science, Eindhoven, The Netherlands, June 1989. Springer-Verlag.

Crossref

Google Scholar

[266]

{266} Proceedings of the Twentieth Annual SIGPLAN Conference on Programming Language Design and Implementation , Portland, Oregon, June 1989. ACM Press. Published as SIGPLAN Notices 24(7), July 1989.

Google Scholar

[267]

{267} Alan Dearle, Gail M. Shaw, and Stanley B. Zdonik, editors. Implementing Persistent Object Bases: Principles and Practice (Proceedings of the Fourth International Workshop on Persistent Object Systems), Martha's Vineyard, Massachusetts, September 1990. Morgan Kaufman.

Crossref

Google Scholar

[268]

{268} ACM Symposium on LISP and Functional Programming , Nice, France, June 1990. ACM Press.

Google Scholar

[269]

{269} Workshop on Garbage Collection. ACM Press, October 1990.

Google Scholar

[270]

{270} Proceedings of the Seventeenth Annual SIGPLAN Symposium on Programming Language Design and Implementation, San Francisco, California, January 1990. ACM Press.

Google Scholar

[271]

{271} Fourth International Conference on Architectural Support for Programming Languages and Operating Systems , Santa Clara, California, April 1991.

Google Scholar

[272]

{272} Workshop on Garbage Collection. ACM Press, October 1991.

Google Scholar

[273]

{273} Andreas Paepcke, editor. Conference on Object Oriented Programming Systems, Languages and Applications , Phoenix, Arizona, October 1991. ACM Press. Published as SIGPLAN Notices 26(11), November 1991.

Crossref

Google Scholar

[274]

{274} Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, June 1991. ACM Press. Published as SIGPLAN Notices 26(6), June 1992.

Google Scholar

[275]

{275} Yves Bekkers and Jacques Cohen, editors. International Workshop on Memory Management, number 637 in Lecture Notes in Computer Science, St. Malo, France, September 1992. Springer-Verlag.

Digital Library

Google Scholar

[276]

{276} ACM Symposium on LISP and Functional Programming , San Francisco, California, June 1992. ACM Press.

Google Scholar

[277]

{277} Andreas Paepcke, editor. Conference on Object Oriented Programming Systems, Languages and Applications , Vancouver, British Columbia, October 1992. ACM Press. Published as SIGPLAN Notices 27(10), October 1992.

Google Scholar

[278]

{278} Proceedings of the Nineteenth Annual SIGPLAN Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992. ACM Press. Published as SIGPLAN Notices.

Google Scholar

[279]

{279} International Workshop on Object Orientation in Operating Systems, Asheville, December 1993, IEEE Press.

Google Scholar

[280]

{280} Workshop on Garbage Collection. ACM Press, September 1993.

Google Scholar

[281]

{281} Andreas Paepcke, editor. Conference on Object Oriented Programming Systems, Languages and Applications , Washington Hilton and Towers, Washington, DC, USA, 1993. ACM Press. Published as ACM SIGPLAN Notices 28(10), October 1993.

Google Scholar

Cited By

View all

Majchrzak TMajchrzak T(2012)Software TestingImproving Software Testing10.1007/978-3-642-27464-0_2(11-56)Online publication date: 3-Feb-2012
https://doi.org/10.1007/978-3-642-27464-0_2
Cain DRoe P(2010)Ismat: a virtual machine for compositional parallelismComputer Science - Research and Development10.1007/s00450-010-0110-825:1-2(51-56)Online publication date: 10-Apr-2010
https://doi.org/10.1007/s00450-010-0110-8
Meehan ALunney T(2001)Java garbage collection — a generic solution?Information and Software Technology10.1016/S0950-5849(00)00146-443:2(151-155)Online publication date: Feb-2001
https://doi.org/10.1016/S0950-5849(00)00146-4
Show More Cited By

Index Terms

A bibliography on garbage collection and related topics
1. General and reference
  1. Document types
    1. Reference works
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

Age-based garbage collection

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Age-based garbage collection
OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Fast conservative garbage collection
OOPSLA '14

Garbage collectors are exact or conservative. An exact collector identifies all references precisely and may move referents and update references, whereas a conservative collector treats one or more of stack, register, and heap references as ambiguous. ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1994

Published in SIGPLAN Volume 29, Issue 9

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
145
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)5

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Majchrzak TMajchrzak T(2012)Software TestingImproving Software Testing10.1007/978-3-642-27464-0_2(11-56)Online publication date: 3-Feb-2012
https://doi.org/10.1007/978-3-642-27464-0_2
Cain DRoe P(2010)Ismat: a virtual machine for compositional parallelismComputer Science - Research and Development10.1007/s00450-010-0110-825:1-2(51-56)Online publication date: 10-Apr-2010
https://doi.org/10.1007/s00450-010-0110-8
Meehan ALunney T(2001)Java garbage collection — a generic solution?Information and Software Technology10.1016/S0950-5849(00)00146-443:2(151-155)Online publication date: Feb-2001
https://doi.org/10.1016/S0950-5849(00)00146-4
TANAKA TWATANABE TKURODA M(1998)Estimation of nitrification enhanced by application of electric current.Journal of Japan Society on Water Environment10.2965/jswe.21.59621:9(596-602)Online publication date: 1998
https://doi.org/10.2965/jswe.21.596
KURODA MTANAKA TWATANABE T(1997)Nitrification under Low DO Condition by Bio-electro Reactor Process.Journal of Japan Society on Water Environment10.2965/jswe.20.66620:10(666-669)Online publication date: 1997
https://doi.org/10.2965/jswe.20.666
Chakravarty MLock H(1997)Towards the uniform implementation of declarative languagesComputer Languages10.1016/S0096-0551(97)00012-X23:2-4(121-160)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1016/S0096-0551%2897%2900012-X
Comar CDismukes GGasperoni F(1995)The GNAT implementation of controlled typesProceedings of the conference on TRI-Ada '95: Ada's role in global markets: solutions for a changing complex world10.1145/376503.376724(467-473)Online publication date: 1-Nov-1995
https://dl.acm.org/doi/10.1145/376503.376724

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Age-based garbage collection

Age-based garbage collection

Fast conservative garbage collection

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations