Parallel Garbage Collection for Shared Memory Multiprocessors
نویسندگان
چکیده
We present a multiprocessor “stop-the-world” garbage collection framework that provides multiple forms of load balancing. Our parallel collectors use this framework to balance the work of root scanning, using static overpartitioning, and also to balance the work of tracing the object graph, using a form of dynamic load balancing called work stealing. We describe two collectors written using this framework: pSemispaces, a parallel semispace collector, and pMarkcompact, a parallel markcompact collector.
منابع مشابه
Scalable Real-time Parallel Garbage Collection for Symmetric Multiprocessors
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...
متن کاملPaclib | a System for Parallel Algebraic Computation on Shared Memory Multiprocessors
This paper gives an overview on the structure and the use of Paclib, a new system for parallel algebraic computation on shared memory computers. Paclib has been developed as a professional tool for the simple design and eecient implementation of parallel algorithms in computer algebra and related areas. It provides concurrency, shared memory communication , non-determinism, speculative parallel...
متن کاملA New Library for Parallel Algebraic Computation
We give an overview on Paclib, a library for parallel algebraic computation on shared memory multiprocessors. Paclib is essentially a package of C functions that provide the basic objects and methods of computer algebra in a parallel context. The Paclib programming model supports concurrency, shared memory communication, non-determinism and speculative parallelism. The system is based on a heap...
متن کاملPredicting Scalability of Parallel Garbage Collectors on Shared Memory Multiprocessors
This paper describes a performance prediction model of parallel mark-sweep garbage collectors (GC) on shared memory multiprocessors. The prediction model takes as inputs the heap snapshot and memory access cost parameters (latency and occupancy), and outputs performance of the parallel marking on any given number of processors. It takes such factors as parallelism (width of the graph), cache mi...
متن کاملParallelization of Garbage Collection in a Ccp System, Penny
An important property of logic, object-oriented, functional, and other high-level programming languages is their automatic management of dynamically allocated storage. These languages often take the burden of memory management away from the programmer. The language support system provides the programmer with a virtually unlimited amount of storage by running a garbage collector to reclaim stora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001