1. ABSTRACT One of the biggest disadvantages of nonmoving collectors compared to moving collectors has been their limited ability to deal with memory fragmentation. In this paper, we describe two techniques to reduce fragmentation without the need for moving live data. The first technique reduces internal fragmentation in BiBoP (Big-Bag-of-Pages) like allocators. The second technique reduces ex...

An increasingly prevalent developmental paradigm in garbage collection research is hybridisation; i.e. developing new approaches from synthesis of two existing algorithms. The aim is to combine complementary techniques in a cooperative manner so that desirable qualities from each progenitor are retained, while detractions found in one are ameliorated by the other. This paper describes a previou...

Memory management is a critical issue for many large object-oriented applications, but in C++ only explicit memory reclamation through the delete operator is generally available. We analyse diierent possibilities for memory management in C++ and present a dynamic memory management framework which can be customised to the need of speciic applications. The framework allows full integration and co...

Many modern garbage collectors are generational, operating under the assumption that “most objects die young.” Such collectors allocate all objects in a frequently collected nursery and tenure only surviving objects to a less-frequently collected, older generation. But these survivors induce copying costs upon tenuring. To avoid these costs, pretenuring schemes construct classifiers to predict ...

This paper describes a multi-threaded and incremental garbage collector operating on shared memory architectures. The technique was developed for parallel implementations of the language LCS, a high level parallel programming language. An incremental, page trap based, collection algorithm operates locally on each of the processors. Processors alternatively plays the role of mutator and collecto...

This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked (LL)/store-conditional (SC) or compare-and-swap (CAS) offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary ...

The performance of a memory system depends to great extent on the algorithms used for memory allocation and garbage collection (GC). GC implementers need accurate data about memory objects' behaviour in order to produce high quality garbage collectors optimized for their particular problems. Therefore, different GC-related data should be collected and analysed afterwards. We propose a set of pa...

ProcessBase is a new persistent programming language targeted to support process modelling applications. It forms a central part of a compliant systems architecture, i.e. an architecture that is compliant to the needs of the running application. The ProcessBase Abstract Machine (PBAM) is the execution engine for the language. It uses a heapbased storage architecture together with two contiguous...

Java possesses many advantages for embedded system development, including fast product deployment, portability, security, and a small memory footprint. As Java makes inroads into the market for embedded systems, much effort is being invested in designing real-time garbage collectors. The proposed garbage-collected memory module, a bitmap-based processor with standard DRAM cells is introduced to...

model for garbage collection. Abstract collector algorithms that are parallel, real-time, and spacesafe.collector algorithms that are parallel, real-time, and spacesafe. Proofs of bounded time and space in the abstract models. Implementing lock-free load-balancing. Proper treatment of global variables, stacks, and generations in the presence of concurrency and real-time bounds. The rst implemen...