Filters








25,096 Hits in 5.9 sec

The garbage collection advantage

Xianglong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J Eliot B. Moss, Zhenlin Wang, Perry Cheng
2004 Proceedings of the 19th annual ACM SIGPLAN Conference on Object-oriented programming, systems, languages, and applications - OOPSLA '04  
At garbage collection time, the OOR collector then copies referents of hot fields together with their parent.  ...  Because copying garbage collectors move objects, they have an opportunity to improve locality. However, no static copying order is guaranteed to match program traversal orders.  ...  Figure 7: Absence of Phasic Behavior in Standard Benchmarks We now examine the overall impact of garbage collection when the locality advantage and collection overhead are combined.  ... 
doi:10.1145/1028976.1028983 dblp:conf/oopsla/HuangBMMWC04 fatcat:m4fmg25l7jevthgtakpijq7t6e

The garbage collection advantage

Xianglong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J Eliot B. Moss, Zhenlin Wang, Perry Cheng
2004 SIGPLAN notices  
At garbage collection time, the OOR collector then copies referents of hot fields together with their parent.  ...  Because copying garbage collectors move objects, they have an opportunity to improve locality. However, no static copying order is guaranteed to match program traversal orders.  ...  Figure 7: Absence of Phasic Behavior in Standard Benchmarks We now examine the overall impact of garbage collection when the locality advantage and collection overhead are combined.  ... 
doi:10.1145/1035292.1028983 fatcat:6czk6zohybgqhlwj7l55dphkdu

Effective "static-graph" reorganization to improve locality in garbage-collected systems

Paul R. Wilson, Michael S. Lam, Thomas G. Moher
1991 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91  
Several researchers have attempted to improve locality in garbage-collected heaps by changing the traversal algorithm used by a copying garbage collector.  ...  Programming Language Design and Implementation.  ...  This comment led me, after a bit of cogitation, to the conclusion that hash tables are the major culprit in the locality problems of garbage-collected heaps.  ... 
doi:10.1145/113445.113461 dblp:conf/pldi/WilsonLM91 fatcat:z6p3twb4rfhkliznsapr3v4zay

Garbage collecting the Internet: a survey of distributed garbage collection

Saleh E. Abdullahi, Graem A. Ringwood
1998 ACM Computing Surveys  
The spectrum of garbage-collection schema for linked structures distributed over a network are reviewed here.  ...  Internet programming languages such as Java present new challenges to garbagecollection design.  ...  ACKNOWLEDGMENT The authors are grateful to the referees for pointing out omissions and misconceptions in the draft.  ... 
doi:10.1145/292469.292471 fatcat:odrr35rx4jfyvihpguawcljqv4

Garbage collecting the world

Richard L. Hudson, Ron Morrison, J. Eliot B. Moss, David S. Munro
1997 Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '97  
Here we are concerned with garbage collection in a distributed system where each node in the system has its own local storage and may communicate with other nodes only by passing messages.  ...  Completeness: the collector is complete in that all garbage, including cyclic garbage that spans nodes, is collected within a finite number of jnvocations.  ...  The work was supported by NSF grants IRI-9632284 and INT-9600216 and-by EPSRC Grant GWJ67611.  ... 
doi:10.1145/263698.264353 dblp:conf/oopsla/HudsonMMM97 fatcat:3coz2atn3zde5nim5rzkoini5y

The transactional memory / garbage collection analogy

Dan Grossman
2007 SIGPLAN notices  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The connections are fascinating in their own right, and they let us better understand one technology by thinking about the corresponding issues for the other.  ...  Acknowledgments Conversations with Emery Berger, Jim Larus, Jan Vitek, members of the WASP group at the University of Washington, and many others led to some of the ideas presented here.  ... 
doi:10.1145/1297105.1297080 fatcat:mcgkbnpue5gzjav52fvier6qqm

Garbage collecting the world

Richard L. Hudson, Ron Morrison, J. Eliot B. Moss, David S. Munro
1997 SIGPLAN notices  
Here we are concerned with garbage collection in a distributed system where each node in the system has its own local storage and may communicate with other nodes only by passing messages.  ...  Completeness: the collector is complete in that all garbage, including cyclic garbage that spans nodes, is collected within a finite number of jnvocations.  ...  The work was supported by NSF grants IRI-9632284 and INT-9600216 and-by EPSRC Grant GWJ67611.  ... 
doi:10.1145/263700.264353 fatcat:fcll5usqqzaljomiarvafdrtqq

The transactional memory / garbage collection analogy

Dan Grossman
2007 Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07  
This essay presents remarkable similarities between transactional memory and garbage collection.  ...  The connections are fascinating in their own right, and they let us better understand one technology by thinking about the corresponding issues for the other.  ...  Acknowledgments Conversations with Emery Berger, Jim Larus, Jan Vitek, members of the WASP group at the University of Washington, and many others led to some of the ideas presented here.  ... 
doi:10.1145/1297027.1297080 dblp:conf/oopsla/Grossman07 fatcat:lev6ytg45zchzabv3pprp2xxga

The measured cost of conservative garbage collection

Benjamin Zorn
1993 Software, Practice & Experience  
I conclude that conservative garbage collection is a promising alternative to explicit storage management and that the performance of conservative collection is likely to improve in the future.  ...  I also find that the true cost of conservative garbage collection is not the CPU overhead, but the memory system overhead of the algorithm.  ...  Interestingly, even in the yacr program, where conservative garbage collection reduced the total memory requirements by 20 per cent, the garbage collection algorithm still showed far less locality of reference  ... 
doi:10.1002/spe.4380230704 fatcat:givp3r2izjhv3ikaumi72xtacm

On the type accuracy of garbage collection

Martin Hirzel, Amer Diwan
2001 SIGPLAN notices  
We describe a novel approach to obtaining type-accurate information for garbage collection in a hardware and language independent way.  ...  We use this technique to perform a detailed comparison of garbage collectors with different levels of accuracy and explicit deallocation on a range of C programs.  ...  We would like to thank Hans Boehm for helping us understand the Boehm-Demers-Weiser collector.  ... 
doi:10.1145/362426.362428 fatcat:h43gknz2srgo3kivn6cjxjjvei

On the type accuracy of garbage collection

Martin Hirzel, Amer Diwan
2000 Proceedings of the second international symposium on Memory management - ISMM '00  
We describe a novel approach to obtaining type-accurate information for garbage collection in a hardware and language independent way.  ...  We use this technique to perform a detailed comparison of garbage collectors with different levels of accuracy and explicit deallocation on a range of C programs.  ...  We would like to thank Hans Boehm for helping us understand the Boehm-Demers-Weiser collector.  ... 
doi:10.1145/362422.362428 dblp:conf/iwmm/HirzelD00 fatcat:h2um3ofbijh2tgubugegtvnxce

Garbage collection in the next C++ standard

Hans-J. Boehm, Mike Spertus
2009 Proceedings of the 2009 international symposium on Memory management - ISMM '09  
Such minimal support is included in the current committee draft for the next C++ standard. It imposes an additional language restriction that makes it safe to garbage collect C++ programs.  ...  Such minimal support is included in the current committee draft for the next C++ standard. It imposes an additional language restriction that makes it safe to garbage collect C++ programs.  ...  Clark Nelson contributed substantially to the formal proposal accepted into the current draft standard. The anonymous reviewers made many useful suggestions for improving this paper.  ... 
doi:10.1145/1542431.1542437 dblp:conf/iwmm/BoehmS09 fatcat:4pr4vexo55hbncrz4x4j5kaima

Realtime garbage collection in the JamaicaVM 3.0

Fridtjof Siebert
2007 Proceedings of the 5th international workshop on Java technologies for real-time and embedded systems - JTRES '07  
The recent improvements of the garbage collector that will be present in this paper include support for automatic heap expansion; reduction of the memory overhead for garbage collector internal structures  ...  A particular emphasis will be made on the improvements made in with release 3.0 JamaicaVM.  ...  INTRODUCTION Realtime Garbage Collection and the RTSJ The Real-Time Specification for Java (RTSJ) provides essential infrastructure for realtime programming in Java [4] .  ... 
doi:10.1145/1288940.1288954 dblp:conf/jtres/Siebert07 fatcat:ysomdij4i5h5xeq4le6jomi7mq

Generational garbage collection and the radioactive decay model

William D. Clinger, Lars T. Hansen
1997 Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97  
This result provides insight into the computational advantages of generational garbage collection, with implications for the management of objects whose life expectancies are difficult to predict.  ...  Yet there remains a rational basis for deciding how many objects to promote, when to collect garbage, and which generations to collect.  ...  Introduction The computational advantages of generational garbage collection over non-generational collection are generally attributed to heuristic prediction of object lifetimes and to improved caching  ... 
doi:10.1145/258915.258925 dblp:conf/pldi/ClingerH97 fatcat:fewsr25ihfhufhd6kaqggtyvmi

Generational garbage collection and the radioactive decay model

William D. Clinger, Lars T. Hansen
1997 SIGPLAN notices  
This result provides insight into the computational advantages of generational garbage collection, with implications for the management of objects whose life expectancies are difficult to predict.  ...  Yet there remains a rational basis for deciding how many objects to promote, when to collect garbage, and which generations to collect.  ...  Introduction The computational advantages of generational garbage collection over non-generational collection are generally attributed to heuristic prediction of object lifetimes and to improved caching  ... 
doi:10.1145/258916.258925 fatcat:tuc7cjysavbczlhklufxacq7be
« Previous Showing results 1 — 15 out of 25,096 results