Skip Navigation

The Computer Journal 1971 14(4):378-381; doi:10.1093/comjnl/14.4.378
© 1971 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Austin, B. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A dynamic disc allocation algorithm designed to reduce fragmentation during file reloading

B. J. Austin *

Information Sciences Laboratory, Corporate Research and Development Center, General Electric Company, Schenectady, USA

This paper describes an algorithm for allocating file storage on a disc. An attempt is made to allocate space for a file in contiguous disc addresses. Failure to find such contiguous storage results in formation of a ‘page table’, so that non-contiguous physical addresses appear contiguous in the logical address space presented to the programmer. Since an extra disc operation may be necessary to access a file with a page table, it is desirable to minimise the number of files with page tables, and maximise the chance of finding contiguous storage. This paper describes an attempt to achieve these ends and gives some measurements of its performance. The method uses daily dumping and reloading of the file storage. The allocation procedure has been tuned to optimum performance during reloading, but it continues to function satisfactorily during the remainder of the day.

Received October 1970.

* Information Sciences Laboratory, Corporate Research and Development Center, General Electric Company, Schenectady, NY, 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.