[baba83] Ozalp Babaoglu and Domenico Ferrari. Two-level replacement decisions in paging stores. IEEE Transactions on Computers, C-32(12):1151-1159, December 1983.
[baba93] Ozalp Babaoglu and Keith Marzullo. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In S. Mullender, editor, Distributed Systems, pages 55-96. Addison-Wesley, 1993.
[back83] R.J.R. Back, Heikki Mannila, and Kari-Jouko Räihä. Derivation of efficient DAG marking algorithms. In POPL 1983 [POPL83], 1983, pages 20-27. Available here.
[baco01] 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 [PLDI01], 2001, pages 92-103. Available here.
[baco02] David F. Bacon, Stephen Fink, and David Grove. Space- and time-efficient implementation of the Java object model. In Magnusson [ECOOP02], 2002, pages 111-132. Available here.
[baco03a] 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 [LCTES03], 2003, pages 81-92. Available here.
[baco03b] David F. Bacon, Perry Cheng, and V.T. Rajan. The Metronome: A simpler approach to garbage collection in real-time systems. In On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops, volume 2889 of Lecture Notes in Computer Science, pages 466-478, Catania, Sicily, Italy, November 2003. Springer-Verlag. Available here.
[baco03] David F. Bacon, Perry Cheng, and V.T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In POPL 2003 [POPL03], 2003, pages 285-298. Available here.
[baco04a] David F. Bacon, Perry Cheng, and David Grove. Garbage collection for embedded systems. In International Conference on Embedded Software (EMSOFT'04), pages 125-136. ACM Press, 2004.
[baco04] David F. Bacon, Perry Cheng, and V.T. Rajan. A unified theory of garbage collection. In OOPSLA 2004 [OOPSLA04], 2004, pages 50-68. Available here.
[baco05] David F. Bacon, Perry Cheng, David Grove, and Martin T. Vechev. Syncopation: Generational real-time garbage collection in the Metronome. In LCTES 2005 [LCTES05], 2005, pages 183-192. Available here.
[baco06] David F. Bacon, Perry Cheng, Daniel Frampton, David Grove, Matthias Hauswirth, and V.T. Rajan. On-line visualization and analysis of real-time systems with TuningFork. In CC 2006 [CC06], 2006, pages 96-100. Available here.
[baco12] David F. Bacon, Perry Cheng, and Sunil Shukla. And then there were none: a stall-free real-time garbage collector for reconfigurable hardware. In PLDI 2012 [PLDI12], 2012, pages 23-34. Available here.
[baco12a] David F. Bacon, Perry Cheng, and Sunil Shukla. A stall-free real-time garbage collector for FPGAs. In The Second Workshop on the Intersections of Computer Architecture and Reconfigurable Logic, 2012. Available here.
[baco14] David F. Bacon, Perry Cheng, and Sunil Shukla. Parallel real-time garbage collection of multiple heaps in reconfigurable hardware. In Guyer and Grove [ISMM14], 2014, pages 117-127. Available here.
[baco01a] David F. Bacon and V.T. Rajan. Concurrent cycle collection in reference counted systems. In Knudsen [ECOOP01], 2001, pages 207-235. Available here.
[baco96] David F. Bacon and Peter F. Sweeney. Fast static analysis of C++ virtual function calls. In OOPSLA 1996 [OOPSLA96], 1996, pages 324-34. Available here.
[baco07] David F. Bacon. Real-time garbage collection. ACM Queue, 5(1):40-49, February 2005.
[bade82] Scott B. Baden. High performance reclamation in an object-based memory system. Master's thesis, Computer Science Division, Department of EECS, University of California, Berkeley, June 1982.
[bade83] Scott B. Baden. Low-overhead storage reclamation in the Smalltalk-80 virtual machine. In Krasner [Smalltalk-BHWA], 1983, pages 331-342.
[bade84] Scott B. Baden. High performance storage reclamation in an object-based memory system. CSD 84-167, University of California, Berkeley, 1984.
[baec70] H.D. Baecker. Implementing the Algol-68 heap. BIT, 10(4):405-414, 1970.
[baec72] H.D. Baecker. Garbage collection for virtual memory computer systems. Communications of the ACM, 15(11):981-986, November 1972.
[baec73] H.D. Baecker. Aspects of reference locality in list structures in virtual memory. Software: Practice and Experience, 3(3):245-254, 1973.
[baec75] H.D. Baecker. Areas and record classes. Computer Journal, 18(3):223-226, August 1975.
[baer77] Jean-Loup Baer and M. Fries. On the efficiency of some list marking algorithms. In B. Gilchrist, editor, Information Processing 77, Toronto, pages 751-6. North-Holland, August 1977.
[baer76] Jean-Loup Baer and Gary R. Sager. Dynamic improvement of locality in virtual memory systems. IEEE Transactions on Software Engineering, SE-2(1):54-62, March 1976.
[bagh91] Nader Bagherzadeh, S-l. Heng, and C-l. Wu. A parallel asynchronous garbage collection algorithm for distributed systems. IEEE Transactions on Knowledge and Data Engineering, 3(1):100-107, March 1991.
[bagh87] Nader Bagherzadeh. Distributed Resource Management: Garbage Collection. PhD thesis, University of Texas at Austin, 1987.
[bake85] 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. Available here.
[bake06] Jason Baker, Antonio Cunei, Chapman Flack, Filip Pizlo, Marek Prochazka, Jan Vitek, Austin Armbruster, Edward Pla, and David Holmes. A real-time Java virtual machine for avionics - an experience report. In 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 384-396, San Jose, CA, April 2006. Available here.
[bake07] 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, volume 4420 of Lecture Notes in Computer Science, Braga, Portugal, March 2007. Springer-Verlag. Available here.
[bake09] 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. Supersedes [bake07]. Available here.
[bake77] Henry G. Baker and Carl E. Hewitt. The incremental garbage collection of processes. AI memo 454, MIT Press, December 1977.
[bake77a] Henry G. Baker and Carl E. Hewitt. The incremental garbage collection of processes. ACM SIGPLAN Notices, 12(8):55-59, August 1977. Available here.
[bake92e] C.A. Baker-Finch. Relevance and contraction: A logical basis for strictness and sharing analysis. Submitted to Journal of Functional Programming, 1992.
[bake78a] Henry G. Baker. Actor systems for real-time computation. Technical Report MIT Rep. TR-197, Laboratory for Computer Science, March 1978. Available here.
[bake78] Henry G. Baker. List processing in real-time on a serial computer. Communications of the ACM, 21(4):280-294, 1978. Also AI Laboratory Working Paper 139, 1977. Available here.
[bake79] Henry G. Baker. Optimizing allocation and garbage collection of spaces in MaclLisp. In Winston and Brown, editors, Artificial Intelligence: An MIT Perspective. MIT Press, 1979. Available here.
[bake80] Henry G. Baker. The paging behavior of the Cheney list copying algorithm. Technical report, University of Rochester Computer Science Department, 1980.
[bake89] Henry G. Baker. Garbage collection in Ada. Ada-9X Revision Request 643, Ada Joint Program Office, October 1989.
[bake90] Henry G. Baker. Unify and conquer (garbage, updating, aliasing, ...) in functional languages. In LFP 1990 [LFP90], 1990, pages 218-226. Available here.
[bake91] Henry G. Baker. Cache-conscious copying collection. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.
[bake92] Henry G. Baker. The buried binding and dead binding problems of Lisp 1.5: Sources of incomparability in garbage collector measurements. Lisp Pointers, 4(2):11-19, April 1992. Available here.
[bake92d] Henry G. Baker. CONS should not CONS its arguments, or a lazy alloc is a smart alloc. ACM SIGPLAN Notices, 27(3), March 1992. Available here.
[bake92b] Henry G. Baker. Lively linear Lisp - `look Ma, no garbage!'. ACM SIGPLAN Notices, 27(9):89-98, August 1992. Available here.
[bake92c] Henry G. Baker. NREVERSAL of fortune - thermodynamics of garbage collection. In Bekkers and Cohen [IWMM92], 1992, pages 507-524. Available here.
[bake92a] Henry G. Baker. The Treadmill, real-time garbage collection without motion sickness. ACM SIGPLAN Notices, 27(3):66-70, March 1992. Available here.
[bake93c] Henry G. Baker. The boyer benchmark meets linear logic. Lisp Pointers, 6(4):3-10, October 1993. Available here.
[bake93] Henry G. Baker. `Infant mortality' and generational garbage collection. ACM SIGPLAN Notices, 28(4):55-57, April 1993. Available here.
[bake93b] Henry G. Baker. Safe and leak-proof resource management using Ada83 limited types. ACM Ada Leters, 13(5):32-42, September 1993. Available here.
[bake94] Henry G. Baker. Minimising reference count updating with deferred and anchored pointers for functional data structures. ACM SIGPLAN Notices, 29(9), September 1994. Available here.
[bake95a] Henry G. Baker. CONS should not CONS its arguments, part ii: Cheney on the m.t.a.. ACM SIGPLAN Notices, 30(9), September 1995. Available here.
[bake95] Henry G. Baker. Use-once variables and linear objects - storage management, reflection and multi-threading. ACM SIGPLAN Notices, 30(1), 1995. Available here.
[bake00] Adam Bakewell and Colin Runciman. A model for comparing the space usage of lazy evaluators. In 2nd International Conference on Principles and Practice of Declarative Programming, Montreal, September 2000.
[bake01] Adam Bakewell. Looking for leaks. In SPACE 2001 [SPACE01], 2001. Available here.
[bal92] Henri E. Bal, M. Frans Kaashoek, and Andrew S. Tanenbaum. Orca: A language for parallel programming of distributed systems. ACM Transactions on Software Engineering, 18(3):190-205, 1992.
[bal91] Henri E. Bal and Andrew S. Tanenbaum. Distributed programming with shared data. Computer Languages, 16(2):129-146, 1991.
[bala05] Saisanthosh Balakrishnan, Ravi Rajwar, Mike Upton, and Konrad Lai. The impact of performance asymmetry in emerging multicore architectures. In ISCA 2005 [ISCA05], 2005, pages 506-517. Available here.
[ball92] Thomas Ball and James Larus. Optimal profiling and tracing of programs. In POPL 1992 [POPL92], 1992, pages 59-70. Available here.
[ball83] Stoney Ballard and Stephen Shirron. The design and implementation of VAX/Smalltalk-80. In Krasner [Smalltalk-BHWA], 1983, pages 127-150.
[bana94] R Banach. Term graph rewriting and garbage collection using opfibrations. Theoretical Computer Science, 131(1):29-94, August 1994.
[bane99] A. Banerjee, N. Heintze, and J.G. Riecke. Region analysis and the polymorphic lambda calculus. In 14th IEEE Symposium on Logic in Computer Science, pages 88-97, Trento, Italy, July 1999. IEEE Press. Available here.
[bane20] Subarno Banerjee, David Devecsery, Peter M. Chen, and Satish Narayanasamy. Sound garbage collection for C using pointer provenance. In OOPSLA 2020 [OOPSLA20], 2020.
[bans20] Aman Bansal, Saksham Goel, Preey Shah, Amitabha Sanyal, and Prasanna Kumar. Garbage collection using a finite liveness domain. In Maas and Ding [ISMM20], 2020, pages 1–-15. Available here.
[bara01] Katherine Barabash, N. Buchbinder, Tamar Domani, Elliot Kolodner, Yoav Ossia, S.S. Pinter, J. Shepherd, R.Sivan, and V. Umansky. Mostly accurate stack scanning. In JVM 2001 [JVM01], 2001, pages 153-170. Available here.
[bara03] Katherine Barabash, Yoav Ossia, and Erez Petrank. Mostly concurrent garbage collection revisited. In OOPSLA 2003 [OOPSLA03], 2003, pages 255-268. Available here.
[bara05] 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. Available here.
[bara10] Katherine Barabash and Erez Petrank. Tracing garbage collection on highly parallel platforms. In Vitek and Lea [ISMM10], 2010, pages 1-10. Available here.
[bara82] David R. Barach, David H. Taenzer, and Robert E. Wells. A technique for finding storage allocation errors in C-language programs. ACM SIGPLAN Notices, 17(5):16-23, May 1982.
[bara14] Gergö Barany. Python interpreter performance deconstructed. In Proceedings of the Workshop on Dynamic Languages and Applications, pages 1-–9, Edinburgh, United Kingdom, 2014. ACM Press. Available here.
[barb71] M. Barbacci. A LISP processor for C.ai. Memo CMU-CS-71-103, Carnegie Mellon University, 1971.
[bark86a] Jonas Barklund and Høakan Millroth.Garbage cut. Technical Report 38, Uppsala University, 1986. Available here.
[bark86] Jonas Barklund and Høakan Millroth.Garbage cut for garbage collection of iterative Prolog programs. In Symposium on Logic Programming, pages 276-283, Salt Lake City, UT, September 1986. IEEE Computer Society Press.
[bark87] Jonas Barklund. A garbage collection algorithm for Tricia. Technical Report 37B, Uppsala University, 1987. Available here.
[barn97] Nick Barnes, Richard Brooksby, David Jones, Gavin Matthews, Pekka P. Pirinen, Nick Dalton, and P. Tucker Withington. A proposal for a standard memory management interface. In Dickman and Wilson [OOPSLA97-gc], 1997. Available here.
[barn79] Jeff A. Barnett. Garbage collection versus swapping. ACM SIGOPS Operating Systems Review, 13(3), 1979.
[barr17] Edd Barrett, Carl Friedrich Bolz-Tereick, Rebecca Killick, Sarah Mount, and Laurence Tratt. Virtual machine warmup blows hot and cold. In OOPSLA 2017 [OOPSLA17], 2017, pages 52:1-52:27. Available here.
[barr93a] David A. Barrett and Benjamin Zorn. Garbage collection using a dynamic threatening boundary. Computer Science Technical Report CU-CS-659-93, University of Colorado, July 1993. Available here.
[barr93] David A. Barrett and Benjamin G. Zorn. Using lifetime predictors to improve memory allocation performance. In PLDI 1993 [PLDI93], 1993, pages 187-196. Available here.
[barr95] David A. Barrett and Benjamin Zorn. Garbage collection using a dynamic threatening boundary. In PLDI 1995 [PLDI95], 1995, pages 301-314. Available here.
[barr98] L.A. Barroso, K. Gharachorloo, and E. Bugnion. Memory system characterization of commercial workloads. In ISCA 1998 [ISCA98], 1998, pages 3-14. Available here.
[bart77] Jeffrey M. Barth. Shifting garbage collection overhead to compile time. Communications of the ACM, 20(7):513-518, July 1977.
[bart88] Joel F. Bartlett. Compacting garbage collection with ambiguous roots. WRL Research Report 88/2, DEC Western Research Laboratory, Palo Alto, CA, February 1988. Also appears as [bart88a]. Available here.
[bart88a] Joel F. Bartlett. Compacting garbage collection with ambiguous roots. Lisp Pointers, 1(6):3-12, April 1988. Available here.
[bart89] Joel F. Bartlett. Mostly-Copying garbage collection picks up generations and C++. Technical Note TN-12, DEC Western Research Laboratory, Palo Alto, CA, October 1989. Available here.
[bart89a] Joel F. Bartlett. SCHEME->C: a portable Scheme-to-C compiler. WRL Research Report 89/1, DEC Western Research Laboratory, Palo Alto, CA, January 1989. Available here.
[bart90] Joel F. Bartlett. A generational, compacting collector for C++. In Jul and Juul [OOPSLA90-gc], 1990. Available here.
[basa05] Pablo Basanta-Val, Marisol Garcia-Valls, and I. Estévez-Ayres. Towards distributed garbage collection in distributed real-time Java. In ISORC 2005 [ISORC05], 2005, pages 382-389. Available here.
[basa14] Pablo Basanta-Val and Marisol Garcia-Valls. A simple distributed garbage collector for distributed real-time Java. The Journal of Supercomputing, 12 2014. Available here.
[bast88] F.B. Bastani, S.S. Iyengar, and I.L. Yen. Concurrent maintenance of data-structures in a distributed environment. Computer Journal, 31(2):165-174, 1988.
[bate82] Raymond L. Bates, David Dyer, and Johannes A.G.M. Koomen. Implementation of Interlisp on VAX. In LFP 1982 [LFP82], 1982, pages 81-87. Available here.
[bats77] Alan P. Batson and R.E. Brundage. Segment sizes and lifetimes in ALGOL 60 programs. Communications of the ACM, 20(1):36-44, January 1977.
[bats76] Alan Batson. Program behavior at the symbolic level. IEEE Computer, pages 21-26, November 1976.
[baue82] F.L. Bauer and H. Wössner. Algorithmic Language and Program Development. Springer-Verlag, 1982.
[baum91] K.M. Baumgartner and B.W. Wah. Computer scheduling algorithms - past, present, and future. Information Sciences, pages 319-345, September 1991.
[bawd77] A. Bawden, Richard Greenblatt, J. Holloway, T. Knight, David A. Moon, and D. Weinreb. Lisp machine progress report. Technical Report Memo 444, A.I. Lab, MIT, Cambridge, MA, August 1977.
[bayl00] S.J. Baylor, M. Devarakonda, S. Fink, E. Gluzberg, M. Kalantar, P. Muttineni, E. Barsness, S. Munroe, R. Arora, and R. Dimpsey. Java server benchmarks. IBM Systems Journal, 39(1), 2000.
[bays77] C. Bays. A comparison of next-fit, first-fit and best-fit. Communications of the ACM, 20(3):191-192, March 1977.
[beau91] Barbara Beaudoing. Recycler-en-Marquant: Un Algorithme de Gestion de Mémoire en Temps Réel, Étude et Implantation. PhD thesis, Université de Paris VI, 1991.
[bece03] Yolanda Becerra, Toni Cortes, Jordi Garcia, and Nacho Navarro. Evaluating the importance of virtual memory for Java. In ISPASS 2003 [ISPASS03], 2003, pages 101-110. Available here.
[beck82] Leland L. Beck. A dynamic storage allocation technique based on memory residence time. Communications of the ACM, 25(10):714-724, October 1982.
[beck86] Michael J. Beckerle and Kattamuri Ekanadham. Distributed garbage collection with no global synchronisation. Research Report RC 11667 (#52377), IBM Corp., January 1986.
[beeb01] William S. Beebee, Jr. and Martin Rinard. An implementation of scoped memory for real-time Java. In Henzinger and Kirsch [EMSOFT01], 2001, pages 289-305. Available here.
[beem90] Marcel Beemster. Back-end aspects of a portable POOL-X implementation. In Pierre America, editor, Parallel Database Systems PRISMA Workshop, volume 503 of Lecture Notes in Computer Science, pages 193-228, Noordwijk, The Netherlands, September 1990. Springer-Verlag. Available here.
[beg10] Mirza Beg and Peter van Beek. A graph theoretic approach to cache-conscious placement of data for direct mapped caches. In Vitek and Lea [ISMM10], 2010, pages 113-120. Available here.
[bekk83] Yves Bekkers, B. Canet, Olivier Ridoux, and L. Ungaro. A short note on garbage collection in Prolog interpreters. Logic Programming Newsletter, 5, 1983.
[bekk84] Yves Bekkers, B. Canet, Olivier Ridoux, and L. Ungaro. A memory management machine for Prolog interpreters. In Tärnlund [ICLP84], 1984, pages 343-351.
[bekk85] Yves Bekkers, B. Canet, Olivier Ridoux, and L. Ungaro. A memory management machine for Prolog. Informatique-85, Symposium Soviéto-Français, Tallin, pages 111-117, 1985.
[bekk86] Yves Bekkers, B. Canet, Olivier Ridoux, and L. Ungaro. MALI: A memory with a real-time garbage collector for implementing logic programming languages. In 3rd Symposium on Logic Programming. IEEE Press, 1986.
[bekk92a] Yves Bekkers, Olivier Ridoux, and L. Ungaro. Dynamic memory management for sequential logic programming languages. In Bekkers and Cohen [IWMM92], 1992, pages 82-102. Available here.
[bekk91] Yves Bekkers and L. Ungaro. Implementing parallel garbage collection for Prolog. In A. Voronkov, editor, Russian Conference on Logic Programming, volume 592 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
[bela12] Adam Belay, Andrea Bittau, Ali Mashtizadeh, David Terei, David Mazières, and Christos Kozyrakis. Dune: Safe user-level access to privileged CPU features. In Chandu Thekkath and Amin Vahdat, editors, 10th USENIX Symposium on Operating Systems Design and Implementation, pages 335-348, Hollywood, California, October 2012. Available here.
[belo03] George Belotsky. C++ memory management: From fear to triumph. O'Reilly linuxdevcenter.com, July 2003. Available here.
[bena82] Mordechai Ben-Ari. On-the-fly garbage collection: New algorithms inspired by program proofs. In M. Nielsen and E.M. Schmidt, editors, Automata, languages and programming. Ninth colloquium, pages 14-22, Aarhus, Denmark, July 12-16 1982. Springer-Verlag. Available here.
[bena84] Mordechai Ben-Ari. Algorithms for on-the-fly garbage collection. ACM Transactions on Programming Languages and Systems, 6(3):333-344, July 1984. Available here.
[bend19] Naama Ben-David, Guy E. Blelloch, Yihan Sun, and Yuanhao Wei. Multiversion concurrency with bounded delay and precise garbage collection. In SPAA 2019 [SPAA19], 2019. Available here.
[bend21] Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, and Yuanhao Wei. Space and time bounded multiversion garbage collection. In 35th International Symposium on Distributed Computing (DISC), Freiburg, Germany, October 2021. Available here.
[beny02] Ori Ben-Yitzhak, Irit Goft, Elliot Kolodner, Kean Kuiper, and Victor Leikehman. An algorithm for parallel incremental compaction. In Boehm and Detlefs [ISMM02], 2002, pages 100-105. Available here.
[bend10] Anna Bendersky and Erez Petrank. Space overhead bounds for dynamic memory management with partial compaction. Technical report, Technion, Israel, July 2010. Full version of [bend11]. Available here.
[bend11] Anna Bendersky and Erez Petrank. Space overhead bounds for dynamic memory management with partial compaction. In POPL 2011 [POPL11], 2011, pages 475-486. Available here.
[bend12] Anna Bendersky and Erez Petrank. Space overhead bounds for dynamic memory management with partial compaction. ACM Transactions on Programming Languages and Systems, 34(3):13, 2012. Available here.
[bene81] V.E. Benes. Models and problems of dynamic storage allocation. In Applied Probability and Computer Science - the Interface. Institute of Management Science and Operations Research Society of America, January 1981.
[beng90] Mats Bengtsson and Boris Magnusson. Real-time compacting garbage collection. In Jul and Juul [OOPSLA90-gc], 1990. Available here.
[beng90a] Mats Bengtsson. Real-time compacting garbage collection algorithms. Licentiate thesis, Department of Computer Science, Lund University, 1990.
[benn90] J. Bennet, J. Carter, and W. Zwaenepoel. Munin: Distributed shared memory based on type-specific memory coherence. In PPOPP 1990 [PPoPP90], 1990, pages 168-176.
[benn87] J.K. Bennett. The design and implementation of distributed Smalltalk. In OOPSLA 1987 [OOPSLA87], 1987, pages 318-330. Available here.
[bens97] Peter Benson. The memory manager for the Aurora Java Virtual Machine testbed. In Dickman and Wilson [OOPSLA97-gc], 1997. Available here.
[bent06] Nick Benton and Noah Torp-Smith. Abstracting allocation: The New new thing. In SPACE 2006 [SPACE06], 2006, pages 108-110. Available here.
[berg00] Emery Berger, Kathryn McKinley, Robert Blumofe, and Paul Wilson. Hoard: A scalable memory allocator for multithreaded applications. In ASPLOS 2000 [ASPLOS00], 2000, pages 117-128. Available here.
[berg01] Emery D. Berger, Benjamin G. Zorn, and Kathryn S. McKinley. Composing high-performance memory allocators. In PLDI 2001 [PLDI01], 2001, pages 114-124. Available here.
[berg02] Emery D. Berger, Benjamin G. Zorn, and Kathryn S. McKinley. Reconsidering custom memory allocation. In OOPSLA 2002 [OOPSLA02], 2002. Available here.
[berg99] Emery D. Berger and Robert D. Blumofe. Hoard: A fast, scalable, and memory-efficient allocator for shared-memory multiprocessors. Technical Report UTCS TR99-22, University of Texas at Austin, November 1999. Available here.
[MSPC08] Emery Berger and Brad Chen, editors. Workshop on Memory System Performance and Correctness, Seattle, WA, March 2008. Available here.
[berg88] Steven H. Bergstein. Best-case caching in a symbolic multiprocessor. Bachelor's thesis, Massachusetts Institute of Technology EECS Department, Cambridge, MA, February 1988.
[berk74] E.C. Berkeley and Daniel G. Bobrow, editors. The Programming Language LISP: Its Operation and Applications. Information International, Inc., Cambridge, MA, fourth edition, 1974. Available here.
[berl00] Alexandru Berlea, Sorin Cotofana, Irina Athanasiu, John Glossner, and Stamatis Vassiliadis. Garbage collection for the Delft Java processor. In 18th IASTED International Conference, Applied Informatics, Innsbruck, 2000. Available here.
[bero22] D. Beronić, N. Novosel, B. Mihaljević, and A. Radovan. Assessing contemporary automated memory management in Java - Garbage First, Shenandoah, and Z garbage collectors comparison. In 45th Jubilee International Convention on Information, Communication and Electronic Technology (MIPRO), pages 1495-1500, 2022. Available here.
[berr78] D.M. Berry, L.M. Chirica, J.B. Johnston, D.F. Martin, and Sorkin A. Time required for garbage collection in retention block-structured languages. Journal of Computer Information Science, 7(1):361-404, 1978.
[berr02] Robert F. Berry. The business importance of Java garbage collection. Invited talk., June 2002. Available here.
[berz65] A.T. Bertziss. A note on the storage of strings. Communications of the ACM, 8(8):512-513, August 1965.
[berz75] A.T. Berztiss. Data Structures Theory and Practice. Academic Press, second edition, 1975.
[bess07] Frédéric Besson, Thomas Jensen, and Tiphaine Turpin. Computing stack maps with interfaces. Research report PI 1879, INRIA, Université Rennes I, Institut National des Sciences Appliquées de Rennes, 2007. Available here.
[bess08] Frédéric Besson, Thomas Jensen, and Tiphaine Turpin. Computing stack maps with interfaces. In Vitek [ECOOP08], 2008. Available here.
[bett73] Terry Betteridge. An analytical storage allocation model. Acta Informatica, 3:101-122, 1973.
[bett82] Terry Betteridge. An Algebraic Analysis of Storage Fragmentation. UMI Research Press, Ann Arbor, Michigan, 1982.
[beva87] David I. Bevan. Distributed garbage collection using reference counting. In de Bakker et al. [PARLE87], 1987, pages 176-187. Available here.
[beva88] David I. Bevan. An efficient reference counting solution to the distributed garbage collection problem. Parallel Computing, 9(2):179-192, January 1989. Available here.
[beve94] Johan Bevemyr and Thomas Lindgren. A simple and efficient copying garbage collector for Prolog. In PLILP94 International Symposium on Programming Language Implementation and Logic Programming, pages 88-101, 1994. Available here.
[beve95] Johan Bevemyr. A generational parallel copying garbage collector for shared memory Prolog. Technical Report 117, Uppsala University, October 1995. Available here.
[beye79] Eric Beyer and Peter Buneman. A space efficient dynamic allocation algorithm for queuing messages. ACM Transactions on Programming Languages and Systems, 1(2):287-294, October 1979.
[bhan16] Kumud Bhandari, Dhruva R. Chakrabarti, and Hans-Juergen Boehm. Makalu: Fast recoverable allocation of non-volatile memory. In OOPSLA 2016 [OOPSLA16], 2016, pages 677-694. Available here.
[bhat06] Sapan Bhatia, Charles Consel, and Julia Lawall. Memory-manager/scheduler co-design: Optimizing event-driven servers to improve cache behavior. In Petrank and Moss [ISMM06], 2006, pages 104-114. Available here.
[biag94] Edoardo Biagioni, Robert Harper, Peter Lee, and Brian Milnes. Signatures for a network protocol stack: A systems application of Standard ML. In LFP 1994 [LFP94], 1994. Available here.
[biel99] Richard Bielak and Jean-Pierre Sarkis. Implementing a distributed garbage collector for OO databases. In TOOLS USA '99 Technology of Object-Oriented Languages and Systems, Santa Barbara, CA, August 1999.
[bigl85] B.M. Bigler, S.J. Allan, and Rod R. Oldehoeft. Parallel dynamic storage allocation. In ICPP 1985 [ICPP85], 1985, pages 272-275.
[bili92] Alexandros Biliris. An efficient database storage structure for large dynamic objects. In 8th International Conference on Data Engineering, pages 301-308, Tempe, AZ, February 1992. IEEE Press. Available here.
[bing93] Tim Bingham, Nancy Hobbs, and Dave Husson. Experiences developing and using an object-oriented library for program manipulation. In OOPSLA 1993 [OOPSLA93], 1993. Available here.
[birk96] Lars Birkedal, Mads Tofte, and Magnus Vejlstrup. From region inference to von Neumann machines via region representation inference. In POPL 1996 [POPL96], 1996. Available here.
[birk04] Lars Birkedal, Noah Torp-Smith, and John C. Reynolds. Local reasoning about a copying garbage collector. In POPL 2004 [POPL04], 2004, pages 220-231. Available here.
[birm87] K. Birman. Exploiting virtual synchrony in distributed systems. ACM SIGOPS Operating Systems Review, 21(5):123-138, November 1987.
[birr93] Andrew Birrell, David Evers, Greg Nelson, Susan Owicki, and Edward Wobber. Distributed garbage collection for network objects. Technical Report 116, DEC Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, December 1993. Available here.
[birr94] Andrew Birrell, Greg Nelson, Susan Owicki, and Edward Wobber. Network objects. Technical Report 115, DEC Systems Research Center, Palo Alto, CA, February 1994. Available here.
[birr94a] Andrew Birrell, Greg Nelson, Susan Owicki, and Edward Wobber. Network objects. In 14th ACM SIGOPS Symposium on Operating Systems Principles, pages 217-230, Asheville, NC, December 1994. ACM Press. Available here.
[birr95] Andrew Birrell, Greg Nelson, Susan Owicki, and Edward Wobber. Network objects. Software: Practice and Experience, 25(4):87-130, December 1995. Also appeared as SRC Research Report 115. Available here.
[birr78] Andrew D. Birrell and Roger M. Needham. An asynchronous garbage collector for the CAP filing system. ACM SIGOPS Operating Systems Review, 12(2):31-33, April 1978.
[bish75] Peter B. Bishop. Garbage collection in a very large address space. Working paper 111, AI Laboratory, MIT, Cambridge, MA, September 1975.
[bish77] Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, MIT Laboratory for Computer Science, May 1977. Technical report MIT/LCS/TR-178. Available here.
[bjor89] Anders Björnerstedt. Secondary storage garbage collection for decentralized object-based systems. In D. Tsichritzis, editor, Object Oriented Development, pages 277-319. Centre Universitaire d'Informatique, University of Geneva, July 1989.
[bjor90] Anders Björnerstedt. Secondary Storage Garbage Collection for Decentralized Object-Based Systems. PhD thesis, Royal Institute of Technology and Stockholm University, Sweden, June 1990. Technical Report 77.
[bjor02] Magnus Bjornsson and Liuba Shrira. BuddyCache: High performance object storage for collaborative strong-consistency applications in a WAN. In OOPSLA 2002 [OOPSLA02], 2002. Available here.
[blac86] Andrew Black, Norman Hutchinson, Eric Jul, and Henry Levy. Object structure in the Emerald system. In OOPSLA 1986 [OOPSLA86], 1986, pages 78-86. Available here.
[blac87] Andrew Black, Norman Hutchinson, Eric Jul, Henry Levy, and Larry Carter. Distribution and abstract types in Emerald. ACM Transactions on Software Engineering, 13(1):65-76, January 1987.
[blac01] Stephen M. Blackburn, Sharad Singhai, Matthew Hertz, Kathryn S. McKinley, and J. Eliot B. Moss. Pretenuring for Java. In OOPSLA 2001 [OOPSLA01], 2001, pages 342-352. Available here.
[blac02] Stephen M. Blackburn, Richard E. Jones, Kathryn S. McKinley, and J. Eliot B. Moss. Beltway: Getting around garbage collection gridlock. In PLDI 2002 [PLDI02], 2002, pages 153-164. Available here.
[blac03a] Stephen M. Blackburn, Perry Cheng, and Kathryn S. McKinley. A garbage collection design and bakeoff in JMTk: An extensible Java memory management toolkit. Technical Report TR-CS-03-02, Australian National University, February 2003. Available here.
[blac04] 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, ACM SIGMETRICS Performance Evaluation Review 32(1), pages 25-36. ACM Press, June 2004. Available here.
[blac04a] Stephen M. Blackburn, Perry Cheng, and Kathryn S. McKinley. Oil and water? High performance garbage collection in Java with MMTk. In ICSE 2004 [ICSE04], 2004, pages 137-146. Available here.
[blac06] Stephen M. Blackburn, Robin Garner, Chris 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 OOPSLA 2006 [OOPSLA06], 2006, pages 169-190. Available here.
[blac06a] Stephen M. Blackburn, Robin Garner, Chris Hoffmann, 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 (extended version). Technical report, The DaCapo Group, 2006. Available here.
[blac07] 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. Available here.
[blac08a] S.M. Blackburn, K.S. McKinley, R. Garner, C. Hoffmann, A.M. Khan, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S.Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J.E.B. Moss, A. Phansalkar, D. Stefanović, T. VanDrunen, D. von Dincklage, and B. Wiedermann. Wake up and smell the coffee: Evaluation methodology for the 21st century. Communications of the ACM, 51(8):83-89, 2008. Available here.
[blac16] Stephen M. Blackburn, Amer Diwan, Matthias Hauswirth, Peter F. Sweeney, José Nelson Amaral, Tim Brecht, Lubomr Bulej, Cliff Click, Lieven Eeckhout, Sebastian Fischmeister, Daniel Frampton, Laurie J. Hendren, Michael Hind, Antony L. Hosking, Richard E. Jones, Tomas Kalibera, Nathan Keynes, Nathaniel Nystrom, and Andreas Zeller. The truth, the whole truth, and nothing but the truth: A pragmatic guide to assessing empirical evaluations. ACM Transactions on Programming Languages and Systems, 38(4):15:1-15:20, October 2016. Available here.
[blac04b] Stephen M. Blackburn and Antony L. Hosking. Barriers: Friend or foe?. In Bacon and Diwan [ISMM04], 2004, pages 143-151. Available here.
[blac02a] Stephen M. Blackburn and Kathryn S. McKinley. In or out? putting write barriers in their place. In Boehm and Detlefs [ISMM02], 2002, pages 175-184. Available here.
[blac03] Stephen M. Blackburn and Kathryn S. McKinley. Ulterior reference counting: Fast garbage collection without a long wait. In OOPSLA 2003 [OOPSLA03], 2003, pages 344-458. Available here.
[blac08] Stephen Blackburn and Kathryn S. McKinley. Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. In Gupta and Amarasinghe [PLDI08], 2008, pages 22-32. Available here.
[blac19] Stephen M. Blackburn. Design and analysis of field-logging write barriers. In Xu and Singer [ISMM19], 2019, pages 103-114. Available here.
[blac22] Stephen M. Blackburn. We live in interesting times. Keynote talk, June 2022. Available here.
[blan96] Bruno Blanchet. Garbage collection statique. Dea report, INRIA, Rocquencourt, September 1996.
[blan98] Bruno Blanchet. Escape analysis: Correctness proof, implementation and experimental results. In POPL 1998 [POPL98], 1998, pages 25-37. Available here.
[blan99] Bruno Blanchet. Escape analysis for object oriented languages: Application to Java. In OOPSLA 1999 [OOPSLA99], 1999, pages 20-34. Available here.
[blan03] Bruno Blanchet. Escape analysis for Java: Theory and practice. ACM Transactions on Programming Languages and Systems, 25(6):712-775, November 2003. Available here.
[blau83] Ricki Blau. Paging on an object-oriented personal computer for Smalltalk. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 44-54, Minneapolis, MN, August 1983. ACM Press. Also appears as Technical Report UCB/CSD 83/125, University of California, Berkeley, Computer Science Division (EECS). Available here.
[blel01] Guy E. Blelloch, Perry Cheng, and Phillip B. Gibbons. Room synchronizations. In 13th ACM Symposium on Parallel Algorithms and Architectures, pages 122-133, Heraklion, Crete, Greece, July 2001. ACM Press. Available here.
[blel03] Guy E. Blelloch, Perry Cheng, and Phillip B. Gibbons. Scalable room synchronizations. Theory of Computing Systems, 36(5):397-430, September 2003. Available here.
[blel99] Guy E. Blelloch and Perry Cheng. On bounding time and space for multiprocessor garbage collection. In PLDI 1999 [PLDI99], 1999, pages 104-117. Available here.
[blel20] Guy E. Blelloch and Yuanhao Wei. Concurrent reference counting and resource management in wait-free constant time, 2020. Available here.
[blon97] Xavier Blondel, Paulo Ferreira, and Marc Shapiro. PerDIS PPF case study: Fitting a distributed garbage collection algorithm to a persistent distributed store architecture. In Dickman and Wilson [OOPSLA97-gc], 1997. Available here.
[blon98] Xavier Blondel, Paulo Ferreira, and Marc Shapiro. Implementing garbage collection in the PerDiS system. Submitted for publication, 1998. Available here.
[blon99] Xavier Blondel. Report on the scalability of garbage collection. Technical report, Esprit, 1999. Deliverable TC.1.3-B, PerDiS project. Available here.
[blon00] Xavier Blondel. Gestion de Méta-donneés de la Mémoire dans un Environment Réparti Persistant Transactionnel à Grande Échelle: l'Exemple de PerDiS. PhD thesis, Conservatoire National des Arts et Métiers, September 2000.
[bobr79] Daniel G. Bobrow and Douglas W. Clark. Compact encodings of list structure. ACM Transactions on Programming Languages and Systems, 1(2):266-286, October 1979.
[bobr67] Daniel G. Bobrow and Daniel L. Murphy. Structure of a LISP system using two-level storage. Communications of the ACM, 10(3):155-159, March 1967.
[bobr68b] Daniel G. Bobrow and Daniel L. Murphy. A note on the efficiency of a LISP computation in a paged machine. Communications of the ACM, 11(8):558-560, August 1968.
[bobr64] Daniel G. Bobrow and Bertram Raphael. A comparison of list-processing computer languages. Communications of the ACM, 7(4):231-240, April 1964.
[bobr68a] Daniel G. Bobrow. Storage management in Lisp. Symbol manipulation languages and techniques, 1968.
[bobr75] Daniel G. Bobrow. A note on hash linking. Communications of the ACM, 18(7):413-15, July 1975.
[bobr80] Daniel G. Bobrow. Managing re-entrant structures using reference counts. ACM Transactions on Programming Languages and Systems, 2(3):269-273, July 1980. Available here.
[boeh91] Hans-Juergen Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In PLDI 1991 [PLDI91], 1991, pages 157-164. Available here.
[boeh91b] Hans-Juergen Boehm, Eliot Moss, Joel Bartlett, and David R. Chase. Panel discussion: Conservative vs. accurate garbage collection. In Wilson and Hayes [OOPSLA91-gc], 1991. Summary appears in Wilson and Hayes' OOPSLA'91 GC workshop report. Available here.
[boeh08] Hans-Juergen Boehm and Sarita V. Adve. Foundations of the C++ concurrency memory model. In Gupta and Amarasinghe [PLDI08], 2008, pages 68-78. Available here.
[boeh92] Hans-Juergen Boehm and David R. Chase. A proposal for garbage-collector-safe C compilation. Journal of C Language Translation, 4(2):126-141, December 1992. Available here.
[boeh85] Hans-Juergen Boehm and Alan Demers. Implementing Russell. Technical Report COMP TR85-25, Rice University, 1985.
[boeh88a] Hans-Juergen Boehm and Lucy Hederman. Storage allocation optimization in a compiler for Russell. Submitted for publication, July 1988.
[boeh93a] Hans-Juergen Boehm and Zhong Shao. Inferring type maps during garbage collection. In Moss et al. [OOPSLA93-gc], 1993. Available here.
[boeh05] Hans-Juergen Boehm and Michael Spertus. Transparent garbage collection for C++. Technical Report WG21/N1833=05-0093, ISO/IEC JTC1/SC22/WG21 - The C++ Standards Committee, June 2005. Available here.
[boeh09] Hans-Juergen Boehm and Mike Spertus. Garbage collection in the next C++ standard. In Kolodner and Steele [ISMM09], 2009, pages 30-38. Available here.
[boeh88] Hans-Juergen Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software: Practice and Experience, 18(9):807-820, 1988. Available here.
[boeh91c] Hans-Juergen Boehm. Hardware and operating system support for conservative garbage collection. In Cabrera et al. [IWOOOS91], 1991, pages 61-67.
[boeh91a] Hans-Juergen Boehm. Simple GC-safe compilation. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.
[boeh93] Hans-Juergen Boehm. Space efficient conservative garbage collection. In PLDI 1993 [PLDI93], 1993, pages 197-206. Available here.
[boeh95] Hans-Juergen Boehm. Dynamic memory allocation and garbage collection. Computers in Physics, 9(3):297-303, May/June 1995.
[boeh96] Hans-Juergen Boehm. Simple garbage-collector safety. In PLDI 1996 [PLDI96], 1996, pages 89-98. Available here.
[boeh00tr] Hans-Juergen Boehm. Fast multiprocessor memory allocation and garbage collection. Technical Report HPL-2000-165, HP Laboratories, Palo Alto, December 2000.
[boeh00] Hans-Juergen Boehm. Reducing garbage collector cache misses. In Chambers and Hosking [ISMM2000], 2000, pages 59-64. Available here.
[boeh02] Hans-Juergen Boehm. Bounding space usage of conservative garbage collectors. In POPL 2002 [POPL02], 2002. Available here.
[boeh03] Hans-Juergen Boehm. Destructors, finalizers, and synchronization. In POPL 2003 [POPL03], 2003, pages 262-272. Available here.
[boeh04] Hans-Juergen Boehm. The space cost of lazy reference counting. In POPL 2004 [POPL04], 2004, pages 210-219. Available here.
[bogd99] Jeff Bogda and Urs Hölzle. Removing unnecessary synchronization in Java. In OOPSLA 1999 [OOPSLA99], 1999, pages 35-46. Available here.
[bogd01] Jeff Bogda and Ambuj Singh. Removing unnecessary synchronization in Java. In JVM 2001 [JVM01], 2001. Available here.
[boiz86] P. Boizumault. A general model to implement dif and freeze.In Schapiro [ICLP86], 1986.
[bond06] Michael Bond and Kathryn McKinley. Bell: Bit-encoding online memory leak detection. In Shen and Martonosi [ASPLOS06], 2006, pages 61-72. Available here.
[bond08] Michael Bond and Kathryn McKinley. Tolerating memory leaks. In OOPSLA 2008 [OOPSLA08], 2008, pages 109-126. Available here.
[boqu99] U. Boquist. Code Optimisation Techniques for Lazy Functional Languages. PhD thesis, Chalmers University of Technology, Gothenburg, Sweden, April 1999.
[borg06] Andrew Borg, Andy J. Wellings, Christopher Gill, and Ron K. Cytron. Real-time memory management: Life and times. In 18th Euromicro Conference on Real-Time Systems (ECRTS'06), pages 237-250, Dresden, Germany, July 2006. Available here.
[borg03] Andrew Borg and Andy J. Wellings. Reference objects for RTSJ memory areas. In OTM Workshops 2003, number 2889 in Lecture Notes in Computer Science, pages 397-410, 2003.
[borm02a] Sam Borman. Sensible sanitation - understanding the IBM Java garbage collector, part 1: Object allocation. IBM developerWorks, August 2002. Available here.
[borm02b] Sam Borman. Sensible sanitation - understanding the IBM Java garbage collector, part 2: Garbage collection. IBM developerWorks, August 2002. Available here.
[borm02c] Sam Borman. Sensible sanitation - understanding the IBM Java garbage collector, part 3: verbosegc and command-line. IBM developerWorks, September 2002. Available here.
[born04] Richard Bornat, Cristiano Calcagno, and Peter O'Hearn. Local reasoning, separation, and aliasing. In SPACE 2004 [SPACE04], 2004.
[bott19] Jan Böttcher, Viktor Leis, Thomas Neumann, and Alfons Kemper. Scalable garbage collection for in-memory MVCC systems. Proceedings of the VLDB Endowment, 13(2):128-141, October 2019. Available here.
[bowm93] Howard Bowman, John Derrick, and Richard E. Jones. Modelling garbage collection algorithms. In International Workshop on Concurrency in Computational Logic, City University, London, 13 December 1993, December 1993.
[boya03] Chandrasekhar Boyapati, Alexandru Salcianu, William Beebee, Jr., and Martin Rinard. Ownership types for safe region-based memory management in Real-Time Java. In PLDI 2003 [PLDI03], 2003, pages 324-337. Available here.
[boye72] R.S. Boyer and J.S. Moore. The sharing of structure in theorem-proving programs. In B. Meltzer and Donald Michie, editors, Machine Intelligence, pages 101-116. Edinburgh University Press, 1972.
[boys93] P. Boysen and P. Shah. Reducing object storage requirements in a multi-user environment. Software: Practice and Experience, 23(2):243-253, March 1993.
[bozm84] G. Bozman, W. Buco, T.P. Daly, and W.H. Tetzlaff. Analysis of free storage algorithms - revisited. IBM Systems Journal, 23(1):44-64, 1984.
[bozm84a] Gerald Bozman. The software lookaside buffer reduces search overhead with linked lists. Communications of the ACM, 27(3):222-227, March 1984.
[brab08] Víctor Braberman, Federico Fernández, Diego Garbervetsky, and Sergio Yovine. Parametric prediction of heap memory requirements. In Jones and Blackburn [ISMM08], 2008, pages 141-150. Available here.
[brag13] Anastasia Braginsky, Alex Kogan, and Erez Petrank. Drop the anchor: Lightweight memory management for non-blocking data structures. In SPAA 2013 [SPAA13], 2013, pages 33-42. Available here.
[bran14] Steven R. Brandt, Hari Krishnan, Gokarna Sharma, and Costas Busch. Concurrent, parallel garbage collection in linear time. In Guyer and Grove [ISMM14], 2014, pages 47-58. Available here.
[bran18] Steven R. Brandt, Hari Krishnan, Costas Busch, and Gokarna Sharma. Distributed garbage collection for general graphs. In Payer and Sartor [ISMM18], 2018, pages 29-44. Available here.
[bran71] P. Branquart and J. Lewi. A scheme of storage allocation and garbage collection for Algol-68. In Peck [algol68], 1971, pages 198-238.
[brec01] 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 [OOPSLA01], 2001, pages 353-366. Available here.
[brec06] 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. Available here.
[breg00] Roberto Brega and Gabrio Rivera. Dynamic memory management with garbage collection for embedded applications. In Proc. of the USENIX Workshop on Industrial Experiences with Systems Software (WIESS 2000), San Diego, CA, October 2000. Available here.
[bren89] 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. Available here.
[brio12b] Emmanuel Briot. Gem #100: Reference counting in Ada - part 3: Weak references. SIGADA Ada Letters, 32(2):33-–34, August 2012. Available here.
[brio12] Emmanuel Briot. Gem #97: Reference counting in Ada - part 1. SIGADA Ada Letters, 32(2):24-–27, January 2012. Available here.
[brio12a] Emmanuel Briot. Gem #99: Reference counting in Ada - part 2: task safety. SIGADA Ada Letters, 32(2):31-32, August 2012. Available here.
[bris92] P. Brisset. Compilation de lambdaProlog.PhD thesis, Université de Rennes, 1992.
[brit75] Dianne Ellen Britton. Heap storage management for the programming language Pascal. Master's thesis, University of Arizona, 1975. Available here.
[brob03] Magnus Broberg, Daniel Häggander, Per Lidén, and Lars Lundberg. Improving the performance of multiprocessor memory management in Java. Java Report. To appear. Available here.
[brod04] William Brodie-Tyrrell, Henry Detmold, Katrina E. Falkner, and David S. Munro. Garbage collection for storage-oriented clusters. In Vladimir Estivill-Castro, editor, Australian Computer Science Conference, volume 26 of CRPIT, pages 99-108, Dunedin, New Zealand, January 2004. Australian Computer Society. Available here.
[brom80] A.G. Bromley. Memory fragmentation in buddy methods for dynamic storage allocation. Acta Informatica, 14(2):107-117, August 1980.
[broo82] Rodney A. Brooks, Richard P. Gabriel, and Guy L. Steele. S-1 Common Lisp implementation. In LFP 1982 [LFP82], 1982, pages 108-113. Available here.
[broo83] Rodney A. Brooks, Richard P. Gabriel, and Guy L. Steele. LISP-in-LISP: High performance and portability. In International Joint Conference on Artifical Intelligence, volume 2, pages 845-849. IJCAI, 1983.
[broo84] Rodney A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Steele [LFP84], 1984, pages 256-262. Available here.
[broo02] Richard Brooksby. The Memory Pool System: Thirty person-years of memory management development goes open source. Technical report, Ravenbrook Limited, January 2002. Available here.
[brow84] David R. Brownbridge. Recursive Structures in Computer Systems. PhD thesis, University of Newcastle upon Tyne, September 1984.
[brow85] David R. Brownbridge. Cyclic reference counting for combinator machines. In Jouannaud [FPCA85], 1985, pages 273-288. Available here.
[broy82] Manfred Broy and Peter Pepper. Combining algebraic and algorithmic reasoning: An approach to the Schorr-Waite algorithm. ACM Transactions on Programming Languages and Systems, 4(3):362-381, July 1982.
[bruh87] Ivan Bruha. Representation of structures and garbage collection in McMaster POPLOG. Technical Report 88-01, McMaster University, Department of Computer Science and Systems,Canada, 1987.
[brun17] Rodrigo Bruno, Luís Picciochi Oliveira, and Paulo Ferreira. NG2C: Pretenuring garbage collection with dynamic generations for HotSpot big data applications. In Kirsch and Titzer [ISMM17], 2017, pages 2-13. Available here.
[brun18] Rodrigo Bruno, Paulo Ferreira, Ruslan Synytsky, Tetiana Fydorenchyk, Jia Rao, Hang Huang, and Song Wu. Dynamic vertical memory scalability for OpenJDK cloud applications. In Payer and Sartor [ISMM18], 2018, pages 59-70. Available here.
[brun19] Rodrigo Bruno, Duarte Patricio, José Sim\ ao, Luis Veiga, and Paulo Ferreira. Runtime object lifetime profiler for latency sensitive big data applications. In EuroSys19, pages 1-16, 2019. Available here.
[brun17a] Rodrigo Bruno and Paulo Ferreira. POLM2: Automatic profiling for object lifetime-aware memory management for Hotspot big data applications. In Proceedings of the 18th ACM/IFIP/USENIX Middleware Conference, pages 147-160, Las Vegas, Nevada, 2017. Available here.
[brun18a] Rodrigo Bruno and Paulo Ferreira. A study on garbage collection algorithms for big data environments. ACM Computing Surveys, 51(1):35, January 2018. Available here.
[brun10] Stefan Brunthaler. Efficient interpretation using quickening. In Clinger [DLS10], 2010, pages 1-10. Available here.
[brus87] T. Brus, M.J.C.D. van Eekelen, M.J. Plasmeijer, and H.P. Barendregt. Clean: A language for functional graph rewriting. In Kahn [FPCA87], 1987, pages 364-384. Available here.
[bruy88] Maurice Bruynooghe and G. Janssens. An instance of abstract interpretation integrating type and mode inferencing. In 5th International Conference and Symposium on Logic Programming, pages 669-683. MIT Press, 1988.
[bruy82a] Maurice Bruynooghe. Garbage collection in Prolog implementations. Logic Programming, pages 83-98, 1980. Also in Workshop on Logic Programming, Debrecen, Hungary, 1980.
[bruy82] Maurice Bruynooghe. A note on garbage collection in Prolog interpreters. In ICLP 1982 [ICLP82], 1982, pages 52-55.
[bruy84] Maurice Bruynooghe. Garbage collection in Prolog implementations. In J.A. Campbell, editor, Implementations of Prolog, pages 259-267. Ellis-Horwood, 1984.
[bruy86a] Maurice Bruynooghe. Compile-time garbage collection. Report CW43, Katholieke Universiteit of Leuven, 1986.
[bruy86] Maurice Bruynooghe. Compile-time garbage collection or How to transform programs in an assignment-free language into code with assignments. In L.G.L.T. Meertens, editor, Program specification and transformation. The IFIP TC2/WG 2.1 Working Conference, Bad Tolz, Germany, pages 113-129. North-Holland, Amsterdam, April 15-17, 1986 1987.
[bu13] Yingyi Bu, Vinayak Borkar, Guoqing Xu, and Michael J. Carey. A bloat-aware design for big data applications. In Petrank and Cheng [ISMM13], 2013. Available here.
[budi09] Zoran Budimlic, Aparna M. Chandramowlishwaran, Kathleen Knobe, Geoff N. Lowney, Vivek Sarkar, and Leo Treggiari. Declarative aspects of memory management in the Concurrent Collections parallel programming model. In DAMP 2009: Workshop on Declarative Aspects of Multicore Programming, Savannah, GA, January 2009. Available here.
[bull00] J.M. Bull, L.A. Smith, M.D. Westhead, D.S. Henty, and R.A. Davey. A benchmark suite for high performance Java. Concurrency and Computation: Practice and Experience, 12(6):375-–388, 2000. Available here.
[burd01] Lilian Burdy. B vs. Coq to prove a garbage collector. In R.J. Boulton and P.B. Jackson, editors, 14th International Conference on Theorem Proving in Higher Order Logics: Supplemental Proceedings, pages 85-97, September 2001. Report EDI-INF-RR-0046, Division of Informatics, University of Edinburgh. Available here.
[burg99] Peter Burgess, Nigel Perry, and Robert Pointon. The concurrent Massey Hope+C functional language system. Report, Massey University, 1999. Available on request from Nigel Perry.
[burn87] T.D. Burnett. Parallel reduction architecture. In IFIP WG 10.3 Working Conference for Numerical and Signal Processing Applications on Highly Parallel Computers, pages 41-57, Sophia Antipolis, France, March 1987. North-Holland.
[burt00a] F. Warren Burton and David J. Simpson. Memory requirements for parallel programs. Parallel Computing, 26(13-14):1739-1763, 2000. Available here.
[burt76] F. Warren Burton. A buddy system variation for disk storage allocation. Communications of the ACM, 19(7):416-417, July 1976. Available here.
[burt00] Joshua W. Burton. Garbage collection on the run. Dr. Dobb's Journal, 311:46-53, April 2000.
[butl86] Margaret H. Butler. Storage reclamation for object oriented database systems: a summary of the expected costs. In International Workshop on Object-Oriented Database Systems, pages 210-211, Pacific Grove, CA, September 1986. IEEE Press.
[butl87] Margaret H. Butler. Storage reclamation in object oriented database systems. In ACM SIGMOD International Conference on Management of Data, pages 410-425, San Francisco, CA, May 1987. Available here.
[butt07] Albin M. Butters. Total cost of ownership: A comparison of C/C++ and Java. Technical report, Evans Data Corporation, June 2007. Available here.
[buyt04] Dries Buytaert, Kris Venstermans, Lieven Eeckhout, and Koen De Bosschere. Garbage collection scheduling. In Program Acceleration through Application and Architecture Driven Code Transformations: Symposium Proceedings, pages 47-49, 2004.
[buyt05] Dries Buytaert, Kris Venstermans, Lieven Eeckhout, and Koen De Bosschere. Garbage collection hints. In HiPEAC 2005 International Conference on High Performance Embedded Architectures and Compilers, Barcelona, November 2005. Available here.
[byma18] Stuart Byma and James R. Larus. Detailed heap profiling. In Payer and Sartor [ISMM18], 2018, pages 1-13. Available here.