Filters








5,406 Hits in 3.7 sec

A parallel, real-time garbage collector

Perry Cheng, Guy E. Blelloch
2001 SIGPLAN notices  
We describe a parallel, real-time garbage collector and present experimental results that demonstrate good scalability and good real-time bounds.  ...  To the best of our knowledge, this is the first implementation of a parallel, real-time garbage collector. The average collector speedup is 7.5 at 8 processors and 17.7 at 32 processors.  ...  CONCLUSION We have presented an implementation of a scalably parallel, concurrent, real-time garbage collector.  ... 
doi:10.1145/381694.378823 fatcat:kasudneqlfdatgiaq4meoobndq

A parallel, real-time garbage collector

Perry Cheng, Guy E. Blelloch
2001 Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation - PLDI '01  
We describe a parallel, real-time garbage collector and present experimental results that demonstrate good scalability and good real-time bounds.  ...  To the best of our knowledge, this is the first implementation of a parallel, real-time garbage collector. The average collector speedup is 7.5 at 8 processors and 17.7 at 32 processors.  ...  CONCLUSION We have presented an implementation of a scalably parallel, concurrent, real-time garbage collector.  ... 
doi:10.1145/378795.378823 dblp:conf/pldi/ChengB01 fatcat:gy2vfwuiqvfw7m57jgg3ls7pke

Garbage-first garbage collection

David Detlefs, Christine Flood, Steve Heller, Tony Printezis
2004 Proceedings of the 4th international symposium on Memory management - ISMM '04  
Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput.  ...  This evacuation is performed in parallel on multiprocessors, to increase throughput.  ...  APPENDIX A.  ... 
doi:10.1145/1029873.1029879 dblp:conf/iwmm/DetlefsFHP04 fatcat:hgrjgdmpxrgvhpad4pyjkwpofe

Limits of parallel marking garbage collection

Fridtjof Siebert
2008 Proceedings of the 7th international symposium on Memory management - ISMM '08  
This paper analyses the difficulties a parallel mark-and-sweep garbage collector faces during a parallel mark phase.  ...  In the context of realtime systems, it has to be shown that a parallel garbage collector implementation not only performs well in most cases, but guarantees on its performance in the worst case are required  ...  This paper addresses parallel garbage collection. For a parallel realtime system, a parallel and concurrent garbage collector may be most useful for best application response times.  ... 
doi:10.1145/1375634.1375638 dblp:conf/iwmm/Siebert08 fatcat:l63fnjbnufd5nnbtqccvxke55a

Stopless

Filip Pizlo, Daniel Frampton, Erez Petrank, Bjarne Steensgaard
2007 Proceedings of the 6th international symposium on Memory management - ISMM '07  
We present STOPLESS: a concurrent real-time garbage collector suitable for modern multiprocessors running parallel multithreaded applications.  ...  Creating a garbage-collected environment that supports real-time on modern platforms is notoriously hard, especially if real-time implies lock-freedom.  ...  The Metronome is currently the state-of-the-art in real-time garbage collection. It is a real-time garbage collector [3] for Java, which is currently IBM's WebSphere Real-time Java Virtual Machine.  ... 
doi:10.1145/1296907.1296927 dblp:conf/iwmm/PizloFPS07 fatcat:ikxwtq2asfgstblrd2e4u5h33i

Using Transactional Memory to Synchronize an Adaptive Garbage Collector in Real-Time Java

M. Teresa Higuera-Toledano
2011 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops  
We propose to use TM to synchronize the concurrent/parallel execution of the Garbage Collector (GC) and Java applications, within the context of an embedded real-time environment.  ...  Since in the context of real-time systems, a collector must guarantee a worst-case in it performance, the worst-case time for a committed transaction must be limited; we achieve this by limiting its size  ...  This modification has been introduced in [31] in order to obtain a parallel collector with real-time guaranties.  ... 
doi:10.1109/isorcw.2011.24 dblp:conf/isorc/Higuera-Toledano11 fatcat:xaftln4jnzhtvjee7hg55fhsnu

Optimizing memory use in Java applications, garbage collectors

Ştefan PREDA
2016 Database Systems Journal  
As G1 GC use a prediction model, it is not a real-time collector, means pause time target is not strictly fulfilled, it is just realized with a high probability. Probability is accurate.  ...  Parallel collector or throughput collector performs many minor collections in parallel, reducing Garbage Collection overhead.  ... 
doaj:b9213a234b8040ca9584609c424b0c44 fatcat:s3eqyn6lonanfmad2vbhwk72wi

Assessing the scalability of garbage collectors on many cores

Lokesh Gidra, Gaël Thomas, Julien Sopena, Marc Shapiro
2012 ACM SIGOPS Operating Systems Review  
We present experimental evaluation of the parallel and concurrent garbage collectors present in OpenJDK, a widely-used Java virtual machine.  ...  We show that garbage collection represents a substantial amount of an application's execution time, and does not scale well as the number of cores increases.  ...  [5] propose Garbage First, a solution achieving real-time goals with high probability.  ... 
doi:10.1145/2094091.2094096 fatcat:5mbpemysc5cgpcmybxgnhvt7ii

Assessing the scalability of garbage collectors on many cores

Lokesh Gidra, Gaël Thomas, Julien Sopena, Marc Shapiro
2011 Proceedings of the 6th Workshop on Programming Languages and Operating Systems - PLOS '11  
We present experimental evaluation of the parallel and concurrent garbage collectors present in OpenJDK, a widely-used Java virtual machine.  ...  We show that garbage collection represents a substantial amount of an application's execution time, and does not scale well as the number of cores increases.  ...  [5] propose Garbage First, a solution achieving real-time goals with high probability.  ... 
doi:10.1145/2039239.2039249 dblp:conf/sosp/Gidra0S011 fatcat:3doazzdphzct5ia3hqymmed2cu

Fine-Grained Parallel Compacting Garbage Collection through Hardware-Supported Synchronization

Oswin Horvath, Matthias Meyer
2010 2010 39th International Conference on Parallel Processing Workshops  
Our parallel compacting collector is based on Cheney's copying algorithm, employs a single worklist and distributes garbage collection work on an object-by-object basis.  ...  For this reason, known parallel collectors sacrifice a great deal of work distribution granularity and scalability to keep the synchronization costs acceptable.  ...  real-time garbage collector.  ... 
doi:10.1109/icppw.2010.28 dblp:conf/icppw/HorvathM10 fatcat:jompvnizwndlxjbh7uqurilyzy

Syncopation

David F. Bacon, Perry Cheng, David Grove, Martin T. Vechev
2005 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems - LCTES'05  
Parallel Gen Parallel Alet PNG PNG Gen PNG Alet Regex Regex Gen Regex Alet Allocation (MB/s) Large Objects Small Objects Syncopation: Generational Real-time Garbage Collection in the  ...  Bacon LCTES'05 17 June 2005 Redistributing Collector Work Application Collector Time Space a = a l l o c a t i o n r a t e c = c o l l e c t i o n r a t e Example Application Allocates  ... 
doi:10.1145/1065910.1065937 fatcat:zdb2yhu3bbalrk7mp2fl35ncya

Syncopation

David F. Bacon, Perry Cheng, David Grove, Martin T. Vechev
2005 SIGPLAN notices  
Parallel Gen Parallel Alet PNG PNG Gen PNG Alet Regex Regex Gen Regex Alet Allocation (MB/s) Large Objects Small Objects Syncopation: Generational Real-time Garbage Collection in the  ...  Bacon LCTES'05 17 June 2005 Redistributing Collector Work Application Collector Time Space a = a l l o c a t i o n r a t e c = c o l l e c t i o n r a t e Example Application Allocates  ... 
doi:10.1145/1070891.1065937 fatcat:fdretpvo3bgk5cnb7hlvusmvcy

Mobility of Data in Distributed Hybrid Computing Systems

Philippe Faes, Mark Christiaens, Dirk Stroobandt
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
Data is moved using a novel garbage collection scheme, the dual semispace collector.  ...  The new garbage collector and the distributed memory prove to be an effective means of data migration in distributed hybrid computing systems.  ...  Section 4 outlines a demonstration set-up of our fully functional system, and presents timing results for a real-life application. Related work is outlined in Section 5.  ... 
doi:10.1109/ipdps.2007.370576 dblp:conf/ipps/FaesCS07 fatcat:3tzbiaquavge7dpl5kjhxxccvi

Mark-sweep or copying?

Sylvain Stanchina, Matthias Meyer
2007 Proceedings of the 6th international symposium on Memory management - ISMM '07  
Third, the tospace invariant maintained by many copying collectors allows for incremental compaction and provides the basis for efficient real-time implementations.  ...  It requires far less memory space for real-time behavior and, at the same time, reduces the overall runtime overhead under typical operating conditions.  ...  In this paper, we present a novel mark-compact garbage collection algorithm for real-time applications.  ... 
doi:10.1145/1296907.1296928 dblp:conf/iwmm/StanchinaM07 fatcat:kszebvdqx5dwhdletmse6njz7e

CMS and G1 Collector in Java 7 Hotspot: Overview, Comparisons and Performance Metrics

Clarence JMTauro, Manjunath V Prabhu, Vernon J Saldanha
2012 International Journal of Computer Applications  
Garbage collectors are programs that attempts to reclaim garbage, or memory occupied by objects that are no longer in use by the main program [1].  ...  Enterprise applications are characterized by large amount of live heap data and considerable thread level parallelism.  ...  G1GC (aka "Garbage First Garbage collector") Garbage-First is a server-style garbage collector, targeted for multi-processors with large memories, that meets a real-time goal [2] .  ... 
doi:10.5120/6149-8524 fatcat:hjreau2nzfao3fnygunuk7u7ka
« Previous Showing results 1 — 15 out of 5,406 results