Abstract
Imagine an operating system whose daily operation includes accessing various files of a library F, one at a time. Let us assume that the cost of accessing a file is a function only of the location of that file and the location of the file previously accessed. That is, associated with the set L of locations, we have a cost matrix C with cij representing the cost of accessing the file at location j immediately after visiting location i.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Plenum Press, New York
About this chapter
Cite this chapter
Pratt, V.R. (1972). An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds) Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-2001-2_11
Download citation
DOI: https://doi.org/10.1007/978-1-4684-2001-2_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-2003-6
Online ISBN: 978-1-4684-2001-2
eBook Packages: Springer Book Archive