Filters








143 Hits in 4.8 sec

The mapping collector

Michal Wegiel, Chandra Krintz
2008 SIGARCH Computer Architecture News  
We introduce the Mapping Collector (MC), which leverages virtual memory operations to reclaim and consolidate free space without moving objects and updating pointers.  ...  Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap fragmentation and enable fast linear object allocation.  ...  Acknowledgments We thank the anonymous reviewers for providing insightful comments on this paper. This work was funded in part by NSF grants CCF-0444412, CNS-0546737, and CNS-0627183.  ... 
doi:10.1145/1353534.1346294 fatcat:l3miimwxojgltf52zkqstxkciq

The mapping collector

Michal Wegiel, Chandra Krintz
2008 Proceedings of the 13th international conference on Architectural support for programming languages and operating systems - ASPLOS XIII  
We introduce the Mapping Collector (MC), which leverages virtual memory operations to reclaim and consolidate free space without moving objects and updating pointers.  ...  Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap fragmentation and enable fast linear object allocation.  ...  Acknowledgments We thank the anonymous reviewers for providing insightful comments on this paper. This work was funded in part by NSF grants CCF-0444412, CNS-0546737, and CNS-0627183.  ... 
doi:10.1145/1346281.1346294 dblp:conf/asplos/WegielK08 fatcat:aooimfd3gffrhmtw2d4t4sh6ke

The mapping collector

Michal Wegiel, Chandra Krintz
2008 SIGPLAN notices  
We introduce the Mapping Collector (MC), which leverages virtual memory operations to reclaim and consolidate free space without moving objects and updating pointers.  ...  Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap fragmentation and enable fast linear object allocation.  ...  Acknowledgments We thank the anonymous reviewers for providing insightful comments on this paper. This work was funded in part by NSF grants CCF-0444412, CNS-0546737, and CNS-0627183.  ... 
doi:10.1145/1353536.1346294 fatcat:kmd6gulx4va4pjtuddugv6nd6a

The mapping collector

Michal Wegiel, Chandra Krintz
2008 ACM SIGOPS Operating Systems Review  
We introduce the Mapping Collector (MC), which leverages virtual memory operations to reclaim and consolidate free space without moving objects and updating pointers.  ...  Moreover, state-of-the-art MREs commonly implement compaction to eliminate heap fragmentation and enable fast linear object allocation.  ...  Acknowledgments We thank the anonymous reviewers for providing insightful comments on this paper. This work was funded in part by NSF grants CCF-0444412, CNS-0546737, and CNS-0627183.  ... 
doi:10.1145/1353535.1346294 fatcat:yrmruk2jhfchxmudkuqveehcey

Retrofitting Parallelism onto OCaml [article]

KC Sivaramakrishnan, Stephen Dolan, Leo White, Sadiq Jaffer, Tom Kelly, Anmol Sahoo, Sudha Parimala, Atul Dhiman, Anil Madhavapeddy
2020 arXiv   pre-print
OCaml is also one of the few modern managed system programming languages to lack support for shared memory parallel programming.  ...  This paper describes the design, a full-fledged implementation and evaluation of a mostly-concurrent garbage collector (GC) for the multicore extension of the OCaml programming language.  ...  development team for their comments on the design of the Multicore OCaml GC.  ... 
arXiv:2004.11663v2 fatcat:be6scb2xtrek7iewll2fcdp5yy

Heap compression for memory-constrained Java environments

G. Chen, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, B. Mathiske, M. Wolczko
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
An important characteristic of this collector is that it compresses objects when heap compaction is not sufficient for creating space for the current allocation request.  ...  In addition to employing compression, we also consider a heap management strategy and associated garbage collector, called MCL (Mark-Compact-Lazy Allocate), based on lazy allocation of object portions.  ...  We know that the mark-compact garbage collector needs to update each reference in the heap after compaction.  ... 
doi:10.1145/949327.949330 fatcat:omb5k26mwra2zopp34dri3r3bi

Heap compression for memory-constrained Java environments

G. Chen, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, B. Mathiske, M. Wolczko
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
An important characteristic of this collector is that it compresses objects when heap compaction is not sufficient for creating space for the current allocation request.  ...  In addition to employing compression, we also consider a heap management strategy and associated garbage collector, called MCL (Mark-Compact-Lazy Allocate), based on lazy allocation of object portions.  ...  We know that the mark-compact garbage collector needs to update each reference in the heap after compaction.  ... 
doi:10.1145/949305.949330 dblp:conf/oopsla/ChenKVIMW03 fatcat:m5cghlszprajvcxddt7binxo4a

Heap compression for memory-constrained Java environments

G. Chen, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, B. Mathiske, M. Wolczko
2003 SIGPLAN notices  
An important characteristic of this collector is that it compresses objects when heap compaction is not sufficient for creating space for the current allocation request.  ...  In addition to employing compression, we also consider a heap management strategy and associated garbage collector, called MCL (Mark-Compact-Lazy Allocate), based on lazy allocation of object portions.  ...  We know that the mark-compact garbage collector needs to update each reference in the heap after compaction.  ... 
doi:10.1145/949343.949330 fatcat:xspjejbeqreerg4xnycp7h4jea

Javelus: A Low Disruptive Approach to Dynamic Software Updates

Tianxiao Gu, Chun Cao, Chang Xu, Xiaoxing Ma, Linghao Zhang, Jian Lu
2012 2012 19th Asia-Pacific Software Engineering Conference  
We in this paper present Javelus, a dynamic Java update system with greatly reduced pausing time but without sacrificing update flexibility and system efficiency.  ...  Existing techniques for dynamically updating Java programs may introduce noticeable pauses during which these programs are unable to function.  ...  We implement a lazy object update method for Javelus. The experiment results have shown that Javelus is low disruptive yet efficient.  ... 
doi:10.1109/apsec.2012.55 dblp:conf/apsec/GuCXMZL12 fatcat:a7vu542x3jck5jk6abgm2arrym

C4

Gil Tene, Balaji Iyengar, Michael Wolf
2011 Proceedings of the international symposium on Memory management - ISMM '11  
We discuss updates to the collector's management of the heap for efficient generational collection and provide throughput and pause time data while running sustained workloads.  ...  It uses a read barrier to support concurrent compaction, concurrent remapping, and concurrent incremental update tracing.  ...  Incremental and low-pause-time collectors are also becoming popular again. Pizlo et al [15] discuss three such algorithms.  ... 
doi:10.1145/1993478.1993491 dblp:conf/iwmm/TeneIW11 fatcat:u4y3353npzfnfoeauhygkqeawq

C4

Gil Tene, Balaji Iyengar, Michael Wolf
2011 SIGPLAN notices  
We discuss updates to the collector's management of the heap for efficient generational collection and provide throughput and pause time data while running sustained workloads.  ...  It uses a read barrier to support concurrent compaction, concurrent remapping, and concurrent incremental update tracing.  ...  Incremental and low-pause-time collectors are also becoming popular again. Pizlo et al [15] discuss three such algorithms.  ... 
doi:10.1145/2076022.1993491 fatcat:psokqfzsyra3pkyzztc23tnn64

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.  ...  Second, they do not suffer from unpredictable fragmentation overheads since they inherently compact the heap.  ...  Other algorithms only compact a small region of the heap at a time in order to reduce the pauses caused by compaction.  ... 
doi:10.1145/1296907.1296928 dblp:conf/iwmm/StanchinaM07 fatcat:kszebvdqx5dwhdletmse6njz7e

Simple, fast, and safe manual memory management

Piyus Kedia, Manuel Costa, Matthew Parkinson, Kapil Vaswani, Dimitrios Vytiniotis, Aaron Blankstein
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
Experimental results from our implementation based on the C# native compiler show that this design achieves up to 3x reduction in peak working set and run time. • We replace the garbage collected heap  ...  with a manually managed heap.  ...  pause times.  ... 
doi:10.1145/3062341.3062376 dblp:conf/pldi/KediaCPVVB17 fatcat:4n33qk7mezfilnlj4q4f5p6cla

Dynamic prediction of collection yield for managed runtimes

Michal Wegiel, Chandra Krintz
2009 Proceeding of the 14th international conference on Architectural support for programming languages and operating systems - ASPLOS '09  
General-purpose MREs commonly implement parallel and/or concurrent garbage collection and employ compaction to eliminate heap fragmentation.  ...  Our predictor allows MREs to avoid low-yield collections and thereby improve resource management.  ...  Acknowledgments We thank the anonymous reviewers for their insightful comments. This work was funded in part by NSF grants CCF-0444412, CNS-CAREER-0546737, and CNS-0627183.  ... 
doi:10.1145/1508244.1508278 dblp:conf/asplos/WegielK09 fatcat:du432k527badfenscp4nm35rpu

Dynamic prediction of collection yield for managed runtimes

Michal Wegiel, Chandra Krintz
2009 SIGPLAN notices  
General-purpose MREs commonly implement parallel and/or concurrent garbage collection and employ compaction to eliminate heap fragmentation.  ...  Our predictor allows MREs to avoid low-yield collections and thereby improve resource management.  ...  Acknowledgments We thank the anonymous reviewers for their insightful comments. This work was funded in part by NSF grants CCF-0444412, CNS-CAREER-0546737, and CNS-0627183.  ... 
doi:10.1145/1508284.1508278 fatcat:qf245d7vgvbfpli2u5vukmrwde
« Previous Showing results 1 — 15 out of 143 results