Skip Navigation

The Computer Journal 1987 30(2):119-127; doi:10.1093/comjnl/30.2.119
© 1987 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Newman, I. A.
Right arrow Articles by Woodward, M. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Hybrid Multiple Processor Garbage Collection Algorithm

I. A. Newman *, R. P. Stallard * and M. C. Woodward *

Department of Computer Studies, University of Technology, Loughborough, Leicestershire LE11 3TU, UK

Dynamic storage allocation schemes continue to grow in popularity. The problem of automatically reclaiming space that is no longer used is the principal drawback of such memory management schemes. Several previous papers have described algorithms for the reclaim of unused space to be carried out on separate Garbage Collection processors. This paper gives an overview of existing algorithms and proposes a new combined approach that overcomes some of the problems with these algorithms. Results are presented for several algorithms executed on a four-processor system that suggest that the proposed combined approach offers an improved performance when executed on shared-memory multiprocessors.

Received September 1985.

* Department of Computer Studies, University of Technology, Loughborough, Leicestershire LE11 3TU


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.