Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/29478
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Mosaic: A non-intrusive complete garbage collector for DSM systems |
Author: | Munro, D. Falkner, K. Lowry, M. Vaughan, F. |
Citation: | Proceedings of the First International Symposium on Cluster Computing and the Grid, 2001: pp. 539-546 |
Publisher: | IEEE COMPUTER SOCIETY |
Publisher Place: | LOS ALAMITOS, CALIFORNIA, USA |
Issue Date: | 2001 |
ISBN: | 0769510108 9780769510101 |
Conference Name: | IEEE/ACM International Symposium on Cluster Computing and the Grid (1st : 2001 : Brisbane, Australia) |
Editor: | Buyya, R. Mohay, G. Roe, P. |
Statement of Responsibility: | David S. Munro, Katrina E. Faulkner, Matthew C. Lowry and Francis A. Vaughn |
Abstract: | Little work has been done in garbage collection algorithms for distributed systems. Mosaic is a safe and complete garbage collection system that collects garbage in object systems that are implemented above page-based distributed shared memory systems. It is non-intrusive in its impact on application performance. Mosaic partitions the virtual address space into separately managed regions, which form the basic unit of object storage. Garbage collection operates by moving objects between these partitions in a manner that associates live objects together leaving unreachable objects behind so that partitions may be reused. To provide for safe operation of the collector a distributed update protocol maintains sufficient local knowledge of pointer duplication and destruction to allow safe determination of object reachability without the need to globally trace the object space. Mosaic exploits the semantics of pointer operations in type-safe object languages to allow for a weakened consistency model of pointer update during garbage collection. |
Description: | ©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
DOI: | 10.1109/CCGRID.2001.923240 |
Published version: | http://dx.doi.org/10.1109/ccgrid.2001.923240 |
Appears in Collections: | Aurora harvest 2 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hdl29478 .pdf | 443.38 kB | Publisher's PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.