the Garbage Collection Bibliography

This bibliography may be freely used for non-commercial purposes. It may also be freely distributed provided that this notice is included. I would be most grateful to receive additions, corrections and URLs of electronically available papers. The full bibliography is also available in compressed BibTeX (140k) and PDF forms.

Further GC-related material can be found on the Garbage Collection page.

Richard Jones

Copyright ©1996-2017 Richard Jones

Last updated 4 April 2017.

[A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Y] [Z]


F


[fabr79] Janet Fabri. Automatic storage optimization. In SIGPLAN 1979 [PLDI79], 1979, pages 83-91. Available here.


[faes05] Philippe Faes, Mark Christiaens, Dries Buytaert, and Dirk Stroobandt. FPGA-aware garbage collection in Java. In T. Rissa, S. Wilton, and P. Leong, editors, 2005 International Conference on Field Programmable Logic and Applications (FPL), pages 675-680, Tampere, Finland, 1 2005. IEEE. Available here.


[falc83] J. R. Falcone and J. R. Stinger. The Smalltalk-80 implementation at Hewlett-Packard. In Krasner [Smalltalk-BHWA], 1983, pages 79-112.


[fark00] Keith I. Farkas, Jason Flinn, Godmar Back, Dirk Grunwald, and Jennifer Anderson. Quantifying the energy consumption of a pocket computer and a Java virtual machine. In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2000.


[farr91] Matthew Farrens and Arvin Park. Dynamic base register caching: A technique for reducing address bus width. In ISCA 1991 [ISCA91], 1991, pages 128-137.


[feel90] Marc Feeley and James S. Miller. A parallel virtual machine for efficient Scheme compilation. In LFP 1990 [LFP90], 1990, pages 119-130. Available here.


[feel93] Marc Feeley. Polling efficiently on stock hardware. In Hughes [FPCA93], 1993, pages 179-187. Available here.


[feiz05] Shahrooz Feizabadi and Godmar Back. Java garbage collection scheduling in utility accrual scheduling environments. In JTRES 2005 [JTRES05], 2005. Available here.


[feiz07] Shahrooz Feizabadi and Godmar Back. Garbage collection-aware sheduling utility accrual scheduling environments. Real-Time Systems, 36(1-2), July 2007. Available here.


[feni69] 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. Available here.


[feni71a] Robert R. Fenichel. Comment on cheney's list-compaction algorithm. Communications of the ACM, 14(9):603-604, September 1971.


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


[fent74] J. S. Fenton and D. W. Payne. Dynamic storage allocation of arbitrary sized segments. In Proceedings of IFIPS, pages 344-348, 1974.


[ferg76] H. R. P. Ferguson. On a generalization of the Fibonacci numbers useful in memory allocation schema. The Fibonacci Quarterly, 14(3):233-243, October 1976.


[fern92] Mary F. Fernandez and David R. Hanson. Garbage collection alternatives for Icon. Software: Practice and Experience, 22(8):659-672, August 1992.


[ferr74] Domenico Ferrari. Improving locality by critical working sets. Communications of the ACM, 17(11):614-620, November 1974.


[ferr98a] Paulo Ferreira, Marc Shapiro, Xavier Blondel, Olivier Fambon, Jo\ ao Garcia, Sytse Kloosterman, Nicolas Richer, Marcus Roberts, Fadi Sandakly, George Colouris, Jean Dollimore, Paulo Guedes, Daniel Hagimont, and Sacha Krakowiak. PerDiS: Design, implementation and use of a PERsistent DIstributed Store. Technical Report QMW TR 752, CSTB ILC/98-1392, INRIA RR 3525, INESC RT/5/98, QMW, CSTB INRIA and INESC, October 1998. Available here.


[ferr00] Paulo Ferreira, Marc Shapiro, Xavier Blondel, Olivier Fambon, Jo\ ao Garcia, Sytse Kloosterman, Nicolas Richer, Marcus Roberts, Fadi Sandakly, George Colouris, Jean Dollimore, Paulo Guedes, Daniel Hagimont, and Sacha Krakowiak. PerDiS: Design, implementation and use of a PERsistent DIstributed Store. In Krakowiak and Shrivastava [krak00], 2000, pages 427-452. Available here.


[ferr03a] Paulo Ferreira, Luis Veiga, and Carlos Ribeiro. OBIWAN: Design and implementation of a middleware platform. IEEE Transactions on Parallel and Distributed Systems, 14(11):1086-1099, November 2003. Available here.


[ferr94b] Paulo Ferreira and Marc Shapiro. Distributed shared memory consistency and garbage collection. In Workshop Inter-PRS, Paris, December 1994.


[ferr94] Paulo Ferreira and Marc Shapiro. Garbage collection and DSM consistency. In 1st Symposium on Operating Systems Design and Implementation, pages 229-241, Monterey, CA, November 1994. ACM Press. Available here.


[ferr94c] Paulo Ferreira and Marc Shapiro. Garbage collection of persistent objects in distributed shared memory. In Workshop Franco-Isralienne, St Malo, France, September 1994.


[ferr95] Paulo Ferreira and Marc Shapiro. Garbage collection in the Larchant persistent distributed shared store. In 5th Workshop on Future Trends in Distributed Computing Systems, Cheju Island, Korea, August 1995. Available here.


[ferr94a] Paulo Ferreira and Marc Shapiro. Garbage collection of persistent objects in distributed shared memory. In Atkinson et al. [POS94], 1995, pages 176-191. Available here.


[ferr96] Paulo Ferreira and Marc Shapiro. Asynchronous distributed garbage collection in the Larchant cached shared store. Available from Marc Shapiro, May 1996.


[ferr96a] Paulo Ferreira and Marc Shapiro. Larchant: Persistence by reachability in distributed shared memory through garbage collection. In 16th International Conference on Distributed Computer Systems, Hong Kong, May 1996. Available here.


[ferr98] Paulo Ferreira and Marc Shapiro. Modelling a distributed cached store for garbage collection: the algorithm and its correctness proof. In Jul [ECOOP98], 1998. Available here.


[ferr05] Paulo Ferreira and Luis Veiga. Garbage collection curriculum. MSDN Academic Alliance Curriculum Repository, object ID 6812, July 2005.


[ferr06] Paulo Ferreira and Luis Veiga. Mobile middleware - seamless service access via resource replication. In Paolo Bellavista and Antonio Corradi, editors, The Handbook of Mobile Middleware. Auerbach Publications, Taylor and Francis-CRC Press, October 2006.


[ferr90] Paulo Ferreira. Storage reclamation. In Jul and Juul [OOPSLA90-gc], 1990. Available here.


[ferr91] Paulo Ferreira. Garbage collection in C++. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.


[ferr91b] Paulo Ferreira. Garbage collection in C++. In Workshop on Extensions to C++, Lisbon, June 1991.


[ferr91a] Paulo Ferreira. Reclaiming storage in an object-oriented platform supporting extended C++ and Objective-C applications. In Cabrera et al. [IWOOOS91], 1991. Available here.


[ferr92] Paulo Ferreira. Reciclagem automática de memória num sistema orientado a objectos. Master's thesis, Technical University of Lisbon, June 1992. Available here.


[ferr96b] Paulo Ferreira. Larchant: Garbage Collection in a Cached Distributed Shared Store with Persistence by Reachability. PhD thesis, Université Paris VI, Pierre et Marie Curie, May 1996. Available here.


[ferr16] Henrique Ferreiro, Laura Castro, Vladimir Janjic, and Kevin Hammond. Kindergarten Cop: Dynamic nursery resizing for GHC. In CC 2016 [CC16], 2016, pages 56-66. Available here.


[fiel88] Anthony J. Field and Peter G. Harrison. Functional Programming. Addison-Wesley, 1988.


[fink03] Stephen J. Fink and Feng Qian. Design, implementation and evaluation of adaptive recompilation with on-stack replacement. In CGO 2003 [CGO03], 2003, pages 241-252. Available here.


[fish74] David A. Fisher. Bounded workspace garbage collection in an address order preserving list processing environment. Information Processing Letters, 3(1):29-32, July 1974. Available here.


[fish75] David A. Fisher. Copying cyclic list structure in linear time using bounded workspace. Communications of the ACM, 18(5):251-252, May 1975.


[fitc78] John P. Fitch and Arthur C. Norman. A note on compacting garbage collection. Computer Journal, 21(1):31-34, February 1978.


[fitz00] Robert Fitzgerald and David Tarditi. The case for profile-directed selection of garbage collectors. In Chambers and Hosking [ISMM2000], 2000, pages 111-120. Available here.


[flan96] Cormac Flanagan and Rishiyur S. Nikhil. pHluid: the design of a parallel functional language implementation on workstations. In ICFP 1996 [ICFP96], 1996, pages 169-179.


[flei89] B. D. Fleisch. Mirage: A coherent distributed shared memory design. In 12th ACM Symposium on Operating Systems Principles, pages 211-213. ACM Press, December 1989.


[floo01] Christine Flood, Dave Detlefs, Nir Shavit, and Catherine Zhang. Parallel garbage collection for shared memory multiprocessors. In JVM 2001 [JVM01], 2001. Available here.


[flue08] Matthew Fluet, Mike Rainey, John Reppy, and Adam Shaw. Implicitly-threaded parallelism in Manticore. In ICFP 2008 [ICFP08], 2008, pages 119-130.


[flue04a] Matthew Fluet and Daniel Wang. Implementation and performance evaluation of a safe runtime system in Cyclone. In SPACE 2004 [SPACE04], 2004. Available here.


[flue04] Matthew Fluet. Monadic regions. In SPACE 2004 [SPACE04], 2004. Available here.


[fode85] John K. Foderaro, Keith Sklower, Kevin Layer, et al.. Franz Lisp Reference Manual. Franz Inc., 1985.


[fode81] John K. Foderaro and Richard J. Fateman. Characterization of VAX Macsyma. In 1981 ACM Symposium on Symbolic and Algebraic Computation, pages 14-19, Berkeley, CA, 1981. ACM Press. Available here.


[ford88] R. Ford. Concurrent algorithms for real-time memory management. IEEE Software, pages 10-23, September 1988.


[fori89] A. Forin, J. Barrera, M. Young, and R. Rashid. Design, implementation, and performance evaluation of a distributed shared memory server for Mach. In Winter USENIX Conference. USENIX Association, January 1989.


[fost91] Ian Foster and William Winsborough. Copy avoidance through compile-time analysis and local reuse. In International Logic Programming Symposium, pages 455-469, 1991.


[fost68] J. M. Foster. List Processing. Elsevier Computer Monographs. Elsevier-North Holland, New York, 1968.


[fost85] Mark H. Foster. Design of a list-structure memory using parallel garbage collection. Master's thesis, Oregon Graduate Center, 1985.


[fost88] Ian Foster. An asynchronous parallel garbage collector for a single-assignment language. Technical report, Imperial College, London, May 1988.


[fost89a] Ian Foster. Copy avoidance through local reuse. Technical Report MCS-P99-0989, Argonne National Laboratory, 1989.


[fost89] Ian Foster. A multicomputer garbage collector for a single-assignment language.. International Journal of Parallel Programming, 18(3):181-203, 1989.


[foth] J. A. Fotheringham. Dynamic storage allocation in the Atlas computer including an automatic use of the backing store. Communications of the ACM, 4:435, 1961.


[FPCA85] Jean-Pierre Jouannaud, editor. Conference on Functional Programming and Computer Architecture, volume 201 of Lecture Notes in Computer Science, Nancy, France, September 1985. Springer-Verlag. Available here.


[FPCA87] Gilles Kahn, editor. Conference on Functional Programming and Computer Architecture, volume 274 of Lecture Notes in Computer Science, Portland, OR, September 1987. Springer-Verlag. Available here.


[FPCA89] Conference on Functional Programming and Computer Architecture, Imperial College, London, August 1989. ACM Press.


[FPCA91] John Hughes, editor. Conference on Functional Programming and Computer Architecture, volume 523 of Lecture Notes in Computer Science, Cambridge, MA, August 1991. Springer-Verlag. Available here.


[FPCA93] John Hughes, editor. Conference on Functional Programming and Computer Architecture, Copenhagen, Denmark, June 1993. ACM Press. Available here.


[FPCA95] Conference on Functional Programming and Computer Architecture, La Jolla, CA, June 1995. ACM Press. Available here.


[frad94] Pascal Fradet. Collecting more garbage. In LFP 1994 [LFP94], 1994, pages 24-33. Available here.


[fram07] Daniel Frampton, David F. Bacon, Perry Cheng, and David Grove. Generational real-time garbage collection: A three-part invention for young objects. In Ernst [ECOOP07], 2007, pages 101-125. Available here.


[fram09a] Daniel Frampton, Stephen M. Blackburn, Perry Cheng, Robin J. Garner, D. Grove, J. Eliot B. Moss, and S. I. Salishev. Demystifying magic: High-level low-level programming. In Hosking et al. [VEE09], 2009, pages 81-90. Available here.


[fram09] Daniel Frampton, Stephen M. Blackburn, Luke N. Quinane, and John N. Zigman. Efficient concurrent mark-sweep cycle collection. Technical Report TR-CS-09-02, Australian National University, October 2009. Available here.


[fram03] Daniel Frampton. An investigation into automatic dynamic memory management strategies using compacting collection. Honours thesis, Australian National University, 2003. Available here.


[fram10] Daniel Frampton. Garbage Collection and the Case for High-level Low-level Programming. PhD thesis, Australian National University, June 2010. Available here.


[fran84] Nissim Francez and Dexter Kozen. Generalized fair termination. In POPL 1984 [POPL84], 1984, pages 46-53. Available here.


[fran78] Nissim Francez. An application of a method for analysis of cyclic programs. ACM Transactions on Software Engineering, 4(5):371-377, September 1978.


[fran80] Nissim Francez. Distributed termination. ACM Transactions on Programming Languages and Systems, 2(1):42-55, January 1980.


[fran89] Michael Franklin, G. Copeland, and G. Weikum. What's different about garbage collection for persistent programming languages. Technical Report ACA-ST-062-89, Microelectronics and Computer Technology Corporation, 1989.


[fran88] Franz Inc. Allegro CL User Guide, release 3.0 (beta) edition, April 1988.


[fran92] Franz Inc. Allegro CL User Guide, Version 4.1, revision 2 edition, March 1992.


[frei75] W. F. Freiburger, U. Grenander, and P. D. Sampson. Patterns in program references. IBM Journal of Research and Development, 19(3):230-243, May 1975.


[frie05] S. Friedman, P. Krishnamurthy, R. Chamberlain, Ron K. Cytron, and J. E. Fritts. Dusty caches for reference counting garbage collection. In Proceedings of the 2005 workshop on MEmory performance: DEaling with Applications, systems and architecture (MEDEA ’05), pages 3-–10, 2005.


[frie76] Daniel P. Friedman and David S. Wise. Garbage collecting a heap which included a scatter table. Information Processing Letters, 5(6):161-164, December 1976.


[frie78] Daniel P. Friedman and David S. Wise. Aspects of applicative programming for parallel processing. IEEE Transactions on Computers, 27(4):289-296, April 1978.


[frie79] 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. Available here.


[fu07] Wei Fu and Carl Hauser. Modeling real-time garbage collection cost. In RTCSA 2007 [RTCSA07], 2005. Available here.


[fu05] Wei Fu and Carl Hauser. A real-time garbage collection framework for embedded systems. In Workshop on Software and Compilers for Embedded Systems, pages 20-26, Dallas, TX, 2005. Available here.


[fuch95] Matthew Fuchs. Garbage collection on an open network. In Baker [IWMM95], 1995, pages 251-265. Available here.


[furu91] Shinichi Furusou, Satoshi Matsuoka, and Akinori Yonezawa. Parallel conservative garbage collection with fast allocation. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.

Up [A] [B] [C] [D] [E] [F] [G] [H] [I] [J] [K] [L] [M] [N] [O] [P] [Q] [R] [S] [T] [U] [V] [W] [X] [Y] [Z]


This file was generated by bib2htmlwritten by
Richard Jones

University of Kent at Canterbury