This bibliography contains over 400 references. However, our comprehensive database at http://www.cs.kent.ac.uk/~rej/gcbib/
contains over 2500 garbage collection related publications. This database can be searched online or downloaded as BIBTEX, PostScript or PDF. As well as details of the article, papers, books, theses and so on, the bibliography also contains abstracts for some entries and URLs or DOIs for most of the electronically available ones. We continually strive to keep this bibliography up to date as a service to the community. Here you can help: Richard (R.E.Jones@kent.ac.uk) would be very grateful to receive further entries (or corrections).
Santosh G. Abraham and Janak H. Patel. Parallel garbage collection on a virtual memory system. University Park, Pennsylvania, August 1987, pages 243–246. Pennsylvania State University Press. Also technical report CSRD 620, University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development. 316, 317, 318, 326, 472
Diab Abuaiadh, Yoav Ossia, Erez Petrank, and Uri Silbershtein. An efficient parallel heap compaction algorithm. In OOPSLA 2004, pages 224–236. doi: 10.1145/1028976.1028995
. 32, 38, 46, 301, 302, 319
Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. WRL Research Report 95/7, Digital Western Research Laboratory, September 1995. http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-95-7.pdf
. 237
Sarita V. Adve and Kourosh Gharachorloo. Shared memory consistency models: A tutorial. IEEE Computer, 29(12):66–76, December 1996. doi: 10.1109/2.546611
. 237
Ole Agesen. GC points in a threaded environment. Technical Report SMLI TR-98-70, Sun Microsystems Laboratories, Palo Alto, CA, 1998. http://dl.acm.org/citation.cfm?id=974974
. 188, 189
Rafael Alonso and Andrew W. Appel. An advisor for flexible working sets. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Boulder, CO, May 1990, pages 153–162. ACM Press. doi: 10.1145/98457.98753
. 208, 209
Andrew W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275–279, 1987. doi: 10.1016/0020-0190(87)90175-X
. 125, 171
Andrew W. Appel. Simple generational garbage collection and fast allocation. Software: Practice and Experience, 19(2):171–183, 1989a. doi: 10.1002/spe.4380190206
. 121, 122, 125, 195, 197
Andrew W. Appel. Runtime tags aren’t necessary. Lisp and Symbolic Computation, 2: 153–162, 1989b. doi: 10.1007/BF01811537
. 171, 172
Andrew W. Appel. Tutorial: Compilers and runtime systems for languages with garbage collection. In PLDI 1992. doi: 10.1145/143095
. 113
Andrew W. Appel. Emulating write-allocate on a no-write-allocate cache. Technical Report TR-459-94, Department of Computer Science, Princeton University, June 1994. http://www.cs.princeton.edu/research/techreps/TR-459-94
. 100, 165, 166
Andrew W. Appel and Zhong Shao. An empirical and analytic study of stack vs. heap cost for languages with closures. Technical Report CS–TR–450–94, Department of Computer Science, Princeton University, March 1994. http://www.cs.princeton.edu/research/techreps/TR-450-94
. 171
Andrew W. Appel and Zhong Shao. Empirical and analytic study of stack versus heap cost for languages with closures. Journal of Functional Programming, 6(1):47–74, January 1996. doi: 10.1017/S095679680000157X
. 171
Andrew W. Appel, John R. Ellis, and Kai Li. Real-time concurrent collection on stock multiprocessors. In PLDI 1988, pages 11–20. doi: 10.1145/53990.53992
. 316, 317, 318, 340, 352, 473
J. Armstrong, R. Virding, C. Wikström, and M. Williams. Concurrent Programming in Erlang. Prentice-Hall, second edition, 1996. 146
Matthew Arnold and Barbara G. Ryder. A framework for reducing the cost of instrumented code. In PLDI 2001, pages 168–179. doi: 10.1145/378795.378832
. 412
Nimar S. Arora, Robert D. Blumofe, and C. Greg Plaxton. Thread scheduling for multiprogrammed multiprocessors. In 10th ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June 1998, pages 119–129. ACM Press. doi: 10.1145/277651.277678
. 267, 268, 280
Joshua Auerbach, David F. Bacon, Perry Cheng, David Grove, Ben Biron, Charlie Gracie, Bill McCloskey, Aleksandar Micic, and Ryan Sciampacone. Tax-and-spend: Democratic scheduling for real-time garbage collection. In 8th ACM International Conference on Embedded Software, Atlanta, GA, 2008, pages 245–254. ACM Press. doi: 10.1145/1450058.1450092
. 400
Thomas H. Axford. Reference counting of cyclic graphs for functional programs. Computer Journal, 33(5):466–470, 1990. doi: 10.1093/comjnl/33.5.466
. 67
Alain Azagury, Elliot K. Kolodner, and Erez Petrank. A note on the implementation of replication-based garbage collection for multithreaded applications and multiprocessor environments. Parallel Processing Letters, 9(3):391–399, 1999. doi: 10.1142/S0129626499000360
. 342
Hezi Azatchi and Erez Petrank. Integrating generations with advanced reference counting garbage collectors. In 12th International Conference on Compiler Construction, Warsaw, Poland, May 2003, pages 185–199. Volume 2622 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-36579-6_14
. 369
Hezi Azatchi, Yossi Levanoni, Harel Paz, and Erez Petrank. An on-the-fly mark and sweep garbage collector based on sliding views. In OOPSLA 2003, pages 269–281. doi: 10.1145/949305.949329
. 331
Azul. Pauseless garbage collection. White paper AWP–005–020, Azul Systems Inc., July 2008. http://www.azulsystems.com/products/whitepaper/wp_pgc.pdf
. 355, 361
Azul. Comparison of virtual memory manipulation metrics. White paper, Azul Systems Inc., 2010. http://www.managedruntime.org/files/downloads/AzulVmemMetricsMRI.pdf
. 360
David F. Bacon and V.T. Rajan. Concurrent cycle collection in reference counted systems. In Jørgen Lindskov Knudsen, editor, 15th European Conference on Object-Oriented Programming, Budapest, Hungary, June 2001, pages 207–235. Volume 2072 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-45337-7_12
. 59, 67, 72, 108, 157, 366, 373
David F. Bacon, Clement R. Attanasio, Han Bok Lee, V. T. Rajan, and Stephen E. Smith. Java without the coffee breaks: A nonintrusive multiprocessor garbage collector. In PLDI 2001, pages 92–103. doi: 10.1145/378795.378819
. 67, 366
David F. Bacon, Perry Cheng, and V.T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In POPL 2003, pages 285–298. doi: 10.1145/604131.604155
. 323, 391, 394, 395
David F. Bacon, Perry Cheng, and V.T. Rajan. Controlling fragmentation and space consumption in the Metronome, a real-time garbage collector for Java. In LCTES 2003, pages 81–92. doi: 10.1145/780732.780744
. 404
David F. Bacon, Perry Cheng, and V.T. Rajan. A unified theory of garbage collection. In OOPSLA 2004, pages 50–68. doi: 10.1145/1035292.1028982
. 77, 80, 134
David F. Bacon, Perry Cheng, David Grove, and Martin T. Vechev. Syncopation: Generational real-time garbage collection in the Metronome. In ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, Chicago, IL, June 2005, pages 183–192. ACM SIGPLAN Notices 40(7), ACM Press. doi: 10.1145/1065910.1065937a
. 399
Scott B. Baden. Low-overhead storage reclamation in the Smalltalk-80 virtual machine. In Glenn Krasner, editor, Smalltalk-80: Bits of History, Words of Advice, pages 331–342. Addison-Wesley, 1983. 61, 63
Brenda Baker, E. G. Coffman, and D. E. Willard. Algorithms for resolving conflicts in dynamic storage allocation. Journal of the ACM, 32(2):327–343, April 1985. doi: 10.1145/3149.335126
. 139
Henry G. Baker. List processing in real-time on a serial computer. Communications of the ACM, 21(4):280–294, 1978. doi: 10.1145/359460.359470
. Also AI Laboratory Working Paper 139, 1977. 138, 277, 316, 317, 318, 337, 340, 341, 342, 347, 361, 377, 384, 385
Henry G. Baker. The Treadmill, real-time garbage collection without motion sickness. ACM SIGPLAN Notices, 27(3):66–70, March 1992a. doi: 10.1145/130854.130862
. 104, 139, 361
Henry G. Baker. CONS should not CONS its arguments, or a lazy alloc is a smart alloc. ACM SIGPLAN Notices, 27(3), March 1992b. doi: 10.1145/130854.130858
. 147
Henry G. Baker. ‘Infant mortality’ and generational garbage collection. ACM SIGPLAN Notices, 28(4):55–57, April 1993. doi: 10.1145/152739.152747
. 106
Jason Baker, Antonio Cunei, Filip Pizlo, and Jan Vitek. Accurate garbage collection in uncooperative environments with lazy pointer stacks. In International Conference on Compiler Construction, Braga, Portugal, March 2007. Volume 4420 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-71229-9_5
. 436
Jason Baker, Antonio Cunei, Tomas Kalibera, Filip Pizlo, and Jan Vitek. Accurate garbage collection in uncooperative environments revisited. Concurrency and Computation: Practice and Experience, 21(12):1572–1606, 2009. doi: 10.1002/cpe.1391
. Supersedes Baker et al [2007]. 171
Katherine Barabash, Yoav Ossia, and Erez Petrank. Mostly concurrent garbage collection revisited. In OOPSLA 2003, pages 255–268. doi: 10.1145/949305.949328
. 319, 320
Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia, Avi Owshanko, and Erez Petrank. A parallel, incremental, mostly concurrent garbage collector for servers. ACM Transactions on Programming Languages and Systems, 27(6):1097–1146, November 2005. doi: 10.1145/1108970.1108972
. 284, 319, 320, 480
David A. Barrett and Benjamin Zorn. Garbage collection using a dynamic threatening boundary. In ACM SIGPLAN Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995, pages 301–314. ACM SIGPLAN Notices 30( 6), ACM Press. doi: 10.1145/207110.207164
. 123
David A. Barrett and Benjamin G. Zorn. Using lifetime predictors to improve memory allocation performance. In PLDI 1993, pages 187–196. doi: 10.1145/155090.155108
. 114
Joel F. Bartlett. Compacting garbage collection with ambiguous roots. WRL Research Report 88/2, DEC Western Research Laboratory, Palo Alto, CA, February 1988a. http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-88-2.pdf
. Also appears as Bartlett [1988b]. 30, 104
Joel F. Bartlett. Compacting garbage collection with ambiguous roots. Lisp Pointers, 1(6): 3–12, April 1988b. doi: 10.1145/1317224.1317225
. 436
Joel F. Bartlett. Mostly-Copying garbage collection picks up generations and C++. Technical Note TN–12, DEC Western Research Laboratory, Palo Alto, CA, October 1989a. http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-TN-12.pdf
. 170, 192
Joel F. Bartlett. SCHEME->C: a portable Scheme-to-C compiler. WRL Research Report 89/1, DEC Western Research Laboratory, Palo Alto, CA, January 1989b. http://www.hpl.hp.com/techreports/Compaq-DEC/WRL-89-1.pdf
. 170
George Belotsky. C++ memory management: From fear to triumph. O’Reilly linuxdevcenter.com, July 2003. http://www.linuxdevcenter.com/pub/a/linux/2003/08/07/cpp_mm-3.html
. 3
Mordechai Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3):333–344, July 1984. doi: 10.1145/579.587
. 309
Emery Berger, Kathryn McKinley, Robert Blumofe, and Paul Wilson. Hoard: A scalable memory allocator for multithreaded applications. In 9th International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, MA, November 2000, pages 117–128. ACM SIGPLAN Notices 35(11), ACM Press. doi: 10.1145/356989.357000
. 102
Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, MIT Laboratory for Computer Science, May 1977. doi: 1721.1/16428
. Technical report MIT/LCS/TR–178. 103, 140
Stephen Blackburn and Kathryn S. McKinley. Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. In PLDI 2008, pages 22–32. doi: 10.1145/1375581.1375586
. 30, 100, 152, 153, 154, 159, 186
Stephen Blackburn, Robin Garner, Chris Hoffman, Asjad M. Khan, Kathryn S. McKinley, Rotem Bentzur, Amer Diwan, Daniel Feinberg, Samuel Z. Guyer, Martin Hirzel, Antony Hosking, Maria Jump, Han Lee, J. Eliot B. Moss, Aashish Phansalkar, Darko Stefanović, Thomas VanDrunen, Daniel von Dincklage, and Ben Wiederman. The DaCapo benchmarks: Java benchmarking development and analysis (extended version). Technical report, The DaCapo Group, 2006a. http://dacapobench.org/dacapo-TR-CS-06-01.pdf
. 59, 114, 125
Stephen M. Blackburn and Antony L. Hosking. Barriers: Friend or foe? In ISMM 2004, pages 143–151. doi: 10.1145/1029873.1029891
. 202, 203
Stephen M. Blackburn and Kathryn S. McKinley. In or out? putting write barriers in their place. In ISMM 2002, pages 175–184. doi: 10.1145/512429.512452
. 80
Stephen M. Blackburn and Kathryn S. McKinley. Ulterior reference counting: Fast garbage collection without a long wait. In OOPSLA 2003, pages 344–458. doi: 10.1145/949305.949336
. 49, 55, 60, 61, 108, 157, 158, 159, 322
Stephen M. Blackburn, Sharad Singhai, Matthew Hertz, Kathryn S. McKinley, and J. Eliot B. Moss. Pretenuring for Java. In OOPSLA 2001, pages 342–352. doi: 10.1145/504282.504307
. 110, 132
Stephen M. Blackburn, Richard E. Jones, Kathryn S. McKinley, and J. Eliot B. Moss. Beltway: Getting around garbage collection gridlock. In PLDI 2002, pages 153–164. doi: 10.1145/512529.512548
. 130, 131, 140, 202
Stephen M. Blackburn, Perry Cheng, and Kathryn S. McKinley. Myths and realities: The performance impact of garbage collection. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, June 2004a, pages 25–36. ACM SIGMETRICS Performance Evaluation Review 32(1), ACM Press. doi: 10.1145/1005686.1005693
. 46, 49, 54, 55, 79, 88, 105, 126, 130, 203
Stephen M. Blackburn, Perry Cheng, and Kathryn S. McKinley. Oil and water? High performance garbage collection in Java with MMTk. In 26th International Conference on Software Engineering, Edinburgh, May 2004b, pages 137–146. IEEE Computer Society Press. doi: 10.1109/ICSE.2004.1317436
. 26, 107, 116, 195, 196
Stephen M. Blackburn, Robin Garner, Chriss Hoffman, Asjad M. Khan, Kathryn S. McKinley, Rotem Bentzur, Amer Diwan, Daniel Feinberg, Daniel Frampton, Samuel Z. Guyer, Martin Hirzel, Antony Hosking, Maria Jump, Han Lee, J. Eliot B. Moss, Aashish Phansalkar, Darko Stefanović, Thomas VanDrunen, Daniel von Dincklage, and Ben Wiedermann. The DaCapo benchmarks: Java benchmarking development and analysis. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Portland, OR, October 2006b, pages 169–190. ACM SIGPLAN Notices 41(10), ACM Press. doi: 10.1145/1167473.1167488
. 10
Stephen M. Blackburn, Matthew Hertz, Kathryn S. Mckinley, J. Eliot B. Moss, and Ting Yang. Profile-based pretenuring. ACM Transactions on Programming Languages and Systems, 29(1):1–57, 2007. doi: 10.1145/1180475.1180477
. 110, 132
Bruno Blanchet. Escape analysis for object oriented languages: Application to Java. In OOPSLA 1999, pages 20–34. doi: 10.1145/320384.320387
. 147
Ricki Blau. Paging on an object-oriented personal computer for Smalltalk. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Minneapolis, MN, August 1983, pages 44–54. ACM Press. doi: 10.1145/800040.801394
. Also appears as Technical Report UCB/CSD 83/125, University of California, Berkeley, Computer Science Division (EECS). 50
Guy E. Blelloch and Perry Cheng. On bounding time and space for multiprocessor garbage collection. In PLDI 1999, pages 104–117. doi: 10.1145/301618.301648
. 256, 289, 292, 377, 378, 379, 380, 381, 382, 383, 384, 385, 391, 404, 406, 474, 483
Daniel G. Bobrow. Managing re-entrant structures using reference counts. ACM Transactions on Programming Languages and Systems, 2(3):269–273, July 1980. doi: 10.1145/357103.357104
. 67
Hans-Juergen Boehm. Mark-sweep vs. copying collection and asymptotic complexity, September 1995. http://www.hboehm.info/gc/complexity.html
. 26
Hans-Juergen Boehm. Reducing garbage collector cache misses. In ISMM 2000, pages 59–64. doi: 10.1145/362422.362438
. 23, 27
Hans-Juergen Boehm. Destructors, finalizers, and synchronization. In POPL 2003, pages 262–272. doi: 10.1145/604131.604153
. 218, 219, 221
Hans-Juergen Boehm. The space cost of lazy reference counting. In 31st Annual ACM Symposium on Principles of Programming Languages, Venice, Italy, January 2004, pages 210–219. ACM SIGPLAN Notices 39(1), ACM Press. doi: 10.1145/604131.604153
. 59, 60
Hans-Juergen Boehm. Space efficient conservative garbage collection. In PLDI 1993, pages 197–206. doi: 10.1145/155090.155109
. 105, 168
Hans-Juergen Boehm and Sarita V. Adve. Foundations of the C++ concurrency memory model. In PLDI 2008, pages 68–78. doi: 10.1145/1375581.1375591
. 346
Hans-Juergen Boehm and Mike Spertus. Garbage collection in the next C++ standard. In ISMM 2009, pages 30–38. doi: 10.1145/1542431.1542437
. 3, 4
Hans-Juergen Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software: Practice and Experience, 18(9):807–820, 1988. doi: 10.1002/spe.4380180902
. 22, 23, 31, 79, 94, 95, 96, 104, 137, 163, 166, 209, 280
Hans-Juergen Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In PLDI 1991, pages 157–164. doi: 10.1145/113445.113459
. 202, 315, 316, 318, 323, 326, 472
Michael Bond and Kathryn McKinley. Tolerating memory leaks. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Nashville, TN, October 2008, pages 109–126. ACM SIGPLAN Notices 43(10), ACM Press. doi: 10.1145/1449764.1449774
. 208
Tim Brecht, Eshrat Arjomandi, Chang Li, and Hang Pham. Controlling garbage collection and heap growth to reduce the execution time of Java applications. In OOPSLA 2001, pages 353–366. doi: 10.1145/504282.504308
. 209
Tim Brecht, Eshrat Arjomandi, Chang Li, and Hang Pham. Controlling garbage collection and heap growth to reduce the execution time of Java applications. ACM Transactions on Programming Languages and Systems, 28(5):908–941, September 2006. doi: 10.1145/1152649.1152652
. 209
R. P. Brent. Efficient implementation of the first-fit strategy for dynamic storage allocation. ACM Transactions on Programming Languages and Systems, 11(3):388–403, July 1989. doi: 10.1145/65979.65981
. 139
Rodney A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In LFP 1984, pages 256–262. doi: 10.1145/800055.802042
. 340, 341, 347, 361, 386, 404, 405
David R. Brownbridge. Cyclic reference counting for combinator machines. In Jean-Pierre Jouannaud, editor, Conference on Functional Programming and Computer Architecture, Nancy, France, September 1985, pages 273–288. Volume 201 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-15975-4_42
. 67
F. Warren Burton. A buddy system variation for disk storage allocation. Communications of the ACM, 19(7):416–417, July 1976. doi: 10.1145/360248.360259
. 96
Albin M. Butters. Total cost of ownership: A comparison of C/C++ and Java. Technical report, Evans Data Corporation, June 2007. http://costkiller.net/tribune/Tribu-PDF/Total-Cost-of-Ownership-A-Comparison-of-C-Cplusplus-and-Java.pdf
. 1, 4
Brad Calder, Chandra Krintz, S. John, and T. Austin. Cache-conscious data placement. In 8th International Conference on Architectural Support for Programming Languages and Operating Systems, San Jose, CA, October 1998, pages 139–149. ACM SIGPLAN Notices 33(11), ACM Press. doi: 10.1145/291069.291036
. 50
D. C. Cann and Rod R. Oldehoeft. Reference count and copy elimination for parallel applicative computing. Technical Report CS–88–129, Department of Computer Science, Colorado State University, Fort Collins, CO, 1988. 61
Dante Cannarozzi, Michael P. Plezbert, and Ron Cytron. Contaminated garbage collection. In PLDI 2000, pages 264–273. doi: 10.1145/349299.349334
. 147
Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, and Greg Nelson. Modula-3 language definition. ACM SIGPLAN Notices, 27(8):15–42, August 1992. doi: 10.1145/142137.142141
. 340
Patrick J. Caudill and Allen Wirfs-Brock. A third-generation Smalltalk-80 implementation. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Portland, OR, November 1986, pages 119–130. ACM SIGPLAN Notices 21(11), ACM Press. doi: 10.1145/28697.28709
. 114, 138
CC 2005. 14th International Conference on Compiler Construction, Edinburgh, April 2005. Volume 3443 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/b107108
. 456
Pedro Celis, Per-Åke Larson, and J. Ian Munro. Robin Hood hashing. In 26th Annual Symposium on Foundations of Computer Science, Portland, OR, October 1985, pages 261–288. IEEE Computer Society Press. doi: 10.1109/SFCS.1985.48
. 195
Yang Chang. Garbage Collection for Flexible Hard Real-time Systems. PhD thesis, University of York, 2007. 415
Yang Chang and Andy Wellings. Integrating hybrid garbage collection with dual priority scheduling. In 11th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), August 2005, pages 185–188. IEEE Press, IEEE Computer Society Press. doi: 10.1109/RTCSA.2005.56
. 415
Yang Chang and Andy Wellings. Low memory overhead real-time garbage collection for Java. In 4th International Workshop on Java Technologies for Real-time and Embedded Systems, Paris, France, October 2006a. doi: 10.1145/1167999.1168014
. 415
Yang Chang and Andy Wellings. Garbage collection for flexible hard real-time systems. IEEE Transactions on Computers, 59(8):1063–1075, August 2010. doi: 10.1109/TC.2010.13
. 415
Yang Chang and Andy J. Wellings. Hard real-time hybrid garbage collection with low memory requirements. In 27th IEEE Real-Time Systems Symposium, December 2006b, pages 77–86. doi: 10.1109/RTSS.2006.25
. 415
David R. Chase. Garbage Collection and Other Optimizations. PhD thesis, Rice University, August 1987. doi: 1911/16127
. 104
David R. Chase. Safety considerations for storage allocation optimizations. In PLDI 1988, pages 1–10. doi: 10.1145/53990.53991
. 104
A. M. Cheadle, A. J. Field, and J. Nyström-Persson. A method specialisation and virtualised execution environment for Java. In David Gregg, Vikram Adve, and Brian Bershad, editors, 4th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, Seattle, WA, March 2008, pages 51–60. ACM Press. doi: 10.1145/1346256.1346264
. 170, 341
Andrew M. Cheadle, Anthony J. Field, Simon Marlow, Simon L. Peyton Jones, and R.L While. Non-stop Haskell. In 5th ACM SIGPLAN International Conference on Functional Programming, Montreal, September 2000, pages 257–267. ACM Press. doi: 10.1145/351240.351265
. 170, 171
Andrew M. Cheadle, Anthony J. Field, Simon Marlow, Simon L. Peyton Jones, and Lyndon While. Exploring the barrier to entry — incremental generational garbage collection for Haskell. In ISMM 2004, pages 163–174. doi: 10.1145/1029873.1029893
. 99, 170, 171, 340, 341
Wen-Ke Chen, Sanjay Bhansali, Trishul M. Chilimbi, Xiaofeng Gao, and Weihaw Chuang. Profile-guided proactive garbage collection for locality optimization. In PLDI 2006, pages 332–340. doi: 10.1145/1133981.1134021
. 53
C. J. Cheney. A non-recursive list compacting algorithm. Communications of the ACM, 13 (11):677–8, November 1970. doi: 10.1145/362790.362798
. 43, 44
Perry Cheng and Guy Blelloch. A parallel, real-time garbage collector. In PLDI 2001, pages 125–136. doi: 10.1145/378795.378823
. 7, 187, 289, 290, 304, 377, 382, 384, 474
Perry Cheng, Robert Harper, and Peter Lee. Generational stack collection and profile-driven pretenuring. In ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998, pages 162–173. ACM SIGPLAN Notices 33(5), ACM Press. doi: 10.1145/277650.277718
. 110, 132, 146
Perry Sze-Din Cheng. Scalable Real-Time Parallel Garbage Collection for Symmetric Multiprocessors. PhD thesis, Carnegie Mellon University, September 2001. http://reports-archive.adm.cs.cmu.edu/anon/2001/CMU-CS-01-174.pdf
. SCS Technical Report CMU-CS-01-174. 289, 382, 474
Chen-Yong Cher, Antony L. Hosking, and T.N. Vijaykumar. Software prefetching for mark-sweep garbage collection: Hardware analysis and software redesign. In Shubu Mukherjee and Kathryn S. McKinley, editors, 11th International Conference on Architectural Support for Programming Languages and Operating Systems, Boston, MA, October 2004, pages 199–210. ACM SIGPLAN Notices 39(11), ACM Press. doi: 10.1145/1024393.1024417
. 27, 51
Trishul M. Chilimbi and James R. Larus. Using generational garbage collection to implement cache-conscious data placement. In ISMM 1998, pages 37–48. doi: 10.1145/301589.286865
. 53
Trishul M. Chilimbi, Mark D. Hill, and James R. Larus. Cache-conscious structure layout. In PLDI 1999, pages 1–12. doi: 10.1145/301618.301633
. 50
Hyeonjoong Cho, Chewoo Na, Binoy Ravindran, and E. Douglas Jensen. On scheduling garbage collector in dynamic real-time systems with statistical timing assurances. Real-Time Systems, 36(1–2):23–46, 2007. doi: 10.1007/s11241-006-9011-0
. 415
Hyeonjoong Cho, Binoy Ravindran, and Chewoo Na. Garbage collector scheduling in dynamic, multiprocessor real-time systems. IEEE Transactions on Parallel and Distributed Systems, 20(6):845–856, June 2009. doi: 10.1109/TPDS.2009.20
. 415
Dave Christie, Jae-Woong Chung, Stephan Diestelhorst, Michael Hohmuth, Martin Pohlack, Christof Fetzer, Martin Nowack, Torvald Riegel, Pascal Felber, Patrick Marlier, and Etienne Riviere. Evaluation of AMD’s Advanced Synchronization Facility within a complete transactional memory stack. In European Conference on Computer Systems (EuroSys), 2010, pages 27–40. ACM Press. doi: 10.1145/1755913.1755918
. 271
Douglas W. Clark and C. Cordell Green. An empirical study of list structure in Lisp. Communications of the ACM, 20(2):78–86, February 1977. doi: 10.1145/359423.359427
. 73
Cliff Click, Gil Tene, and Michael Wolf. The Pauseless GC algorithm. In VEE 2005, pages 46–56. doi: 10.1145/1064979.1064988
. 355, 361
Marshall P. Cline and Greg A. Lomow. C++ FAQs: Frequently Asked Questions. Addison-Wesley, 1995. 3
William D. Clinger and Lars T. Hansen. Generational garbage collection and the radioactive decay model. In PLDI 1997, pages 97–108. doi: 10.1145/258915.258925
. 128
Jacques Cohen and Alexandru Nicolau. Comparison of compacting algorithms for garbage collection. ACM Transactions on Programming Languages and Systems, 5(4): 532–553, 1983. doi: 10.1145/69575.357226
. 34
George E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655–657, December 1960. doi: 10.1145/367487.367501
. xxiii, 2, 57
W. T. Comfort. Multiword list items. Communications of the ACM, 7(6):357–362, June 1964. doi: 10.1145/512274.512288
. 94
Eric Cooper, Scott Nettles, and Indira Subramanian. Improving the performance of SML garbage collection using application-specific virtual memory management. In LFP 1992, pages 43–52. doi: 10.1145/141471.141501
. 209
Erik Corry. Optimistic stack allocation for Java-like languages. In ISMM 2006, pages 162–173. doi: 10.1145/1133956.1133978
. 147
Jim Crammond. A garbage collection algorithm for shared memory parallel processors. International Journal Of Parallel Programming, 17(6):497–522, 1988. doi: 10.1007/BF01407816
. 299, 300
David Detlefs. Automatic inference of reference-count invariants. In 2nd Workshop on Semantics, Program Analysis, and Computing Environments for Memory Management (SPACE), Venice, Italy, January 2004a. http://www.diku.dk/topps/space2004
. 152
David Detlefs. A hard look at hard real-time garbage collection. In 7th International Symposium on Object-Oriented Real-Time Distributed Computing, Vienna, May 2004b, pages 23–32. IEEE Press. doi: 10.1109/ISORC.2004.1300325
. Invited paper. 377, 385
David Detlefs, William D. Clinger, Matthias Jacob, and Ross Knippel. Concurrent remembered set refinement in generational garbage collection. In 2nd Java Virtual Machine Research and Technology Symposium, San Francisco, CA, August 2002a. USENIX. https://www.usenix.org/conference/java-vm-02/concurrent-remembered-set-refinement-generational-garbage-collection
. 196, 197, 199, 201, 319
David Detlefs, Christine Flood, Steven Heller, and Tony Printezis. Garbage-first garbage collection. In ISMM 2004, pages 37–48. doi: 10.1145/1029873.1029879
. 150, 159
David L. Detlefs. Concurrent garbage collection for C++. Technical Report CMU-CS-90-119, Carnegie Mellon University, Pittsburgh, PA, May 1990. http://repository.cmu.edu/compsci/1956
. 340
David L. Detlefs, Paul A. Martin, Mark Moir, and Guy L. Steele. Lock-free reference counting. In 20th ACM Symposium on Distributed Computing, Newport, Rhode Island, August 2001, pages 190–199. ACM Press. doi: 10.1145/383962.384016
. 365
David L. Detlefs, Paul A. Martin, Mark Moir, and Guy L. Steele. Lock-free reference counting. Distributed Computing, 15:255–271, 2002b. doi: 10.1007/s00446-002-0079-z
. 365
John DeTreville. Experience with concurrent garbage collectors for Modula-2+. Technical Report 64, DEC Systems Research Center, Palo Alto, CA, August 1990. http://www.hpl.hp.com/techreports/Compaq-DEC/SRC-RR-64.pdf
. 338, 340, 366
L. Peter Deutsch and Daniel G. Bobrow. An efficient incremental automatic garbage collector. Communications of the ACM, 19(9):522–526, September 1976. doi: 10.1145/360336.360345
. 61, 105
Sylvia Dieckmann and Urs Hölzle. The allocation behaviour of the SPECjvm98 Java benchmarks. In Rudolf Eigenman, editor, Performance Evaluation and Benchmarking with Realistic Applications, chapter 3, pages 77–108. MIT Press, 2001. 59
Sylvia Dieckmann and Urs Hölzle. A study of the allocation behavior of the SPECjvm98 Java benchmarks. In Rachid Guerraoui, editor, 13th European Conference on Object-Oriented Programming, Lisbon, Portugal, July 1999, pages 92–115. Volume 1628 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-48743-3_5
. 59, 114, 125
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. In Language Hierarchies and Interfaces: International Summer School, volume 46 of Lecture Notes in Computer Science, pages 43–56. Springer-Verlag, Marktoberdorf, Germany, 1976. doi: 10.1007/3-540-07994-7_48
. 12, 20, 309, 315, 316, 323, 472, 473
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): 965–975, November 1978. doi: 10.1145/359642.359655
. 12, 20, 309, 315, 316, 317, 318, 323, 330
Robert Dimpsey, Rajiv Arora, and Kean Kuiper. Java server performance: A case study of building efficient, scalable JVMs. IBM Systems Journal, 39(1):151–174, 2000. doi: 10.1147/sj.391.0151
. 30, 100, 101, 150, 151, 152, 186
Amer Diwan, J. Eliot B. Moss, and Richard L. Hudson. Compiler support for garbage collection in a statically typed language. In PLDI 1992, pages 273–282. doi: 10.1145/143095.143140
. 179, 180, 183, 184
Amer Diwan, David Tarditi, and J. Eliot B. Moss. Memory subsystem performance of programs using copying garbage collection. In POPL 1994, pages 1–14. doi: 10.1145/174675.174710
. 100, 165
Julian Dolby. Automatic inline allocation of objects. In PLDI 1997, pages 7–17. doi: 10.1145/258915.258918
. 148
Julian Dolby and Andrew A. Chien. An automatic object inlining optimization and its evaluation. In PLDI 2000, pages 345–357. doi: 10.1145/349299.349344
. 148
Julian Dolby and Andrew A. Chien. An evaluation of automatic object inline allocation techniques. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vancouver, Canada, October 1998, pages 1–20. ACM SIGPLAN Notices 33(10), ACM Press. doi: 10.1145/286936.286943
. 148
Damien Doligez and Georges Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In POPL 1994, pages 70–83. doi: 10.1145/174675.174673
. 107, 108, 329, 331, 369
Damien Doligez and Xavier Leroy. A concurrent generational garbage collector for a multi-threaded implementation of ML. In 20th Annual ACM Symposium on Principles of Programming Languages, Charleston, SC, January 1993, pages 113–123. ACM Press. doi: 10.1145/158511.158611
. 107, 108, 146, 329
Tamar Domani, Elliot K. Kolodner, and Erez Petrank. A generational on-the-fly garbage collector for Java. In PLDI 2000, pages 274–284. doi: 10.1145/349299.349336
. 330, 331
Tamar Domani, Elliot K. Kolodner, Ethan Lewis, Erez Petrank, and Dafna Sheinwald. Thread-local heaps for Java. In ISMM 2002, pages 76–87. doi: 10.1145/512429.512439
. 109, 110, 146
Kevin Donnelly, Joe Hallett, and Assaf Kfoury. Formal semantics of weak references. In ISMM 2006, pages 126–137. doi: 10.1145/1133956.1133974
. 228
R. Kent Dybvig, Carl Bruggeman, and David Eby. Guardians in a generation-based garbage collector. In PLDI 1993, pages 207–216. doi: 10.1145/155090.155110
. 220
ECOOP 2007, Erik Ernst, editor. 21st European Conference on Object-Oriented Programming, Berlin, Germany, July 2007. Volume 4609 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-73589-2
. 445, 466
Daniel R. Edelson. Smart pointers: They’re smart, but they’re not pointers. In USENIX C++ Conference, Portland, OR, August 1992. USENIX. 59, 74
Toshio Endo, Kenjiro Taura, and Akinori Yonezawa. A scalable mark-sweep garbage collector on large-scale shared-memory machines. In ACM/IEEE Conference on Supercomputing, San Jose, CA, November 1997. doi: 10.1109/SC.1997.10059
. 249, 277, 280, 281, 283, 289, 299, 304, 480
A. P. Ershov. On programming of arithmetic operations. Communications of the ACM, 1(8): 3–6, August 1958. doi: 10.1145/368892.368907
. 169
Shahrooz Feizabadi and Godmar Back. Java garbage collection scheduling in utility accrual scheduling environments. In 3rd International Workshop on Java Technologies for Real-time and Embedded Systems (JTRES), San Diego, CA, 2005. http://people.cs.vt.edu/~gback/papers/jtres2005-cadus.pdf
. 415
Shahrooz Feizabadi and Godmar Back. Garbage collection-aware sheduling utility accrual scheduling environments. Real-Time Systems, 36(1–2), July 2007. doi: 10.1007/s11241-007-9020-7
. 415
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. doi: 10.1145/363269.363280
. 43, 44, 50, 107
Stephen J. Fink and Feng Qian. Design, implementation and evaluation of adaptive recompilation with on-stack replacement. In 1st International Symposium on Code Generation and Optimization (CGO), San Francisco, CA, March 2003, pages 241–252. IEEE Computer Society Press. doi: 10.1109/CGO.2003.1191549
. 190
David A. Fisher. Bounded workspace garbage collection in an address order preserving list processing environment. Information Processing Letters, 3(1):29–32, July 1974. doi: 10.1016/0020-0190 (74) 90044-1
. 36
Robert Fitzgerald and David Tarditi. The case for profile-directed selection of garbage collectors. In ISMM 2000, pages 111–120. doi: 10.1145/362422.362472
. 5, 77, 138, 202
Christine Flood, Dave Detlefs, Nir Shavit, and Catherine Zhang. Parallel garbage collection for shared memory multiprocessors. In JVM 2001. http://www.usenix.org/events/jvm01/flood.html
. 34, 36, 248, 278, 280, 282, 283, 284, 288, 289, 292, 298, 300, 301, 303, 304, 357, 471, 474, 480
John K. Foderaro and Richard J. Fateman. Characterization of VAX Macsyma. In 1981 ACM Symposium on Symbolic and Algebraic Computation, Berkeley, CA, 1981, pages 14–19. ACM Press. doi: 10.1145/800206.806364
. 113
John K. Foderaro, Keith Sklower, Kevin Layer, et al. Franz Lisp Reference Manual. Franz Inc., 1985. 27
Daniel Frampton, David F. Bacon, Perry Cheng, and David Grove. Generational real-time garbage collection: A three-part invention for young objects. In ECOOP 2007, pages 101–125. doi: 10.1007/978-3-540-73589-2_6
. 399
Edward Fredkin. Trie memory. Communications of the ACM, 3(9):490–499, September 1960. doi: 10.1145/367390.367400
. 413
Daniel P. Friedman and David S. Wise. Reference counting can manage the circular environments of mutual recursion. Information Processing Letters, 8(1):41–45, January 1979. doi: 10.1016/0020-0190(79)90091-7
. 66, 67
Robin Garner, Stephen M. Blackburn, and Daniel Frampton. Effective prefetch for mark-sweep garbage collection. In ISMM 2007, pages 43–54. doi: 10.1145/1296907.1296915
. 23, 26, 28, 29
Alex Garthwaite. Making the Trains Run On Time. PhD thesis, University of Pennsylvania, 2005. 194
Alex Garthwaite, Dave Dice, and Derek White. Supporting per-processor local-allocation buffers using lightweight user-level preemption notification. In VEE 2005, pages 24–34. doi: 10.1145/1064979.1064985
. 101, 195
Alexander T. Garthwaite, David L. Detlefs, Antonios Printezis, and Y. Srinivas Ramakrishna. Method and mechanism for finding references in a card in time linear in the size of the card in a garbage-collected heap. United States Patent 7,136,887 B2, Sun Microsystems, November 2006. 200, 201
David Gay and Bjarne Steensgaard. Fast escape analysis and stack allocation for object-based programs. In 9th International Conference on Compiler Construction, Berlin, April 2000, pages 82–93. Volume 2027 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-46423-9_6
. 147, 148
GC 1990, Eric Jul and Niels-Christian Juul, editors. OOPSLA/ECOOP Workshop on Garbage Collection in Object-Oriented Systems, Ottawa, Canada, October 1990. ftp://ftp.cs.utexas.edu/pub/garbage/GC90/
. 449, 465
GC 1991, Paul R. Wilson and Barry Hayes, editors. OOPSLA Workshop on Garbage Collection in Object-Oriented Systems, October 1991. ftp://ftp.cs.utexas.edu/pub/garbage/GC91/
. 449, 466
GC 1993, J. Eliot B. Moss, Paul R. Wilson, and Benjamin Zorn, editors. OOPSLA Workshop on Garbage Collection in Object-Oriented Systems, October 1993. ftp://ftp.cs.utexas.edu/pub/garbage/GC93/
. 448, 449, 465
Andy Georges, Dries Buytaert, and Lieven Eeckhout. Statistically rigorous Java performance evaluation. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Montréal, Canada, October 2007, pages 57–76. ACM SIGPLAN Notices 42(10), ACM Press. doi: 10.1145/1297027.1297033
. 10
Joseph (Yossi) Gil and Itay Maman. Micro patterns in Java code. In OOPSLA 2005, pages 97–116. doi: 10.1145/1094811.1094819
. 132
O. Goh, Yann-Hang Lee, Z. Kaakani, and E. Rachlin. Integrated scheduling with garbage collection for real-time embedded applications in CLI. In 9th International Symposium on Object-Oriented Real-Time Distributed Computing, Gyeongju, Korea, April 2006. IEEE Press. doi: 10.1109/ISORC.2006.41
. 415
Benjamin Goldberg. Tag-free garbage collection for strongly typed programming languages. In PLDI 1991 [PLDI 1991], pages 165–176. doi: 10.1145/113445.113460
. 171, 172
Benjamin Goldberg. Incremental garbage collection without tags. In European Symposium on Programming, Rennes, France, February 1992, pages 200–218. Volume 582 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-55253-7_12
. 171
Benjamin Goldberg and Michael Gloger. Polymorphic type reconstruction for garbage collection without tags. In LFP 1992, pages 53–65. doi: 10.1145/141471.141504
. 171, 172
Marcelo J. R. Gonçalves and Andrew W. Appel. Cache performance of fast-allocating programs. In Conference on Functional Programming and Computer Architecture, La Jolla, CA, June 1995, pages 293–305. ACM Press. doi: 10.1145/224164.224219
. 165
James Gosling, Bill Joy, Guy Steele, Gilad Bracha, and Alex Buckley. The Java Language Specification. Addison Wesley, Java SE 8 edition, February 2015. https://docs.oracle.com/javase/specs/jls/se8/jls8.pdf
. 346
Eiichi Goto. Monocopy and associative algorithms in an extended LISP. Technical Report 74-03, Information Science Laboratories, Faculty of Science, University of Tokyo, 1974. 169
David Gries. An exercise in proving parallel programs correct. Communications of the ACM, 20(12):921–930, December 1977. doi: 10.1145/359897.359903
. 462
Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. Region-based memory management in Cyclone. In PLDI 2002, pages 282–293. doi: 10.1145/512529.512563
. 106
Chris Grzegorczyk, Sunil Soman, Chandra Krintz, and Rich Wolski. Isla Vista heap sizing: Using feedback to avoid paging. In 5th International Symposium on Code Generation and Optimization (CGO), San Jose, CA, March 2007, pages 325–340. IEEE Computer Society Press. doi: 10.1109/CGO.2007.20
. 209
Samuel Guyer and Kathryn McKinley. Finding your cronies: Static analysis for dynamic object colocation. In OOPSLA 2004, pages 237–250. doi: 10.1145/1028976.1028996
. 110, 132, 143
Robert H. Halstead. Implementation of Multilisp: Lisp on a multiprocessor. In LFP 1984, pages 9–17. doi: 10.1145/800055.802017
. 277, 294
Robert H. Halstead. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems, 7(4):501–538, October 1985. doi: 10.1145/4472.4478
. 277, 338, 342, 345
Lars Thomas Hansen. Older-first Garbage Collection in Practice. PhD thesis, Northeastern University, November 2000. 128
Lars Thomas Hansen and William D. Clinger. An experimental study of renewal-older-first garbage collection. In 7th ACM SIGPLAN International Conference on Functional Programming, Pittsburgh, PA, September 2002, pages 247–258. ACM SIGPLAN Notices 37(9), ACM Press. doi: 10.1145/581478.581502
. 128
David R. Hanson. Storage management for an implementation of SNOBOL4. Software: Practice and Experience, 7(2):179–192, 1977. doi: 10.1002/spe.4380070206
. 41
Tim Harris and Keir Fraser. Language support for lightweight transactions. In OOPSLA 2003, pages 388–402. doi: 10.1145/949305.949340
. 272
Timothy Harris. Dynamic adaptive pre-tenuring. In ISMM 2000, pages 127–136. doi: 10.1145/362422.362476
. 132
Timothy L. Harris, Keir Fraser, and Ian A. Pratt. A practical multi-word compare-and-swap operation. In Dahlia Malkhi, editor, International Conference on Distributed Computing, Toulouse, France, October 2002, pages 265–279. Volume 2508 of Lecture Notes in Computer Science. doi: 10.1007/3-540-36108-1_18
. 406
Pieter H. Hartel. Performance Analysis of Storage Management in Combinator Graph Reduction. PhD thesis, Department of Computer Systems, University of Amsterdam, Amsterdam, 1988. 73
Barry Hayes. Using key object opportunism to collect old objects. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Phoenix, AZ, November 1991, pages 33–46. ACM SIGPLAN Notices 26(11), ACM Press. doi: 10.1145/117954.117957
. 23, 100, 114
Barry Hayes. Finalization in the collector interface. In IWMM 1992, pages 277–298. doi: 10.1007/BFb0017196
. 221
Barry Hayes. Ephemerons: A new finalization mechanism. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Atlanta, GA, October 1997, pages 176–183. ACM SIGPLAN Notices 32(10), ACM Press. doi: 10.1145/263698.263733
. 227
Laurence Hellyer, Richard Jones, and Antony L. Hosking. The locality of concurrent write barriers. In ISMM 2010, pages 83–92. doi: 10.1145/1806651.1806666
. 316
Fergus Henderson. Accurate garbage collection in an uncooperative environment. In ISMM 2002, pages 150–156. doi: 10.1145/512429.512449
. 171
Roger Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund Institute of Technology, July 1998. http://www.dna.lth.se/home/Roger_Henriksson/
. 377, 386, 387, 388, 389, 390, 391, 393, 399
Maurice Herlihy and J. Eliot B Moss. Lock-free garbage collection for multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 3(3):304–311, May 1992. doi: 10.1109/71.139204
. 249, 342, 343, 344, 345, 361
Maurice Herlihy and Nir Shavit. The Art of Multiprocessor Programming. Morgan Kaufman, April 2008. xxiii, 2, 229, 240, 243, 254, 255, 256
Maurice Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3): 463–492, 1990. doi: 10.1145/78969.78972
. 254
Maurice P. Herlihy and J. Eliot B. Moss. Transactional memory: Architectural support for lock-free data structures. In 20th Annual International Symposium on Computer Architecture, San Diego, CA, May 1993, pages 289–300. IEEE Press. doi: 10.1145/165123.165164
. 270, 344
Maurice P. Herlihy, Victor Luchangco, and Mark Moir. The repeat offender problem: A mechanism for supporting dynamic-sized lock-free data structures. In 16th International Symposium on Distributed Computing, Toulouse, France, October 2002, pages 339–353. Volume 2508 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-36108-1_23
. 374
Matthew Hertz. Quantifying and Improving the Performance of Garbage Collection. PhD thesis, University of Massachusetts, September 2006. http://www-cs.canisius.edu/~hertzm/thesis.pdf
. 208
Matthew Hertz and Emery Berger. Quantifying the performance of garbage collection vs. explicit memory management. In OOPSLA 2005, pages 313–326. doi: 10.1145/1094811.1094836
. 30, 55, 79
Matthew Hertz, Yi Feng, and Emery D. Berger. Garbage collection without paging. In Vivek Sarkar and Mary W. Hall, editors, ACM SIGPLAN Conference on Programming Language Design and Implementation, Chicago, IL, June 2005, pages 143–153. ACM SIGPLAN Notices 40(6), ACM Press. doi: 10.1145/1064978.1065028
. 9, 108, 110, 156, 208
Matthew Hertz, Jonathan Bard, Stephen Kane, Elizabeth Keudel, Tongxin Bai, Kirk Kelsey, and Chen Ding. Waste not, want not — resource-based garbage collection in a shared environment. Technical Report TR–951, The University of Rochester, December 2009. doi: 1802/8838
. 210
D. S. Hirschberg. A class of dynamic memory allocation algorithms. Communications of the ACM, 16(10):615–618, October 1973. doi: 10.1145/362375.362392
. 96
Martin Hirzel, Amer Diwan, and Matthew Hertz. Connectivity-based garbage collection. In OOPSLA 2003, pages 359–373. doi: 10.1145/949305.949337
. 143, 144, 158
Urs Hölzle. A fast write barrier for generational garbage collectors. In GC 1993. ftp://ftp.cs.utexas.edu/pub/garbage/GC93/hoelzle.ps
. 197, 198
Antony L Hosking. Portable, mostly-concurrent, mostly-copying garbage collection for multi-processors. In ISMM 2006, pages 40–51. doi: 10.1145/1133956.1133963
. 30, 340
Antony L. Hosking and Richard L. Hudson. Remembered sets can also play cards. In GC 1993. ftp://ftp.cs.utexas.edu/pub/garbage/GC93/hosking.ps
. 201
Antony L. Hosking and J. Eliot B. Moss. Protection traps and alternatives for memory management of an object-oriented language. In 14th ACM Symposium on Operating Systems Principles, Asheville, NC, December 1993, pages 106–119. ACM SIGOPS Operating Systems Review 27(5), ACM Press. doi: 10.1145/168619.168628
. 353
Antony L. Hosking, J. Eliot B. Moss, and Darko Stefanović. A comparative performance evaluation of write barrier implementations. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vancouver, Canada, October 1992, pages 92–109. ACM SIGPLAN Notices 27(10), ACM Press. doi: 10.1145/141936.141946
. 137, 138, 193, 194, 195, 197, 199, 201, 202, 206
Antony L. Hosking, Nathaniel Nystrom, Quintin Cutts, and Kumar Brahnmath. Optimizing the read and write barrier for orthogonal persistence. In Ronald Morrison, Mick J. Jordan, and Malcolm P. Atkinson, editors, 8th International Workshop on Persistent Object Systems (August, 1998), Tiburon, CA, 1999, pages 149–159. Advances in Persistent Object Systems, Morgan Kaufmann. http://hosking.github.io/links/Hosking+1998POS.pdf
. 323
Xianlong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J. Eliot B. Moss, Z. Wang, and Perry Cheng. The garbage collection advantage: Improving program locality. In OOPSLA 2004, pages 69–80. doi: 10.1145/1028976.1028983
. 52, 170
Richard L. Hudson. Finalization in a garbage collected world. In GC 1991. ftp://ftp.cs.utexas.edu/pub/garbage/GC91/hudson.ps
. 221
Richard L. Hudson and Amer Diwan. Adaptive garbage collection for Modula-3 and Smalltalk. In GC 1990. ftp://ftp.cs.utexas.edu/pub/garbage/GC90/Hudson.ps.Z
. 195
Richard L. Hudson and J. Eliot B. Moss. Sapphire: Copying GC without stopping the world. In Joint ACM-ISCOPE Conference on Java Grande, Palo Alto, CA, June 2001, pages 48–57. ACM Press. doi: 10.1145/376656.376810
. 346, 361
Richard L. Hudson and J. Eliot B. Moss. Sapphire: Copying garbage collection without stopping the world. Concurrency and Computation: Practice and Experience, 15(3–5): 223–261, 2003. doi: 10.1002/cpe.712
. 346, 351, 361
Richard L. Hudson and J. Eliot B. Moss. Incremental collection of mature objects. In IWMM 1992, pages 388–403. doi: 10.1007/BFb0017203
. 109, 130, 137, 140, 143, 158, 202, 208
Richard L. Hudson, J. Eliot B. Moss, Amer Diwan, and Christopher F. Weight. A language-independent garbage collector toolkit. Technical Report COINS 91-47, University of Massachusetts, September 1991. https://web.cs.umass.edu/publication/docs/1991/UM-CS-1991-047.pdf
. 118, 138
R. John M. Hughes. A semi-incremental garbage collection algorithm. Software: Practice and Experience, 12(11):1081–1082, November 1982. doi: 10.1002/spe.4380121108
. 25, 26
Akira Imai and Evan Tick. Evaluation of parallel copying garbage collection on a shared-memory multiprocessor. Transactions on Parallel and Distributed Systems, 4(9): 1030–1040, 1993. doi: 10.1109/71.243529
. 294, 295, 296, 297, 304, 474
ISMM 1998, Simon L. Peyton Jones and Richard Jones, editors. 1st International Symposium on Memory Management, Vancouver, Canada, October 1998. ACM SIGPLAN Notices 34(3), ACM Press. doi: 10.1145/286860
. 441, 457, 460
ISMM 2000, Craig Chambers and Antony L. Hosking, editors. 2nd International Symposium on Memory Management, Minneapolis, MN, October 2000. ACM SIGPLAN Notices 36(1), ACM Press. doi: 10.1145/362422
. 438, 445, 447, 458, 462, 463
ISMM 2002, Hans-J. Boehm and David Detlefs, editors. 3rd International Symposium on Memory Management, Berlin, Germany, June 2002. ACM SIGPLAN Notices 38(2 supplement), ACM Press. doi: 10.1145/773146
. 437, 444, 447, 451, 458
ISMM 2004, David F. Bacon and Amer Diwan, editors. 4th International Symposium on Memory Management, Vancouver, Canada, October 2004. ACM Press. doi: 10.1145/1029873
. 437, 440, 442, 451, 456, 459, 461, 466
ISMM 2006, Erez Petrank and J. Eliot B. Moss, editors. 5th International Symposium on Memory Management, Ottawa, Canada, June 2006. ACM Press. doi: 10.1145/1133956
. 442, 444, 449, 454, 460, 461, 466
ISMM 2007, Greg Morrisett and Mooly Sagiv, editors. 6th International Symposium on Memory Management, Montréal, Canada, October 2007. ACM Press. doi: 10.1145/1296907
. 445, 453, 457, 460
ISMM 2008, Richard Jones and Steve Blackburn, editors. 7th International Symposium on Memory Management, Tucson, AZ, June 2008. ACM Press. doi: 10.1145/1375634
. 451, 453, 460
ISMM 2009, Hillel Kolodner and Guy Steele, editors. 8th International Symposium on Memory Management, Dublin, Ireland, June 2009. ACM Press. doi: 10.1145/1542431
. 438, 455, 464
ISMM 2010, Jan Vitek and Doug Lea, editors. 9th International Symposium on Memory Management, Toronto, Canada, June 2010. ACM Press. doi: 10.1145/1806651
. 447, 460
ISMM 2011, Hans Boehm and David Bacon, editors. 10th International Symposium on Memory Management, San Jose, CA, June 2011. ACM Press. doi: 10.1145/1993478
. 463
IWMM 1992, Yves Bekkers and Jacques Cohen, editors. International Workshop on Memory Management, St Malo, France, 17–19 September 1992. Volume 637 of Lecture Notes in Computer Science, Springer. doi: 10.1007/BFb0017181
. 447, 449, 452, 455
IWMM 1995, Henry G. Baker, editor. International Workshop on Memory Management, Kinross, Scotland, 27–29 September 1995. Volume 986 of Lecture Notes in Computer Science, Springer. doi: 10.1007/3-540-60368-9
. 453, 466
Erik Johansson, Konstantinos Sagonas, and Jesper Wilhelmsson. Heap architectures for concurrent languages using message passing. In ISMM 2002, pages 88–99. doi: 10.1145/512429.512440
. 146
Mark S. Johnstone. Non-Compacting Memory Allocation and Real-Time Garbage Collection. PhD thesis, University of Texas at Austin, December 1997. ftp://ftp.cs.utexas.edu/pub/garbage/johnstone-dissertation.ps.gz
. 152
Richard Jones and Chris Ryder. A study of Java object demographics. In ISMM 2008, pages 121–130. doi: 10.1145/1375634.1375652
. 23, 106, 113, 114
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996. http://www.cs.kent.ac.uk/people/staff/rej/gcbook/gcbook.html
. With a chapter on Distributed Garbage Collection by R. Lins. xxiv, xxv, 6, 17, 30, 42, 54, 67, 79, 117, 119, 124, 138, 142, 150, 167
Richard E. Jones and Andy C. King. Collecting the garbage without blocking the traffic. Technical Report 18–04, Computing Laboratory, University of Kent, September 2004. http://www.cs.kent.ac.uk/pubs/2004/1970/
. This report summarises King [2004]. 451
Richard E. Jones and Andy C. King. A fast analysis for thread-local garbage collection with dynamic class loading. In 5th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM), Budapest, September 2005, pages 129–138. IEEE Computer Society Press. doi: 10.1109/SCAM.2005.1
. This is a shorter version of Jones and King [2004]. 107, 109, 145, 146, 159
H. B. M. Jonkers. A fast garbage compaction algorithm. Information Processing Letters, 9(1): 26–30, July 1979. doi: 10.1016/0020-0190(79)90103-0
. 32, 37, 38
Maria Jump, Stephen M. Blackburn, and Kathryn S. McKinley. Dynamic object sampling for pretenuring. In ISMM 2004, pages 152–162. doi: 10.1145/1029873.1029892
. 132
JVM 2001. 1st Java Virtual Machine Research and Technology Symposium, Monterey, CA, April 2001. USENIX. https://www.usenix.org/legacy/event/jvm01/
. 445, 458
Tomas Kalibera. Replicating real-time garbage collector for Java. In 7th International Workshop on Java Technologies for Real-time and Embedded Systems (JTRES), Madrid, Spain, September 2009, pages 100–109. ACM Press. doi: 10.1145/1620405.1620420
. 405
Tomas Kalibera, Filip Pizlo, Antony L. Hosking, and Jan Vitek. Scheduling hard real-time garbage collection. In 30th IEEE Real-Time Systems Symposium, Washington, DC, December 2009, pages 81–92. IEEE Computer Society Press. doi: 10.1109/RTSS.2009.40
. 415
Haim Kermany and Erez Petrank. The Compressor: Concurrent, incremental and parallel compaction. In PLDI 2006, pages 354–363. doi: 10.1145/1133981.1134023
. 38, 39, 202, 302, 352, 361
Taehyoun Kim and Heonshik Shin. Scheduling-aware real-time garbage collection using dual aperiodic servers. In Real-Time and Embedded Computing Systems and Applications, 2004, pages 1–17. Volume 2968 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-24686-2_1
. 415
Taehyoun Kim, Naehyuck Chang, Namyun Kim, and Heonshik Shin. Scheduling garbage collector for embedded real-time systems. In ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), Atlanta, GA, May 1999, pages 55–64. ACM SIGPLAN Notices 34(7), ACM Press. doi: 10.1145/314403.314444
. 415
Taehyoun Kim, Naehyuck Chang, and Heonshik Shin. Bounding worst case garbage collection time for embedded real-time systems. In 6th IEEE Real-Time Technology and Applications Symposium (RTAS), Washington, DC, May/June 2000, pages 46–55. doi: 10.1109/RTTAS.2000.852450
. 415
Taehyoun Kim, Naehyuck Chang, and Heonshik Shin. Joint scheduling of garbage collector and hard real-time tasks for embedded applications. Journal of Systems and Software, 58(3):247–260, September 2001. doi: 10.1016/S0164-1212(01)00042-5
. 415
Andy C. King. Removing Garbage Collector Synchronisation. PhD thesis, Computing Laboratory, The University of Kent at Canterbury, 2004. http://www.cs.kent.ac.uk/pubs/2004/1981/
. 145, 451
Kenneth C. Knowlton. A fast storage allocator. Communications of the ACM, 8(10):623–625, October 1965. doi: 10.1145/365628.365655
. 96
Donald E. Knuth. The Art of Computer Programming, volume I: Fundamental Algorithms. Addison-Wesley, second edition, 1973. 89, 90, 98
David G. Korn and Kiem-Phong Vo. In search of a better malloc. In USENIX Summer Conference, Portland, Oregon, 1985, pages 489–506. USENIX Association. 100, 152
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, Providence, Rhode Island, October 1977, pages 120–131. IEEE Press. doi: 10.1109/SFCS.1977.5
. 326, 329
Michael S. Lam, Paul R. Wilson, and Thomas G. Moher. Object type directed garbage collection to improve locality. In IWMM 1992, pages 404–425. doi: 10.1007/BFb0017204
. 52, 53
Leslie Lamport. Garbage collection with multiple processes: an exercise in parallelism. 1976, pages 50–54. IEEE Press. 326, 327
Bernard Lang and Francis Dupont. Incremental incrementally compacting garbage collection. In Symposium on Interpreters and Interpretive Techniques, St Paul, MN, June 1987, pages 253–263. ACM SIGPLAN Notices 22(7), ACM Press. doi: 10.1145/29650.29677
. 137, 149, 150, 151, 159
LCTES 2003. ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, San Diego, CA, June 2003. ACM SIGPLAN Notices 38(7), ACM Press. doi: 10.1145/780732
. 435, 459
Ho-Fung Leung and Hing-Fung Ting. An optimal algorithm for global termination detection in shared-memory asynchronous multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 8(5):538–543, May 1997. doi: 10.1109/71.598280
. 248, 249
Yossi Levanoni and Erez Petrank. An on-the-fly reference counting garbage collector for Java. In OOPSLA 2001, pages 367–380. doi: 10.1145/504282.504309
. 157, 369
Yossi Levanoni and Erez Petrank. An on-the-fly reference counting garbage collector for Java. ACM Transactions on Programming Languages and Systems, 28(1):1–69, January 2006. doi: 10.1145/1111596.1111597
. 108, 369, 374
Yossi Levanoni and Erez Petrank. A scalable reference counting garbage collector. Technical Report CS–0967, Technion — Israel Institute of Technology, Haifa, Israel, November 1999. http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1999/CS/CS0967
. 63, 331, 369
LFP 1984, Guy L. Steele, editor. ACM Conference on LISP and Functional Programming, Austin, TX, August 1984. ACM Press. doi: 10.1145/800055
. 439, 447, 454, 462
LFP 1992. ACM Conference on LISP and Functional Programming, San Francisco, CA, June 1992. ACM Press. doi: 10.1145/141471
. 442, 446
Henry Lieberman and Carl E. Hewitt. A real-time garbage collector based on the lifetimes of objects. Communications of the ACM, 26(6):419–429, June 1983. doi: 10.1145/358141.358147
. Also report TM–184, Laboratory for Computer Science, MIT, Cambridge, MA, July 1980 and AI Lab Memo 569, 1981. 103, 116
Rafael D. Lins. Cyclic reference counting with lazy mark-scan. Information Processing Letters, 44(4):215–220, 1992. doi: 10.1016/0020-0190(92)90088-D
. Also Computing Laboratory Technical Report 75, University of Kent, July 1990. 72
Boris Magnusson and Roger Henriksson. Garbage collection for control systems. In IWMM 1995, pages 323–342. doi: 10.1007/3-540-60368-9_32
. 386
Jeremy Manson, William Pugh, and Sarita V. Adve. The Java memory model. In 32nd Annual ACM Symposium on Principles of Programming Languages, Long Beach, CA, January 2005, pages 378–391. ACM SIGPLAN Notices 40(1), ACM Press. doi: 10.1145/1040305.1040336
. 346
Sebastien Marion, Richard Jones, and Chris Ryder. Decrypting the Java gene pool: Predicting objects’ lifetimes with micro-patterns. In ISMM 2007, pages 67–78. doi: 10.1145/1296907.1296918
. 110, 132
Simon Marlow, Tim Harris, Roshan James, and Simon L. Peyton Jones. Parallel generational-copying garbage collection with a block-structured heap. In ISMM 2008, pages 11–20. doi: 10.1145/1375634.1375637
. 116, 132, 292, 296, 474
Johannes J. Martin. An efficient garbage compaction algorithm. Communications of the ACM, 25(8):571–581, August 1982. doi: 10.1145/358589.358625
. 38
A. D. Martinez, R. Wachenchauzer, and Rafael D. Lins. Cyclic reference counting with local mark-scan. Information Processing Letters, 34:31–35, 1990. doi: 10.1016/0020-0190(90)90226-N
. 72
John McCarthy. Recursive functions of symbolic expressions and their computation by machine, Part I. Communications of the ACM, 3(4):184–195, April 1960. doi: 10.1145/367177.367199
. xxiii, 2, 18, 29
John McCarthy. History of LISP. In Richard L. Wexelblat, editor, History of Programming Languages I, pages 173–185. ACM Press, 1978. doi: 10.1145/800025.1198360
. xxiii
Bill McCloskey, David F. Bacon, Perry Cheng, and David Grove. Staccato: A parallel and concurrent real-time compacting garbage collector for multiprocessors. IBM Research Report RC24505, IBM Research, 2008. http://researcher.watson.ibm.com/researcher/files/us-groved/rc24504.pdf
. 407, 409
Phil McGachey and Antony L Hosking. Reducing generational copy reserve overhead with fallback compaction. In ISMM 2006, pages 17–28. doi: 10.1145/1133956.1133960
. 126
Phil McGachey, Ali-Reza Adl-Tabatabi, Richard L. Hudson, Vijay Menon, Bratin Saha, and Tatiana Shpeisman. Concurrent GC leveraging transactional memory. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Salt Lake City, UT, February 2008, pages 217–226. ACM Press. doi: 10.1145/1345206.1345238
. 270
Paul E. McKenney and Jack Slingwine. Read-copy update: Using execution history to solve concurrency problems. In 10th IASTED International Conference on Parallel and Distributed Computing and Systems, October 1998. IEEE Computer Society. 374
Maged M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems, 15(6):491–504, June 2004. doi: 10.1109/TPDS.2004.8
. 374
Maged M. Michael and M.L. Scott. Correction of a memory management method for lock-free data structures. Technical Report UR CSD / TR59, University of Rochester, December 1995. doi: 1802/503
. 374
James S. Miller and Guillermo J. Rozas. Garbage collection is fast, but a stack is faster. Technical Report AIM-1462, MIT AI Laboratory, March 1994. doi: 1721.1/6622
. 171
David A. Moon. Garbage collection in a large LISP system. In LFP 1984, pages 235–245. doi: 10.1145/800055.802040
. 50, 51, 202, 296
F. Lockwood Morris. A time- and space-efficient garbage compaction algorithm. Communications of the ACM, 21(8):662–5, 1978. doi: 10.1145/359576.359583
. 36, 42, 299
F. Lockwood Morris. On a comparison of garbage collection techniques. Communications of the ACM, 22(10):571, October 1979. 37, 42
F. Lockwood Morris. Another compacting garbage collector. Information Processing Letters, 15(4):139–142, October 1982. doi: 10.1016/0020-0190(82)90094-1
. 37, 38, 42
J. Eliot B. Moss. Working with persistent objects: To swizzle or not to swizzle? IEEE Transactions on Software Engineering, 18(8):657–673, August 1992. doi: 10.1109/32.153378
. 207
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, and Peter F. Sweeney. Producing wrong data without doing anything obviously wrong! In Mary Lou Soffa, editor, 14th International Conference on Architectural Support for Programming Languages and Operating Systems, Seattle, WA, March 2008, pages 265–276. ACM SIGPLAN Notices 43(3), ACM Press. doi: 10.1145/1508244.1508275
. 10
John Nagle. Re: Real-time GC (was Re: Widespread C++ competency gap). USENET comp.lang.c++, January 1995. 4
Scott Nettles and James O’Toole. Real-time replication-based garbage collection. In PLDI 1993, pages 217–226. doi: 10.1145/155090.155111
. 341, 342, 347, 361, 378
Scott M. Nettles, James W. O’Toole, David Pierce, and Nicholas Haines. Replication-based incremental copying collection. In IWMM 1992, pages 357–364. doi: 10.1007/BFb0017201
. 341, 361
Yang Ni, Vijay Menon, Ali-Reza Adl-Tabatabai, Antony L. Hosking, Richard L. Hudson, J. Eliot B. Moss, Bratin Saha, and Tatiana Shpeisman. Open nesting in software transactional memory. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Jose, CA, March 2007, pages 68–78. ACM Press. doi: 10.1145/1229428.1229442
. 272
Gene Novark, Trevor Strohman, and Emery D. Berger. Custom object layout for garbage-collected languages. Technical report, University of Massachusetts, 2006. https://web.cs.umass.edu/publication/docs/2006/UM-CS-2006-007.pdf
. New England Programming Languages and Systems Symposium, March, 2006. 53
Cosmin E. Oancea, Alan Mycroft, and Stephen M. Watt. A new approach to parallelising tracing algorithms. In ISMM 2009, pages 10–19. doi: 10.1145/1542431.1542434
. 262, 263, 264, 265, 298, 304, 305, 474
Takeshi Ogasawara. NUMA-aware memory manager with dominant-thread-based copying GC. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Orlando, FL, October 2009, pages 377–390. ACM SIGPLAN Notices 44(10), ACM Press. doi: 10.1145/1640089.1640117
. 293, 474
OOPSLA 1999. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Denver, CO, October 1999. ACM SIGPLAN Notices 34(10), ACM Press. doi: 10.1145/320384
. 438, 462
OOPSLA 2001. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Tampa, FL, November 2001. ACM SIGPLAN Notices 36(11), ACM Press. doi: 10.1145/504282
. 437, 439, 452
OOPSLA 2002. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Seattle, WA, November 2002. ACM SIGPLAN Notices 37(11), ACM Press. doi: 10.1145/582419
. 460, 466
OOPSLA 2003. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Anaheim, CA, November 2003. ACM SIGPLAN Notices 38(11), ACM Press. doi: 10.1145/949305
. 435, 436, 437, 447, 448, 459
OOPSLA 2004. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vancouver, Canada, October 2004. ACM SIGPLAN Notices 39(10), ACM Press. doi: 10.1145/1028976
. 433, 435, 447, 449, 459
OOPSLA 2005. ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, San Diego, CA, October 2005. ACM SIGPLAN Notices 40(10), ACM Press. doi: 10.1145/1094811
. 446, 448, 465
Yoav Ossia, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, and Avi Owshanko. A parallel, incremental and concurrent GC for servers. In PLDI 2002, pages 129–140. doi: 10.1145/512529.512546
. 284, 285, 288, 296, 304, 480
Yoav Ossia, Ori Ben-Yitzhak, and Marc Segal. Mostly concurrent compaction for mark-sweep GC. In ISMM 2004, pages 25–36. doi: 10.1145/1029873.1029877
. 321, 352
Ivor P. Page and Jeff Hagins. Improving the performance of buddy systems. IEEE Transactions on Computers, C-35(5):441–447, May 1986. doi: 10.1109/TC.1986.1676786
. 96
Krzysztof Palacz, Jan Vitek, Grzegorz Czajkowski, and Laurent Daynès. Incommunicado: efficient communication for isolates. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, Portland, OR, October 1994, pages 262–274. ACM SIGPLAN Notices 29(10), ACM Press. doi: 10.1145/582419.582444
. 107
Stephen K. Park and Keith W. Miller. Random number generators: Good ones are hard to find. Communications of the ACM, 31(10):1192–1201, October 1988. doi: 10.1145/63039.6304
. 194
Harel Paz and Erez Petrank. Using prefetching to improve reference-counting garbage collectors. In 16th International Conference on Compiler Construction, Braga, Portugal, March 2007, pages 48–63. Volume 4420 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-71229-9_4
. 64
Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, and V. T. Rajan. Efficient on-the-fly cycle collection. Technical Report CS–2003–10, Technion University, 2003. http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2003/CS/CS-2003-10
. 369, 370
Harel Paz, Erez Petrank, David F. Bacon, Elliot K. Kolodner, and V.T. Rajan. An efficient on-the-fly cycle collection. In CC 2005, pages 156–171. doi: 10.1007/978-3-540-31985-6_11
. 369
Harel Paz, Erez Petrank, and Stephen M. Blackburn. Age-oriented concurrent garbage collection. In CC 2005, pages 121–136. doi: 10.1007/978-3-540-31985-6_9
. 369
Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, and V. T. Rajan. An efficient on-the-fly cycle collection. ACM Transactions on Programming Languages and Systems, 29 (4):1–43, August 2007. doi: 10.1145/1255450.1255453
. 67, 369, 372, 373
E. J. H. Pepels, M. C. J. D. van Eekelen, and M. J. Plasmeijer. A cyclic reference counting algorithm and its proof. Technical Report 88–10, Computing Science Department, University of Nijmegen, 1988. https://www.cs.ru.nl/~marko/research/pubs/1988/IR88-10CyclicProof-incl-fig.pdf
. 67
James L. Peterson and Theodore A. Norman. Buddy systems. Communications of the ACM, 20(6):421–431, 1977. doi: 10.1145/359605.359626
. 96
Erez Petrank and Elliot K. Kolodner. Parallel copying garbage collection using delayed allocation. Parallel Processing Letters, 14(2):271–286, June 2004. doi: 10.1142/S0129626404001878
. 284, 289
Erez Petrank and Dror Rawitz. The hardness of cache conscious data placement. In Twenty-ninth Annual ACM Symposium on Principles of Programming Languages, Portland, OR, January 2002, pages 101–112. ACM SIGPLAN Notices 37(1), ACM Press. doi: 10.1145/503272.503283
. 49
Pekka P. Pirinen. Barrier techniques for incremental tracing. In ISMM 1998, pages 20–25. doi: 10.1145/286860.286863
. 20, 315, 316, 317, 318
Filip Pizlo and Jan Vitek. Memory management for real-time Java: State of the art. In 11th International Symposium on Object-Oriented Real-Time Distributed Computing, Orlando, FL, 2008, pages 248–254. IEEE Press. doi: 10.1109/ISORC.2008.40
. 377
Filip Pizlo, Daniel Frampton, Erez Petrank, and Bjarne Steensgard. Stopless: A real-time garbage collector for multiprocessors. In ISMM 2007, pages 159–172. doi: 10.1145/1296907.1296927
. 406, 412
Filip Pizlo, Erez Petrank, and Bjarne Steensgaard. A study of concurrent real-time garbage collectors. In PLDI 2008, pages 33–44. doi: 10.1145/1379022.1375587
. 410, 411, 412
Filip Pizlo, Lukasz Ziarek, Ethan Blanton, Petr Maj, and Jan Vitek. High-level programming of embedded hard real-time devices. In 5th European Conference on Computer Systems (EuroSys), Paris, France, April 2010a, pages 69–82. ACM Press. doi: 10.1145/1755913.1755922
. 416
Filip Pizlo, Lukasz Ziarek, Petr Maj, Antony L. Hosking, Ethan Blanton, and Jan Vitek. Schism: Fragmentation-tolerant real-time garbage collection. In ACM SIGPLAN Conference on Programming Language Design and Implementation, Toronto, Canada, June 2010b, pages 146–159. ACM SIGPLAN Notices 45(6), ACM Press. doi: 10.1145/1806596.1806615
. 413, 414, 415, 416
PLDI 1988. ACM SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, June 1988. ACM SIGPLAN Notices 23(7), ACM Press. doi: 10.1145/53990
. 434, 440
PLDI 1991. ACM SIGPLAN Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991. ACM SIGPLAN Notices 26(6), ACM Press. doi: 10.1145/113445
. 439, 446, 465
PLDI 1992. ACM SIGPLAN Conference on Programming Language Design and Implementation, San Francisco, CA, June 1992. ACM SIGPLAN Notices 27(7), ACM Press. doi: 10.1145/143095
. 434, 443
PLDI 1993. ACM SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, NM, June 1993. ACM SIGPLAN Notices 28(6), ACM Press. doi: 10.1145/155090
. 436, 438, 444, 455
PLDI 1997. ACM SIGPLAN Conference on Programming Language Design and Implementation, Las Vegas, NV, June 1997. ACM SIGPLAN Notices 32(5), ACM Press. doi: 10.1145/258915
. 442, 443
PLDI 1999. ACM SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999. ACM SIGPLAN Notices 34(5), ACM Press. doi: 10.1145/301618
. 438, 441, 462
PLDI 2000. ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, Canada, June 2000. ACM SIGPLAN Notices 35(5), ACM Press. doi: 10.1145/349299
. 439, 443, 444, 459
PLDI 2001. ACM SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, UT, June 2001. ACM SIGPLAN Notices 36(5), ACM Press. doi: 10.1145/378795
. 434, 435, 441
PLDI 2002. ACM SIGPLAN Conference on Programming Language Design and Implementation, Berlin, Germany, June 2002. ACM SIGPLAN Notices 37(5), ACM Press. doi: 10.1145/512529
. 437, 446, 455
PLDI 2006, Michael I. Schwartzbach and Thomas Ball, editors. ACM SIGPLAN Conference on Programming Language Design and Implementation, Ottawa, Canada, June 2006. ACM SIGPLAN Notices 41(6), ACM Press. doi: 10.1145/1133981
. 441, 451, 464
PLDI 2008, Rajiv Gupta and Saman P. Amarasinghe, editors. ACM SIGPLAN Conference on Programming Language Design and Implementation, Tucson, AZ, June 2008. ACM SIGPLAN Notices 43(6), ACM Press. doi: 10.1145/1375581
. 437, 438, 457
POPL 1994. 21st Annual ACM Symposium on Principles of Programming Languages, Portland, OR, January 1994. ACM Press. doi: 10.1145/174675
. 443, 444, 463
POPL 2003. 30th Annual ACM Symposium on Principles of Programming Languages, New Orleans, LA, January 2003. ACM SIGPLAN Notices 38(1), ACM Press. doi: 10.1145/604131
. 435, 438
POS 1992, Antonio Albano and Ronald Morrison, editors. 5th International Workshop on Persistent Object Systems (September, 1992), San Miniato, Italy, 1992. Workshops in Computing, Springer. doi: 10.1007/978-1-4471-3209-7
. 461, 466
Tony Printezis. Hot-Swapping between a Mark&Sweep and a Mark&Compact Garbage Collector in a Generational Environment. In JVM 2001. http://www.usenix.org/events/jvm01/printezis.html
. 6, 41, 138
Tony Printezis. On measuring garbage collection responsiveness. Science of Computer Programming, 62(2):164–183, October 2006. doi: 10.1016/j.scico.2006.02.004
. 375, 376, 415
Tony Printezis and David Detlefs. A generational mostly-concurrent garbage collector. In ISMM 2000, pages 143–154. doi: 10.1145/362422.362480
. 23, 151, 326
Tony Printezis and Alex Garthwaite. Visualising the Train garbage collector. In ISMM 2002, pages 100–105. doi: 10.1145/512429.512436
. 22, 73, 143
Feng Qian and Laurie Hendren. An adaptive, region-based allocator for Java. In ISMM 2002, pages 127–138. doi: 10.1145/512429.512446
. Sable Technical Report 2002–1 provides a longer version. 147
Christian Queinnec, Barbara Beaudoing, and Jean-Pierre Queille. Mark DURING Sweep rather than Mark THEN Sweep. In Eddy Odijk, Martin Rem, and Jean-Claude Syre, editors, Parallel Architectures and Languages Europe (PARLE), Eindhoven, The Netherlands, June 1989, pages 224–237. Volume 365 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3540512845_42
. 328
John H. Reppy. A high-performance garbage collector for Standard ML. Technical memorandum, AT&T Bell Laboratories, Murray Hill, NJ, December 1993. http://www.smlnj.org/compiler-notes/93-tr-reppy.ps
. 105, 121, 195, 201
Sven Gestegøard Robertz and Roger Henriksson. Time-triggered garbage collection: Robust and adaptive real-time GC scheduling for embedded systems. In LCTES 2003, pages 93–102. doi: 10.1145/780732.780745
. 415
J. M. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the ACM, 18(3):416–423, July 1971. doi: 10.1145/321650.321658
. 30
J. M. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 21(3):419–499, July 1974. doi: 10.1145/321832.321846
. 30
J. M. Robson. A bounded storage algorithm for copying cyclic structures. Communications of the ACM, 20(6):431–433, June 1977. doi: 10.1145/359605.359628
. 90
J. M. Robson. Storage allocation is NP-hard. Information Processing Letters, 11(3):119–125, November 1980. doi: 10.1016/0020-0190(80)90124-6
. 93
Helena C. C. D. Rodrigues and Richard E. Jones. Cyclic distributed garbage collection with group merger. In Eric Jul, editor, 12th European Conference on Object-Oriented Programming, Brussels, Belgium, July 1998, pages 249–273. Volume 1445 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/BFb0054095
. Also UKC Technical report 17–97, December 1997. 58
Paul Rovner. On adding garbage collection and runtime types to a strongly-typed, statically-checked, concurrent language. Technical Report CSL–84–7, Xerox PARC, Palo Alto, CA, July 1985. http://www.bitsavers.org/pdf/xerox/parc/techReports/CSL-84-7_On_Adding_Garbage_Collection_and_Runtime_Types_to_a_Strongly-Typed_Statically-Checked_Concurrent_Language.pdf
. 4
Erik Ruf. Effective synchronization removal for Java. In PLDI 2000, pages 208–218. doi: 10.1145/349299.349327
. 145
Narendran Sachindran and Eliot Moss. MarkCopy: Fast copying GC with less space overhead. In OOPSLA 2003, pages 326–343. doi: 10.1145/949305.949335
. 154, 155, 159
Narendran Sachindran, J. Eliot B. Moss, and Emery D. Berger. MC2: High-performance garbage collection for memory-constrained environments. In OOPSLA 2004, pages 81–98. doi: 10.1145/1028976.1028984
. 7, 155, 159
Konstantinos Sagonas and Jesper Wilhelmsson. Message analysis-guided allocation and low-pause incremental garbage collection in a concurrent language. In ISMM 2004, pages 1–12. doi: 10.1145/1029873.1029875
. 146
Konstantinos Sagonas and Jesper Wilhelmsson. Efficient memory management for concurrent programs that use message passing. Science of Computer Programming, 62(2): 98–121, October 2006. doi: 10.1016/j.scico.2006.02.006
. 146
Jon D. Salkild. Implementation and analysis of two reference counting algorithms. Master’s thesis, University College, London, 1987. 67
Patrick M. Sansom and Simon L. Peyton Jones. Generational garbage collection for Haskell. In John Hughes, editor, Conference on Functional Programming and Computer Architecture, Copenhagen, Denmark, June 1993, pages 106–116. ACM Press. doi: 10.1145/165180.165195
. 113
Robert A. Saunders. The LISP system for the Q–32 computer. In E. C. Berkeley and Daniel G. Bobrow, editors, The Programming Language LISP: Its Operation and Applications, Cambridge, MA, 1974, pages 220–231. Information International, Inc. http://www.softwarepreservation.org/projects/LISP/book/III_LispBook_Apr66.pdf
. 32
Martin Schoeberl. Scheduling of hard real-time garbage collection. Real-Time Systems, 45 (3):176–213, 2010. doi: 10.1007/s11241-010-9095-4
. 415
Jacob Seligmann and Steffen Grarup. Incremental mature garbage collection using the train algorithm. In Oscar Nierstrasz, editor, 9th European Conference on Object-Oriented Programming, øAarhus, Denmark, August 1995, pages 235–252. Volume 952 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/3-540-49538-X_12
. 143
Robert A. Shaw. Empirical Analysis of a Lisp System. PhD thesis, Stanford University, 1988. Technical Report CSL-TR-88-351. 116, 118, 192, 202
Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew Appel, and Jaswinder Pal Singh. Creating and preserving locality of Java applications at allocation and garbage collection times. In OOPSLA 2002, pages 13–25. doi: 10.1145/582419.582422
. 53
Fridtjof Siebert. Eliminating external fragmentation in a non-moving garbage collector for Java. In Compilers, Architecture, and Synthesis for Embedded Systems (CASES), San Jose, CA, November 2000, pages 9–17. ACM Press. doi: 10.1145/354880.354883
. 385, 412, 415
Fridtjof Siebert. Limits of parallel marking collection. In ISMM 2008, pages 21–29. doi: 10.1145/1375634.1375638
. 276, 277, 303, 480
Fridtjof Siebert. Concurrent, parallel, real-time garbage-collection. In ISMM 2010, pages 11–20. doi: 10.1145/1806651.1806654
. 280, 282, 283, 304, 385, 412, 480
Fridtjof Siebert. Guaranteeing non-disruptiveness and real-time deadlines in an incremental garbage collector. In ISMM 1998, pages 130–137. doi: 10.1145/286860.286874
. 385, 412
Fridtjof Siebert. Hard real-time garbage collection in the Jamaica Virtual Machine. In 6th International Workshop on Real-Time Computing Systems and Applications (RTCSA), Hong Kong, 1999, pages 96–102. IEEE Press, IEEE Computer Society Press. doi: 10.1109/RTCSA.1999.811198
. 182
David Siegwart and Martin Hirzel. Improving locality with parallel hierarchical copying GC. In ISMM 2006, pages 52–63. doi: 10.1145/1133956.1133964
. 52, 295, 296, 297, 304, 474
Jeremy Singer, Gavin Brown, Mikel Lujan, and Ian Watson. Towards intelligent analysis techniques for object pretenuring. In ACM International Symposium on Principles and Practice of Programming in Java, Lisbon, Portugal, September 2007a, pages 203–208. Volume 272 of ACM International Conference Proceeding Series. doi: 10.1145/1294325.1294353
. 80
Jeremy Singer, Gavin Brown, Ian Watson, and John Cavazos. Intelligent selection of application-specific garbage collectors. In ISMM 2007, pages 91–102. doi: 10.1145/1296907.1296920
. 6
Vivek Singhal, Sheetal V. Kakkad, and Paul R. Wilson. Texas: an efficient, portable persistent store. In POS 1992, pages 11–33. doi: 10.1007/978-1-4471-3209-7
. 207
Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):562–686, July 1985. doi: 10.1145/3828.3835
. 92
Patrick Sobalvarro. A lifetime-based garbage collector for Lisp systems on general-purpose computers. Bachelor of Science thesis AITR-1417, MIT AI Lab, February 1988. doi: 1721.1/6795
. 197
Sunil Soman and Chandra Krintz. Efficient and general on-stack replacement for aggressive program specialization. In International Conference on Software Engineering Research and Practice (SERP) & Conference on Programming Languages and Compilers, Volume 2, Las Vegas, NV, June 2006, pages 925–932. CSREA Press. https://www.cs.ucsb.edu/~ckrintz/papers/osr.pdf
. 190
Sunil Soman, Chandra Krintz, and David Bacon. Dynamic selection of application-specific garbage collectors. In ISMM 2004, pages 49–60. doi: 10.1145/1029873.1029880
. 6, 41, 80
Sunil Soman, Laurent Daynès, and Chandra Krintz. Task-aware garbage collection in a multi-tasking virtual machine. In ISMM 2006, pages 64–73. doi: 10.1145/1133956.1133965
. 107
Sunil Soman, Chandra Krintz, and Laurent Daynès. MTM2: Scalable memory management for multi-tasking managed runtime environments. In Jan Vitek, editor, 22nd European Conference on Object-Oriented Programming, Paphos, Cyprus, July 2008, pages 335–361. Volume 5142 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-70592-5_15
. 107
Daniel Spoonhower, Guy Blelloch, and Robert Harper. Using page residency to balance tradeoffs in tracing garbage collection. In VEE 2005, pages 57–67. doi: 10.1145/1064979.1064989
. 149, 150, 152
James W. Stamos. Static grouping of small objects to enhance performance of a paged virtual memory. ACM Transactions on Computer Systems, 2(3):155–180, May 1984. doi: 10.1145/190.194
. 50
James William Stamos. A large object-oriented virtual memory: Grouping strategies, measurements, and performance. Master’s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, April 1982. doi: 1721.1/15807
. 50
Thomas A. Standish. Data Structure Techniques. Addison-Wesley, 1980. 87, 92
Guy L. Steele. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495–508, September 1975. doi: 10.1145/361002.361005
. 229, 315, 316, 330
Guy L. Steele. Corrigendum: Multiprocessing compactifying garbage collection. Communications of the ACM, 19(6):354, June 1976. doi: 10.1145/360238.360247
. 315, 316, 318, 323, 326, 335
Peter Steenkiste. Lisp on a Reduced-Instruction-Set Processor: Characterization and Optimization. PhD thesis, Stanford University, March 1987. Available as Technical Report CSL-TR-87-324. 27
Peter Steenkiste. The impact of code density on instruction cache performance. In 16th Annual International Symposium on Computer Architecture, Jerusalem, Israel, May 1989, pages 252–259. IEEE Press. doi: 10.1145/74925.74954
. 80
Peter Steenkiste and John Hennessy. Lisp on a reduced-instruction-set processor: Characterization and optimization. IEEE Computer, 21(7):34–45, July 1988. doi: 10.1109/2.67
. 27
Bjarne Steensgaard. Thread-specific heaps for multi-threaded programs. In ISMM 2000, pages 18–24. doi: 10.1145/362422.362432
. 107, 145, 146, 159
Darko Stefanović. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, 1999. 128, 157
Darko Stefanović and J. Eliot B. Moss. Characterisation of object behaviour in Standard ML of New Jersey. In ACM Conference on LISP and Functional Programming, Orlando, FL, June 1994, pages 43–54. ACM Press. doi: 10.1145/182409.182428
. 113
Darko Stefanović, Kathryn S. McKinley, and J. Eliot B. Moss. Age-based garbage collection. In OOPSLA 1999, pages 370–381. doi: 10.1145/320384.320425
. 128
Darko Stefanović, Matthew Hertz, Stephen Blackburn, Kathryn McKinley, and J. Eliot Moss. Older-first garbage collection in practice: Evaluation in a Java virtual machine. In Workshop on Memory System Performance, Berlin, Germany, June 2002, pages 25–36. ACM SIGPLAN Notices 38(2 supplement), ACM Press. doi: 10.1145/773146.773042
. 129
V. Stenning. On-the-fly garbage collection. Unpublished notes, cited by Gries [1977], 1976. 315
C. J. Stephenson. New methods of dynamic storage allocation (fast fits). In 9th ACM Symposium on Operating Systems Principles, Bretton Woods, NH, October 1983, pages 30–32. ACM SIGOPS Operating Systems Review 17(5), ACM Press. doi: 10.1145/800217.806613
. 92
James M. Stichnoth, Guei-Yuan Lueh, and Michal Cierniak. Support for garbage collection at every instruction in a Java compiler. In PLDI 1999, pages 118–127. doi: 10.1145/301618.301652
. 179, 180, 181, 188
Will R. Stoye, T. J. W. Clarke, and Arthur C. Norman. Some practical methods for rapid combinator reduction. In LFP 1984, pages 159–166. doi: 10.1145/800055.802032
. 73
Sun Microsystems. Memory management in the Java HotSpot Virtual Machine, April 2006. http://www.oracle.com/technetwork/java/javase/memorymanagement-whitepaper-150215.pdf
. Technical White Paper. 41, 120
H. Sundell. Wait-free reference counting and memory management. In 19th International Parallel and Distributed Processing Symposium (IPDPS), Denver, CO, April 2005. IEEE Computer Society Press. doi: 10.1109/IPDPS.2005.451
. 374
Herb Sutter. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb’s Journal, 30(3), March 2005. http://www.drdobbs.com/web-development/a-fundamental-turn-toward-concurrency-in/184405990
. 275
M. Swanson. An improved portable copying garbage collector. OPnote 86–03, University of Utah, February 1986. 192
M. Tadman. Fast-fit: A new hierarchical dynamic storage allocation technique. Master’s thesis, University of California, Irvine, 1978. 92
David Tarditi. Compact garbage collection tables. In ISMM 2000, pages 50–58. doi: 10.1145/362422.362437
. 179, 180, 181, 182
Gil Tene, Balaji Iyengar, and Michael Wolf. C4: The continuously concurrent compacting collector. In ISMM 2011, pages 79–88. doi: 10.1145/1993478.1993491
. 355
S. P. Thomas, W. T. Charnell, S. Darnell, B. A. A. Dias, P. J. Guthrie, J. P. Kramskoy, J. J. Sexton, M. J. Wynn, K. Rautenbach, and W. Plummer. Low-contention grey object sets for concurrent, marking garbage collection. United States Patent 6925637, 1998. 285, 304
Stephen P. Thomas. The Pragmatics of Closure Reduction. PhD thesis, The Computing Laboratory, University of Kent at Canterbury, October 1993. 170
Stephen P. Thomas. Having your cake and eating it: Recursive depth-first copying garbage collection with no extra stack. Personal communication, May 1995a. 170
Stephen P. Thomas. Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach. Information Processing Letters, 56(1):1–7, October 1995b. doi: 10.1016/0020-0190(95)00131-U
. 170
Stephen P. Thomas and Richard E. Jones. Garbage collection for shared environment closure reducers. Technical Report 31–94, University of Kent and University of Nottingham, December 1994. http://www.cs.kent.ac.uk/pubs/1994/147/
. 170, 190
Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value λ-calculus using a stack of regions. In POPL 1994, pages 188–201. doi: 10.1145/174675.177855
. xxv, 106
Mads Tofte, Lars Birkedal, Martin Elsman, and Niels Hallenberg. A retrospective on region-based memory management. Higher-Order and Symbolic Computation, 17(3): 245–265, September 2004. doi: 10.1023/B:LISP.0000029446.78563.a4
. 148, 159
Tomoharu, Richard Jones, and Carl G. Ritson. Reference object processing in on-the-fly garbage collection. In Samuel Z. Guyer and David Grove, editors, 13th International Symposium on Memory Management, Edinburgh, June 2014, pages 59–69. ACM Press. doi: 10.1145/2602988.2602991
. 223
David A. Turner. A new implementation technique for applicative languages. Software: Practice and Experience, 9:31–49, January 1979. doi: 10.1002/spe.4380090105
. 66
David M. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In ACM/SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, Pittsburgh, PA, April 1984, pages 157–167. ACM SIGPLAN Notices 19(5), ACM Press. doi: 10.1145/800020.808261
. 61, 63, 103, 106, 116, 119, 120, 130
David M. Ungar. The Design and Evaluation of a High Performance Smalltalk System. ACM distinguished dissertation 1986. MIT Press, 1986. 114
David M. Ungar and Frank Jackson. Tenuring policies for generation-based storage reclamation. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, San Diego, CA, November 1988, pages 1–17. ACM SIGPLAN Notices 23(11), ACM Press. doi: 10.1145/62083.62085
. 114, 116, 121, 123, 137, 138, 140
David M. Ungar and Frank Jackson. An adaptive tenuring policy for generation scavengers. ACM Transactions on Programming Languages and Systems, 14(1):1–27, 1992. doi: 10.1145/111186.116734
. 121, 123, 138
Maxime van Assche, Joël Goossens, and Raymond R. Devillers. Joint garbage collection and hard real-time scheduling. Journal of Embedded Computing, 2(3–4):313–326, 2006. http://content.iospress.com/articles/journal-of-embedded-computing/jec00070
. Also published in RTS’05 International Conference on Real-Time Systems, 2005. 415
Martin Vechev. Derivation and Evaluation of Concurrent Collectors. PhD thesis, University of Cambridge, 2007. 331
Martin Vechev, David F. Bacon, Perry Cheng, and David Grove. Derivation and evaluation of concurrent collectors. In Andrew P. Black, editor, 19th European Conference on Object-Oriented Programming, Glasgow, Scotland, July 2005, pages 577–601. Volume 3586 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/11531142_25
. 311, 331
Martin T. Vechev, Eran Yahav, and David F. Bacon. Correctness-preserving derivation of concurrent garbage collection algorithms. In PLDI 2006, pages 341–353. doi: 10.1145/1133981.1134022
. 326, 331
Martin T. Vechev, Eran Yahav, David F. Bacon, and Noam Rinetzky. CGCExplorer: A semi-automated search procedure for provably correct concurrent collectors. In Jeanne Ferrante and Kathryn S. McKinley, editors, ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, CA, June 2007, pages 456–467. ACM SIGPLAN Notices 42(6), ACM Press. doi: 10.1145/1250734.1250787
. 313
VEE 2005, Michael Hind and Jan Vitek, editors. 1st ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, Chicago, IL, June 2005. ACM Press. doi: 10.1145/1064979
. 441, 445, 461
David Vengerov. Modeling, analysis and throughput optimization of a generational garbage collector. In ISMM 2009, pages 1–9. doi: 10.1145/1542431.1542433
. 123
Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 29(4): 229–239, April 1980. doi: 10.1145/358841.358852
. 92
Michal Wegiel and Chandra Krintz. The mapping collector: Virtual memory support for generational, parallel, and concurrent compaction. In Susan J. Eggers and James R. Larus, editors, 13th International Conference on Architectural Support for Programming Languages and Operating Systems, Seattle, WA, March 2008, pages 91–102. ACM SIGPLAN Notices 43(3), ACM Press. doi: 10.1145/1346281.1346294
. 107
J. Weizenbaum. Recovery of reentrant list structures in SLIP. Communications of the ACM, 12(7):370–372, July 1969. doi: 10.1145/363156.363159
. 60
Adam Welc, Suresh Jagannathan, and Antony L. Hosking. Transactional monitors for concurrent objects. In Martin Odersky, editor, 18th European Conference on Object-Oriented Programming, Oslo, Norway, June 2004, pages 519–542. Volume 3086 of Lecture Notes in Computer Science, Springer-Verlag. doi: 10.1007/978-3-540-24851-4_24
. 272
Adam Welc, Suresh Jagannathan, and Antony L. Hosking. Safe futures for Java. In OOPSLA 2005, pages 439–453. doi: 10.1145/1094811.1094845
. 272
Derek White and Alex Garthwaite. The GC interface in the EVM. Technical Report SML TR–98–67, Sun Microsystems Laboratories, December 1998. http://dl.acm.org/ft_gateway.cfm?id=974971&type=pdf
. 118
Jon L. White. Address/memory management for a gigantic Lisp environment, or, GC Considered Harmful. In LISP Conference, Stanford University, CA, August 1980, pages 119–127. ACM Press. doi: 10.1145/800087.802797
. 49, 107
Jon L. White. Three issues in objected-oriented garbage collection. In GC 1990. ftp://ftp.cs.utexas.edu/pub/garbage/GC90/White.ps.Z
. 139
Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David B. Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter P. Puschner, Jan Staschulat, and Per Stenstrøm. The worst-case execution-time problem — overview of methods and survey of tools. ACM Transactions on Embedded Computer Systems, 7(3), April 2008. doi: 10.1145/1347375.1347389
. 415
Jesper Wilhelmsson. Efficient Memory Management for Message-Passing Concurrency — part I: Single-threaded execution. Licentiate thesis, Uppsala University, May 2005. 146
Paul R. Wilson. A simple bucket-brigade advancement mechanism for generation-based garbage collection. ACM SIGPLAN Notices, 24(5):38–46, May 1989. doi: 10.1145/66068.66070
. 116
Paul R. Wilson. Uniprocessor garbage collection techniques. Technical report, University of Texas, January 1994. ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps
. Expanded version of the IWMM92 paper. 3, 310, 312, 314
Paul R. Wilson and Mark S. Johnstone. Truly real-time non-copying garbage collection. In GC 1993. ftp://ftp.cs.utexas.edu/pub/garbage/GC93/wilson.ps
. 139
Paul R. Wilson and Thomas G. Moher. A card-marking scheme for controlling intergenerational references in generation-based garbage collection on stock hardware. ACM SIGPLAN Notices, 24(5):87–92, 1989a. doi: 10.1145/66068.66077
. 197
Paul R. Wilson and Thomas G. Moher. Design of the opportunistic garbage collector. In ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, New Orleans, LA, October 1989b, pages 23–35. ACM SIGPLAN Notices 24(10), ACM Press. doi: 10.1145/74877.74882
. 116, 118, 120, 121, 197
Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Effective “static-graph” reorganization to improve locality in garbage-collected systems. In PLDI 1991, pages 177–191. doi: 10.1145/113445.113461
. 50, 51, 53, 296
Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In IWMM 1995, pages 1–116. doi: 10.1007/3-540-60368-9_19
. 10, 90
Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Memory allocation policies reconsidered. ftp://ftp.cs.utexas.edu/pub/garbage/submit/PUT_IT_HERE/frag.ps
. Unpublished manuscript, 1995b. 96
David S. Wise. The double buddy-system. Computer Science Technical Report TR79, Indiana University, Bloomington, IN, December 1978. https://www.cs.indiana.edu/ftp/techreports/TR79.pdf
. 96
David S. Wise. Stop-and-copy and one-bit reference counting. Computer Science Technical Report 360, Indiana University, March 1993a.https://www.cs.indiana.edu/ftp/techreports/TR360.pdf
. See also Wise [1993b]. 73
David S. Wise. Stop-and-copy and one-bit reference counting. Information Processing Letters, 46(5):243–249, July 1993b.doi: 10.1016/0020-0190(93)90103-G
. 466
David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351–359, 1977. doi: 10.1007/BF01932156
. 73
P. Tucker Withington. How real is “real time” garbage collection? In GC 1991. ftp://ftp.cs.utexas.edu/pub/garbage/GC91/withington.ps
. 104, 140
Mario I. Wolczko and Ifor Williams. Multi-level garbage collection in a high-performance persistent object system. In POS 1992, pages 396–418. doi: 10.1007/978-1-4471-3209-7
. 108
Ming Wu and Xiao-Feng Li. Task-pushing: a scalable parallel GC marking algorithm without synchronization operations. In IEEE International Parallel and Distribution Processing Symposium (IPDPS), Long Beach, CA, March 2007, pages 1–10. doi: 10.1109/IPDPS.2007.370317
. 288, 289, 298, 304, 480
Feng Xian, Witawas Srisa-an, C. Jia, and Hong Jiang. AS-GC: An efficient generational garbage collector for Java application servers. In ECOOP 2007, pages 126–150. doi: 10.1007/978-3-540-73589-2_7
. 107
Ting Yang, Emery D. Berger, Matthew Hertz, Scott F. Kaplan, and J. Eliot B. Moss. Autonomic heap sizing: Taking real memory into account. In ISMM 2004, pages 61–72. doi: 10.1145/1029873.1029881
. 209
Taiichi Yuasa. Real-time garbage collection on general-purpose machines. Journal of Systems and Software, 11(3):181–198, March 1990. doi: 10.1016/0164-1212 (90) 90084-Y
. 316, 317, 318, 323, 326, 378, 472
Karen Zee and Martin Rinard. Write barrier removal by static analysis. In OOPSLA 2002, pages 191–210. doi: 10.1145/582419.582439
. 132, 143, 163, 323
Chengliang Zhang, Kirk Kelsey, Xipeng Shen, Chen Ding, Matthew Hertz, and Mitsunori Ogihara. Program-level adaptive memory management. In ISMM 2006, pages 174–183. doi: 10.1145/1133956.1133979
. 210
W. Zhao, K. Ramamritham, and J. A. Stankovic. Scheduling tasks with resource requirements in hard real-time systems. IEEE Transactions on Software Engineering, SE-13 (5):564–577, May 1987. doi: 10.1109/TSE.1987.233201
. 415
Benjamin Zorn. Barrier methods for garbage collection. Technical Report CU-CS-494-90, University of Colorado, Boulder, November 1990. http://scholar.colorado.edu/csci_techreports/475/
. 124, 125, 323, 393
Benjamin Zorn. The measured cost of conservative garbage collection. Software: Practice and Experience, 23:733–756, 1993. doi: 10.1002/spe.4380230704
. 116
Benjamin G. Zorn. Comparative Performance Evaluation of Garbage Collection Algorithms. PhD thesis, University of California, Berkeley, March 1989. http://www.eecs.berkeley.edu/Pubs/TechRpts/1989/CSD-89-544.pdf
. Technical Report UCB/CSD 89/544. 10, 113