Skip Navigation

The Computer Journal 1983 26(2):113-116; doi:10.1093/comjnl/26.2.113
© 1983 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 Leung, C. H. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Analysis of Disc Fragmentation Using Markov Chains

C. H. C. Leung *

Department of Computer Science, University of Reading, Whiteknights Park, Reading, UK

The fragmented storage map is represented by a Markov model which incorporates correlation between locations not necessarily adjacent to one another. Formulae for the average access distance for contiguous and non-contiguous allocations are given. For large storage requirements, the performance penalty of the former can be substantially higher than that of the latter: they are shown to be O(kn) and O(n)respectively, where n is the storage requirement and k>1. The Markov model is also able to achieve close agreement with published measurements.

Received February 1982.

* Department of Computer Science, University of Reading, Whiteknights Park, Reading RG6 2AX, UK


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.