Skip Navigation

The Computer Journal 1981 24(4):316-319; doi:10.1093/comjnl/24.4.316
© 1981 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 Harrington, S. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Space efficient copying storage recovery

S. J. Harrington *

Department of Mathematics and Computer Science, State University of New York at Brockport, Brockport, New York, 14420, USA

A compacting storage recovery algorithm is presented which uses a copying gaarbage collection approach, but gains space efficiency by copying recovered cells directly on top of garbage or previously processed cells. This efficiency is gained at the cost of limiting pointers to a single direction. The algorithm is therefore useful where structures are created, searched, and deleted but not where they are modified. The algorith can be used for real-time applications, or where CDR-coding is employed. The time and space requirements of the algorithm are discussed.

Received June 1980.

* Department of Mathematics and Computer Science, State University of New York at Brockport, Brockport, New York 14420, USA


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.