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 6 November 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]


W


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


[wadl84] Philip L. Wadler. Listlessness is better than laziness: Lazy evaluation and garbage collection at compile time. In Steele [LFP84], 1984, pages 45-52. Available here.


[wadl87] Philip L. Wadler. Fixing some space leaks with a garbage collector. Software: Practice and Experience, 17(9):595-609, September 1987. Available here.


[wagn11] Gregor Wagner, Andreas Gal, Christian Wimmer, Brendan Eich, and Michael Franz. Compartmental memory management in a modern web browser. In Boehm and Bacon [ISMM11], 2011, pages 119-128. Available here.


[wagn16] Gregor Wagner, Per Larsen, Stefan Brunthaler, and Michael Franz. Thinking inside the box: Compartmentalized garbage collection. ACM Transactions on Programming Languages and Systems, 38(3):9:1-9:37, April 2016. Available here.


[wait73] W. M. Waite. Implementing Software for Nonnumeric Applications. Prentice-Hall, 1973.


[wake91] David Wakeling and Colin Runciman. Linearity and laziness. In Hughes [FPCA91], 1991, pages 215-240. Available here.


[wake90] David Wakeling. Linearity and Laziness. PhD thesis, University of York, November 1990.


[wald72] O. C. Walden. A note on Cheney's non-recursive list-compacting algorithm. Communications of the ACM, 15(4), April 1972.


[walk00] David Walker, Karl Crary, and Greg Morrisett. Typed memory management in a calculus of capabilities. ACM Transactions on Programming Languages and Systems, 24(4):701-771, 2000.


[walk01] David Walker. On linear types and regions. In SPACE 2001 [SPACE01], 2001. Available here.


[walk04] David Walker. Stacks, heaps and regions: One logic to bind them. In SPACE 2004 [SPACE04], 2004. Invited talk. Available here.


[wall91] Larry Wall and Randal L. Schwartz. Programming Perl. O'Reilly and Associates, Inc., 1991.


[wall93] Malcolm Wallace and Colin Runciman. An incremental garbage collector for embedded real-time systems. In Chalmers Winter Meeting, pages 273-288, Tanum Strand, Sweden, 1993. Published as Programming Methodology Group, Chalmers University of Technology, Technical Report 73. Available here.


[wang95] Y. Wang, P. Chung, I. Lin, and W.K.Fuchs. Checkpoint space reclamation for uncoordinated checkpointing in message-passing systems. IEEE Transactions on Parallel and Distributed Systems, 6(5):546-554, May 1995.


[wang08] Xi Wang, Zhilei Xu, Xuezheng Liu, Zhenyu Guo, Xiaoge Wang, and Zheng Zhang. Conditional correlation analysis for safe region-based memory management. In Gupta and Amarasinghe [PLDI08], 2008, pages 45-55. Available here.


[wang15] Kunshan Wang, Yi Lin, Stephen M. Blackburn, Michael Norrish, and Antony L. Hosking. Draining the swamp: Micro virtual machines as solid foundation for language development. In Inaugural Summit on Advances in Programming Languages, SNAPL, Asilomar, California, May 2015. Available here.


[wang99] Daniel C. Wang and Andrew W. Appel. Safe garbage collection = regions + intensional type analysis. Technical report, Princeton, July 1999. Available here.


[wang00] Daniel C. Wang and Andrew W. Appel. Type-preserving garbage collectors (extended version). Technical report, Department of Computer Science, Princeton University, December 2000. Available here.


[wang01] Daniel C. Wang and Andrew W. Appel. Type-preserving garbage collectors. In POPL 2001 [POPL01], 2001, pages 166-178. Available here.


[wang06] W. Wang and C.A. Varela. Distributed garbage collection for mobile actor systems: the pseudo root approach. In 1st International Conference on Grid and Pervasive Computing (GPC), Taichung, Taiwan, May 2006. Springer-Verlag.


[wang89] Thomas Wang. The MM garbage collector for C++. Master's thesis, California State Polytechnic University, October 1989.


[wang94a] Thomas Wang. Better C: An object-oriented C language with automatic memory manager suitable for interactive applications. ACM SIGPLAN Notices, 29(11):104-111, December 1994.


[wang94b] Thomas Wang. Eliminate memory fragmentation through holes in the heap. ACM SIGPLAN Notices, 29(11):112-113, December 1994.


[wang13] W.-J. Wang. Conservative snapshot-based actor garbage collection for distributed mobile actor systems. Telecommunication Systems, 52(2):647-–660, 2013.


[warr77] David H. D. Warren. Implementing Prolog - compiling logic programs. D.A.I. Research Report 39, 40, University of Edinburgh, 1977.


[warr80] David H. D. Warren. An improved Prolog implementation which optimises tail-recursion. In Workshop on Logic Programming, Debrecen, Hungary, 1980.


[warr82] David H. D. Warren. Perpetual processes - an unexploited Prolog technique. Logic Programming Newsletter, 3, 1982.


[warr83] David H. D. Warren. An abstract Prolog instruction set. Technical Note 309, SRI International, 1983.


[warr84] David A. Warren. Efficient Prolog memory management for flexible control strategies. In International Symposium on Logic Programming. IEEE Press, 1984.


[wash90] Douglas Markham Washabaugh and Dennis Kafura. Real-time garbage collection of actors. In 11th Real-Time Systems Symposium, pages 21-30, December 1990.


[wash91] Douglas M. Washabaugh and D. Kafura. Distributed garbage collection of active objects. In icdcs11, pages 369-276, May 1991.


[wash89] Douglas Markham Washabaugh. Real-time garbage collection of actors in a distributed system. Master's thesis, Virginia Polytechnic Institute and State University, 1989.


[wats87] Paul Watson and Ian Watson. An efficient garbage collection scheme for parallel computer architectures. In de Bakker et al. [PARLE87], 1987, pages 432-443. Available here.


[wats87a] Paul Watson and Ian Watson. Graph reduction in a parallel virtual memory environment. In J. H. Fasel and R. M. Keller, editors, Graph Reduction Workshop, volume 279 of Lecture Notes in Computer Science, pages 265-274, Santa Fe, NM, 1987. Springer-Verlag.


[wats76] Watson and David Wise. Tuning Garwick's algorithm for repacking sequential storage. BIT, 16(4):442-450, December 1976.


[wats86] Ian Watson. An analysis of garbage collection for distributed systems. Technical report, Department of Computer Science, University of Manchester, 1986.


[WDAG96] {Özalp Babaoglu and Keith Marzullo, editors. 10th International Workshop on Distributed Algorithms, volume 1151 of Lecture Notes in Computer Science, Bologna, Italy, October 1996. Springer. Available here.


[weem90] P. Weemeeuw and B. Demoen. A la recherche de la mémoire perdue, or: Memory compaction for shared memory multiprocessors - design and specification. In S. Debray and M. Hermenegildo, editors, 2nd North American Conference on Logic Programming, pages 306-320, 1990.


[weem92] Patrick Weemeeuw and Bart Demoen. Garbage collection in Aurora: An overview. In Bekkers and Cohen [IWMM92], 1992, pages 454-472. Available here.


[wegb72a] B. Wegbreit. A generalised compactifying garbage collector. Computer Journal, 15(3):204-208, August 1972.


[wegb72b] B. Wegbreit. A space efficient list structure tracing algorithm. IEEE Transactions on Computers, pages 1098-1010, September 1972.


[wegi08] Michal Wegiel and Chandra Krintz. The mapping collector: Virtual memory support for generational, parallel, and concurrent compaction. In Eggers and Larus [ASPLOS08], 2008, pages 91-102. Available here.


[wegi08a] Michal Wegiel and Chandra Krintz. XMem: Type-safe, transparent, shared memory for cross-runtime communication and coordination. In Gupta and Amarasinghe [PLDI08], 2008, pages 327-338. Available here.


[wegi09] Michal Wegiel and Chandra Krintz. The single-referent collector: Optimizing compaction for the common case. ACM Transactions on Architecture and Code Optimization, 2009.


[wegi10] Michal Wegiel and Chandra Krintz. Cross-language, type-safe, and transparent object sharing for co-located managed runtimes. In OOPSLA 2010 [OOPSLA10], 2010, pages 223-240. Available here.


[wein81] Daniel Weinreb and David Moon. LISP Machine Manual. MIT AI Laboratory, fourth edition edition, July 1981.


[wein88] Charles B. Weinstock and William A. Wulf. Quickfit: An efficient algorithm for heap storage allocation. ACM SIGPLAN Notices, 23(10):141-144, 1988.


[wein76] Charles B. Weinstock. Dynamic Storage Allocation Techniques. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, April 1976.


[weis89] Mark Weiser, Alan Demers, and Carl Hauser. The Portable Common Runtime approach to interoperability. In 12th ACM Symposium on Operating Systems Principles. ACM Press, December 1989.


[weis67] C. Weissman. Lisp 1.5 Primer. Dickenson Publ., Belmont, CA, 1967.


[weiz62] J. Weizenbaum. Knotted list structures. Communications of the ACM, 5(3):161-165, 1962.


[weiz63] J. Weizenbaum. Symmetric list processor. Communications of the ACM, 6(9):524-544, September 1963.


[weiz64] J. Weizenbaum. More on the reference counter method. Communications of the ACM, 7(1):38, 1964.


[weiz69] J. Weizenbaum. Recovery of reentrant list structures in SLIP. Communications of the ACM, 12(7):370-372, July 1969. Available here.


[welc04] Adam Welc, Suresh Jagannathan, and Antony L. Hosking. Transactional monitors for concurrent objects. In Odersky [ECOOP04], 2004, pages 519-542. Available here.


[welc05] Adam Welc, Suresh Jagannathan, and Antony L. Hosking. Safe futures for Java. In OOPSLA 2005 [OOPSLA05], 2005, pages 439-453. Available here.


[weng79] K.-S. Weng. An abstract implementation for a generalised dataflow language. Technical Report MIT/LCS/TR228, MIT Laboratory for Computer Science, 1979.


[went88] E. P. Wentworth. An Environment for Investigating Functional Languages and Implementations. PhD thesis, University of Port Elizabeth, South Africa, 1988.


[went90] E. P. Wentworth. Pitfalls of conservative garbage collection. Software: Practice and Experience, 20(7):719-727, 1990.


[whal99] John Whaley and Martin Rinard. Compositional pointer and escape analysis for Java programs. In OOPSLA 1999 [OOPSLA99], 1999, pages 187-206. By analysing which objects escape methods/threads, we can allocate on the stack / avoid synchronisations. Available here.


[whil92] R. Lyndon While and Tony Field. Incremental garbage collection for the Spineless Tagless G-machine. In Evan Ireland and Nigel Perry, editors, Massey Functional Programming Workshop. Department of Computer Science, Massey University, 1992.


[whil92a] R. Lyndon While. A viable software read-barrier. Departmental Report DoC 92/12, Imperial College, London, 1992.


[whit13] David R. White, Jeremy Singer, Jonathan M. Aitken, and Richard E. Jones. Control theory for principled heap sizing. In Petrank and Cheng [ISMM13], 2013, pages 27-38. Available here.


[whit92] Seth J. White and David J. Dewitt. A performance study of alternative object faulting and pointer swizzling strategies. In 18th International Conference on Very Large Data Bases, Vancouver, British Columbia, Canada, October 1992.


[whit94] Seth J. White and David J. Dewitt. Quickstore: A high performance mapped object store. In SIGMOD94, pages 395-406, 1994.


[whit98] Derek White and Alex Garthwaite. The GC interface in the EVM. Technical Report SML TR-98-67, Sun Microsystems Laboratories, December 1998. Available here.


[whit80] Jon L. White. Address/memory management for a gigantic Lisp environment, or, GC Considered Harmful. In LFP 1980 [LFP80], 1980, pages 119-127. Available here.


[whit90] Jon L. White. Three issues in objected-oriented garbage collection. In Jul and Juul [OOPSLA90-gc], 1990. Available here.


[whit97] Marc White. Deferred garbage collection. MacTech magazine, 13(12), 1997. Available here.


[whol85] Skef Wholey, Scott E. Fahlman, and Joseph Ginder. Revised internal design of Spice Lisp. Technical report, Carnegie Mellon University, January 1985.


[whol84] Skef Wholey and Scott E. Fahlman. The design of an instruction set for Common Lisp. In Steele [LFP84], 1984, pages 150-158. Available here.


[wick04] Adam Wick and Matthew Flatt. Memory accounting without partitions. In Bacon and Diwan [ISMM04], 2004, pages 120-130. Available here.


[wild91] J. Wild, Hugh Glaser, and Pieter Hartel. Statistics on storage management in a lazy functional language implementation. In Sendov, editor, 3rd Workshop on Parallel and Distributed Processing, Sofia, April 1991. Elsevier-North Holland. Also appears in 4th International Workshop on Parallel Implementation of Functional Languages, Aachen, September 1992, ed. H. Kuchen and R. Loogen, Aachener Informatik-Berichte 92-16. Available here.


[wile89] J. C. Wileden, A. L. Wolf, C. D. Fisher, and P. L. Tarr. Pgraphite: An experiment in persistent typed object management. ACM SIGPLAN Notices, 24(2):130-142, February 1989.


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


[wilh05] Jesper Wilhelmsson. Efficient Memory Management for Message-Passing Concurrency - part I: Single-threaded execution. Licentiate thesis, Uppsala University, May 2005.


[wilk64] Maurice V. Wilkes. An experiment with a self-compiling compiler for a simple list-processing language. Annual Review in Automatic Programming, 4:1-48, 1964.


[wilk64a] Maurice V. Wilkes. Lists and why they are useful. In 19th ACM National Conference. ACM Press, August 1964.


[will98] B. Willard and O. Frieder. Autonomous garbage collection: Resolving memory leaks in long running network applications. In International Conference On Computer Communications and Networks (ICCCN), pages 886-896, Lafayette, LO, October 1998. IEEE Press. Available here.


[will00] B. Willard and O. Frieder. Autonomous garbage collection: Resolving memory leaks in long-running server applications. Computer Communications, 23(10):887-900, May 2000.


[will87a] Ifor W. Williams, Mario I. Wolczko, and T. P. Hopkins. Realisation of a dynamic grouped object-oriented virtual memory hierarchy. In Carrick and Cooper [POS87], 1987, pages 298-308. Persistent Programming Research Report, Universities of Glasgow and St Andrews, number PPRR-44-87.


[will87] Ifor W. Williams, Mario I. Wolczko, and Trevor P. Hopkins. Dynamic grouping in an object-oriented virtual memory hierarchy. In Bézivin et al. [ECOOP87], 1987, pages 79-88. Available here.


[will90] Ifor Williams, Mario I. Wolczko, and Trevor Hopkins. Realization of a dynamically grouped object-oriented memory hierarchy. Technical report, University of Manchester Department of Computer Science, Manchester, 1990.


[will91] Ifor W. Williams and Mario I. Wolczko. An object-based memory architecture. In Dearle et al. [POS90], 1991, pages 114-130.


[wils90b] Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Caching consideration for generational garbage collection: A case study of large and set-associative caches. Technical Report UIC-EECS-90-5, University of Illinois at Chicago EECS Department, Chicago, IL, December 1990. Improved version appears in [LFP92].


[wils91] Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Effective ``static-graph'' reorganization to improve locality in garbage-collected systems. In PLDI 1991 [PLDI91], 1991, pages 177-191. Available here.


[wils92] Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Caching considerations for generational garbage collection. In LFP 1992 [LFP92], 1992, pages 32-42. Available here.


[wils92b] Paul R. Wilson, Shubhendu S. Mukherjee, and Sheetal V. Kakkad. Anomalies and adaptation in the analysis and development of prepaging p olicies. Journal of Systems and Software, 1992. Available here.


[wils94a] Paul R. Wilson, Shubhendu S. Mukherjee, and Sheetal V. Kakkad. Anomalies and adaptation in the analysis and development of prepaging policies. Journal of Systems and Software, 1994. Technical Communication.


[wils95] Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In Baker [IWMM95], 1995, pages 1-116. Available here.


[wils95a] Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Memory allocation policies reconsidered. Unpublished manuscript, 1995. Available here.


[wils92e] Paul R. Wilson and Atif Chaudrhy. Efficient tracing using virtual memory address protection. In preparation, 1992.


[wils91a] Paul R. Wilson and Barry Hayes. Report on the 1991 workshop on garbage collection in object-oriented systems. In OOPSLA 1991 [OOPSLA91], 1991. Addendum. Also distributed as a special issue of ACM SIGPLAN Notices, and OOPS Messenger 3(4), October 1992. Available here.


[wils93a] Paul R. Wilson and Mark Johnstone. Truly real-time non-moving implicit-reclamation garbage collection. Rough Draft, March 1993. Available here.


[wils93] Paul R. Wilson and Mark S. Johnstone. Truly real-time non-copying garbage collection. In Moss et al. [OOPSLA93-gc], 1993. Available here.


[wils92a] Paul R. Wilson and Sheetal V. Kakkad. Pointer swizzling at page fault time: Efficiently and compatibly supporting huge addresses on standard hardware. In Cabrera et al. [IWOOOS92], 1992, pages 364-377. Available here.


[wils89] 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, 1989. Available here.


[wils89b] Paul R. Wilson and Thomas G. Moher. Design of the opportunistic garbage collector. In OOPSLA 1989 [OOPSLA89], 1989, pages 23-35. Available here.


[wils88] Paul R. Wilson. Opportunistic garbage collection. ACM SIGPLAN Notices, 23(12):98-102, December 1988.


[wils88b] Paul R. Wilson. Two comprehensive virtual copy mechanisms. Master's thesis, University of Illinois at Chicago, Electrical Engineering and Computer Science Department, Chicago, IL, 1988.


[wils89a] Paul R. Wilson. A simple bucket-brigade advancement mechanism for generation-based garbage collection. ACM SIGPLAN Notices, 24(5):38-46, May 1989. Available here.


[wils90a] Paul R. Wilson. Pointer swizzling at page fault time: Efficiently supporting huge address spaces on standard hardware. Technical Report UIC-EECS-90-6, University of Illinois at Chicago, Electrical Engineering and Computer Science Department, Chicago, IL, December 1990. Also in Computer Architecture News, 19(4):6-13, June 1991.


[wils90] Paul R. Wilson. Some issues and strategies in heap management and memory hierarchies. In Jul and Juul [OOPSLA90-gc], 1990. Also in SIGPLAN Notices 23(1):45-52, January 1991. Available here.


[wils91c] Paul R. Wilson. Heap Management and Memory Hierarchies. PhD thesis, University of Illinois at Chicago, December 1991.


[wils92d] Paul R. Wilson. Garbage collection and memory hierarchy. In Bekkers and Cohen [IWMM92], 1992. Discussion Session. Available here.


[wils91b] Paul R. Wilson. Operating system support for small objects. In Cabrera et al. [IWOOOS92], 1992.


[wils92c] Paul R. Wilson. Uniprocessor garbage collection techniques. In Bekkers and Cohen [IWMM92], 1992, pages 1-42. Available here.


[wils94] Paul R. Wilson. Uniprocessor garbage collection techniques. Technical report, University of Texas, January 1994. Expanded version of the IWMM92 paper. Available here.


[wimm12] Christian Wimmer, Michael Haupt, Michael L. Van De Vanter, Mick Jordan, Laurent Daynè;s, , and Douglas Simon. Maxine: An approachable virtual machine for, and in, Java. Technical report, Oracle Labs, 2012. Available here.


[wins89] William Winsborough. Path-dependent reachability analysis for multiple specialization. In E. Lusk and R. Overbeek, editors, North American Conference on Logic Programming, pages 113-153. MIT Press, 1989.


[wise94] David S. Wise, Brian Heck, Caleb Hess, Willie Hunt, and Eric Ost. Uniprocessor performance of a reference-counting hardware heap. Technical Report TR-401, Indiana University, Computer Science Department, May 1994. Available here.


[wise97] David S. Wise, Caleb Hess, Willie Hunt, and Eric Ost. Research demonstration of a hardware reference-counting heap. Lisp and Symbolic Computation, 10(2):151-181, July 1997. Available here.


[frie77] David S. Wise and Daniel P. Friedman. The one-bit reference count. In BIT [wise77], 1977, pages 351-359. Available here.


[wise77] David S. Wise and Daniel P. Friedman. The one-bit reference count. BIT, 17(3):351-359, 1977. Available here.


[wise96] David S. Wise and J. Walgenbach. Static and dynamic partitioning of pointers as links and threads. In 1996 ACM SIGPLAN International Conference on Functional Programming, ACM SIGPLAN Notices 31(6), pages 42-49. ACM Press, June 1996. Available here.


[wise76] David S. Wise and Daniel C. Watson. Tuning Garwick's algorithm for repacking sequential storage. BIT, 16(4):442-450, December 1976.


[wise78] David S. Wise. The double buddy-system. Computer Science Technical Report TR79, Indiana University, Bloomington, IN, December 1978. Available here.


[wise79] David S. Wise. Morris' garbage compaction algorithm restores reference counts. ACM Transactions on Programming Languages and Systems, 1:115-120, July 1979. Available here.


[wise85] David S. Wise. Design for a multiprocessing heap with on-board reference counting. In Jouannaud [FPCA85], 1985, pages 289-304. Available here.


[wise93] David S. Wise. Stop-and-copy and one-bit reference counting.. Computer Science Technical Report 360, Indiana University, March 1993. See also &icedil;tetwise93a.Available here.


[wise93a] David S. Wise. Stop-and-copy and one-bit reference counting.. Information Processing Letters, 46(5):243-249, July 1993. Available here.


[wise66] N. E. Wiseman. A simple list processing package for the PDP-7. In DECUS 2nd European Seminar, pages 37-42, Aachen, October 1966.


[wise85a] Simon R. Wiseman. A garbage collector for a large distributed address space. Technical Report 85009, Royal Signals and Radar Establishment, Malvern, UK, 1985.


[wise88] Simon R. Wiseman. Garbage Collection in Distributed Systems. PhD thesis, University of Newcastle upon Tyne, 1988.


[with91] P. Tucker Withington. How real is ``real time'' garbage collection?. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.


[wodo69] P. L. Wodon. Data structure and storage allocation. BIT, 9(3):270-282, 1969.


[wodo71] P. L. Wodon. Methods of garbage collection for Algol-68. In Peck [Algol68], 1971, pages 245-262.


[wolc90] Mario I. Wolczko and Ifor Williams. Garbage collection in high performance system. In Jul and Juul [OOPSLA90-gc], 1990. Available here.


[wolc92] Mario I. Wolczko and Ifor Williams. Multi-level garbage collection in a high-performance persistent object system. In Albano and Morrison [POS92], 1992, pages 396-418. Available here.


[wolc93] Mario I. Wolczko and Ifor Williams. An alternative architecture for objects: Lessons from the MUSHROOM project. In Moss et al. [OOPSLA93-gc], 1993. Available here.


[wolc90a] Mario I. Wolczko. Garbage collection. In Cliff B. Jones and Roger C. F. Shaw, editors, Case Studies in Systematic Software Development, chapter 8, pages 211-233. Prentice-Hall, 1990.


[wolf89] W. Wolf. Practical comparison of two object-oriented languages. IEEE Software, 6(5):61-68, 1989.


[woll96] A. Wollrath, R. Riggs, and Jim Waldo. A distributed object model for the Java system. In Conference on Object-Oriented Technologies, Toronto, Canada, June 1996. Usenix.


[wong87] K. F. Wong. Garbage collection coprocessor system. Electronics Letters, 23(15):798-800, 1987.


[wood81] M. C. Woodward. Multiprocessor garbage collection - a new solution. Computer Studies, 115, 1981.


[wrig05] Gregory Wright, Matthew L. Seidl, and Mario Wolczko. An object-aware memory architecture. Technical Report SML-TR-2005-143, Sun Microsystems Laboratories, February 2005.


[wrig06] Gregory Wright, Matthew L. Seidl, and Mario Wolczko. An object-aware memory architecture. Science of Computer Programming, 62(2):145-163, October 2006.


[wrig93] D. A. Wright and C. A. Baker-Finch. Usage analysis with natural reduction types. In 3rd International Workshop on Static Analysis, 1993.


[wrig08] Gregory Wright. A hardware-assisted concurrent & parallel GC algorithm. Technical report, Oracle Laboratories, November 2008. Available here.


[wu14] Hao Wu and Zhen-Zhou Ji. A study of lock-free based concurrent garbage collectors for multicore platform. The Scientific World Journal, 2014:8, June 2014. Available here.


[wu15] Hao Wu and Zhen-Zhou Ji. Improving trace precision for concurrent garbage collection on multicore platform. In Fifth International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC), pages 1493-1496, Qinhuangdao, 2015. IEEE Press. Available here.


[wu07] 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), pages 1-10, Long Beach, CA, March 2007. Available here.


[wu89] Meizhen Wu. A parallel garbage collection algorithm for virtual memory. Master's thesis, Auburn University, 1989.


[wu89a] Zhibo Wu. A real time distributed garbage collection method. Research report R 181, University of Exeter. Department of Computer Science, 1989. Year maybe 1992.

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