Filters








590 Hits in 7.5 sec

Concurrent compacting garbage collection of a persistent heap

James O'Toole, Scott Nettles, David Gifford
1993 Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93  
Our implementation is the first to provide concurrent and compacting garbage collection of a persistent heap.  ...  Clients can freely access the heap during garbage collection because the collector concurrently builds a compact replica of the heap.  ...  Acknowledgments We would like to thank DEC SRC, where replicating garbage collection was conceived during a very pleasant summer.  ... 
doi:10.1145/168619.168632 dblp:conf/sosp/OTooleNG93 fatcat:v5usd3unqvesde7eaexq76ojr4

A Virtual Machine for a Process Calculus [chapter]

Luís Lopes, Fernando Silva, Vasco T. Vasconcelos
1999 Lecture Notes in Computer Science  
The design and implementation of the virtual machine focuses on performance, compactness, and architecture independence with a view to mobile computing.  ...  This paper presents a virtual machine for a strongly typed, polymorphic, concurrent, object-oriented programming language based on the TyCO process calculus.  ...  Garbage Collection A major concern of the implementation is to make the emulator run programs in as small a heap space as possible. Efficient garbage collection is essential for such a goal.  ... 
doi:10.1007/10704567_15 fatcat:r7m3rx7okzcllbuwywy5x56ocm

Partitioned garbage collection of a large object store

Umesh Maheshwari, Barbara Liskov
1997 SIGMOD record  
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory.  ...  of concurrent mutations.  ...  Introduction We present a new technique to collect garbage in large persistent object stores.  ... 
doi:10.1145/253262.253338 fatcat:44etq26uqjalpg5vctvp36te44

Partitioned garbage collection of a large object store

Umesh Maheshwari, Barbara Liskov
1997 Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97  
This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory.  ...  of concurrent mutations.  ...  Introduction We present a new technique to collect garbage in large persistent object stores.  ... 
doi:10.1145/253260.253338 dblp:conf/sigmod/MaheshwariL97 fatcat:cbqhxljgirgklevz5vbqit4yte

TMOS: A Transactional Garbage Collector [chapter]

John Zigman, Stephen M. Blackburn, J. Eliot B. Moss
2001 Lecture Notes in Computer Science  
Although space reclamation in the context of persistence by reachability can be achieved automatically using garbage collection, relatively few papers address the problem of implementing garbage collection  ...  It is implicit to the principles of orthogonal persistence and is a part of the ODMG 3.0 data objects standard.  ...  By using a persistent heap they make no distinction between the collection of transient and persistent data.  ... 
doi:10.1007/3-540-45498-5_12 fatcat:s237w7wdfrf6vp6kunfak6oalu

Designing a Concurrent Hardware Garbage Collector for Small Embedded Systems [chapter]

Flavius Gruian, Zoran Salcic
2005 Lecture Notes in Computer Science  
One of these aspects is memory management with garbage collection.  ...  This paper describes the design process behind a concurrent, garbage collector unit (GCU), a coprocessor to the Java Optimised Processor.  ...  As a concurrent solution, the locking mechanism introduced to keep memory consistency introduces a small overhead in the system, bringing the benefit of running in parallel with the application.  ... 
doi:10.1007/11572961_23 fatcat:hlcv4v62rjhwnlgnnssylkukqm

A self-maintained memory module supporting DMM

Weixing Ji, Feng Shi, Baojun Qiao
2007 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems - CASES '07  
The whole heap space is divided into two semi-spaces, and a concurrent bidirectional memory compaction algorithm is proposed.  ...  The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management (DMM); however, it is a challenging task to provide efficient  ...  Their implementation is the first to provide concurrent and compacting garbage collection of a persistent heap. Other self-maintained memory modules can also be found in [9] [4] [26] .  ... 
doi:10.1145/1289881.1289916 dblp:conf/cases/JiSQ07 fatcat:u6ut4obhsfeejkvdsudhanime4

Distributed persistent stores

Frans A Henskens, John Rosenberg
1993 Microprocessors and microsystems  
In this paper we investigate the distribution of persistent stores, including the issues of uniformity, unbounded size, and stability.  ...  Considerable effort has been expended over the last decade on the production of persistent stores, for example CMS POMS, CPOMS, MONADS and Thatte's Persistent Memory.  ...  the maintenance of local heaps is to avoid frequent garbage collection of the persistent store).  ... 
doi:10.1016/0141-9331(93)90045-9 fatcat:qn73sfazuzc7reineqz7zeanb4

Mostly-copying reachability-based orthogonal persistence

Antony L. Hosking, Jiawan Chen
1999 Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '99  
persistent heap.  ...  Data type orthogonality: persistence should be a property independent of type. Thus, an object's type should not dictate its longevity.  ...  Aria Novianto participated in many of our early discussions on mostly-copying persistence. This research is supported in part by the National Science Foundation under Grant No.  ... 
doi:10.1145/320384.320427 dblp:conf/oopsla/HoskingC99 fatcat:lk3ibh2uanekzka6kau34i73ay

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  ...  In [18] a semi-space copying collector is adapted to collect a transactional persistent heap.  ... 
doi:10.1109/isorcw.2011.24 dblp:conf/isorc/Higuera-Toledano11 fatcat:xaftln4jnzhtvjee7hg55fhsnu

Mostly-copying reachability-based orthogonal persistence

Antony L. Hosking, Jiawan Chen
1999 SIGPLAN notices  
persistent heap.  ...  Data type orthogonality: persistence should be a property independent of type. Thus, an object's type should not dictate its longevity.  ...  Aria Novianto participated in many of our early discussions on mostly-copying persistence. This research is supported in part by the National Science Foundation under Grant No.  ... 
doi:10.1145/320385.320427 fatcat:qiqvpkyu5jcsfkufomytfhkadm

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.  ...  This taxonomy is used as a framework to explore distribution issues: locality of action, communication overhead and indeterministic communication latency.  ...  Referees' requests for clarification prompted some of the rationalization of the ontology.  ... 
doi:10.1145/292469.292471 fatcat:odrr35rx4jfyvihpguawcljqv4

Skew-space garbage collection

Liangliang Tong, Francis C.M. Lau
2013 Science of Computer Programming  
Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects.  ...  This collector is implemented using the MMTk framework of the Jikes RVM and gives encouraging results against related garbage collection algorithms for the DaCapo and SPECjvm98 benchmarks.  ...  Acknowledgement This work is supported in part by a Hong Kong RGC GRF grant (7141/06E).  ... 
doi:10.1016/j.scico.2011.06.003 fatcat:7vbuskwotnabfn7q6g6uny5zla

Architecture of the PEVM: A High-Performance Orthogonally Persistent Java™ Virtual Machine [chapter]

Brian Lewis, Bernd Mathiske, Neal Gafter
2001 Lecture Notes in Computer Science  
It also uses a new, scalable persistent object store designed to manage more than 80GB of objects.  ...  This paper describes the design and implementation of the PEVM, a new scalable, high-performance implementation of orthogonal persistence for the Java™ platform (OPJ).  ...  Also, our use of direct object pointers minimizes CPU overhead. It ties eviction to garbage collection, but we have still been able to implement a variety of different eviction schemes.  ... 
doi:10.1007/3-540-45498-5_3 fatcat:miue5rjksvcf7n2psdaadhmpwa

Espresso: Brewing Java For More Non-Volatility with Non-volatile Memory [article]

Mingyu Wu, Ziming Zhao, Haoyu Li, Heting Li, Haibo Chen, Binyu Zang, Haibing Guan
2017 arXiv   pre-print
Espresso first provides a general persistent heap design called Persistent Java Heap (PJH) to manage persistent data as normal Java objects.  ...  The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata.  ...  The cost of recoverable GC. We use a micro-benchmark to test the overhead of our recoverable garbage collection mechanism.  ... 
arXiv:1710.09968v1 fatcat:gsiubjxvkzef5iu75ljkfmc7ba
« Previous Showing results 1 — 15 out of 590 results