An efficient algorithm for allocating paged, drum-like storage
Cody and Coffman have studied the problem of distributing a set of a equal-size records among the sectors of a drum-like storage device so as to minimize the average rotational latency cost. This paper is an extension of that work. We employ the same model but a different latency delay function. Motivated by the NP-completeness of the general problem and the fact that an arbitrary assignment can have an expected latency cost almost twice that of an optimal assignment, we propose and analyze a fast heuristic whose performance compares favorably with that of an optimal algorithm.
KeywordsOptimal Algorithm Computational Mathematic General Problem Efficient Algorithm Storage Device
Unable to display preview. Download preview PDF.
- 1.R. A. Cody,Allocation Algorithms for Minimizing Expected Access Costs on Drum-like Storage Devices, Ph.D. Thesis, Pennsylvania State University, University Park, PA 16802, November 1974.Google Scholar
- 3.E. G. Coffman Jr., and P. J. Denning,Operating System Theory, Prentice Hall, Englewood Cliffs, NJ, 1973.Google Scholar
- 4.S. A. Cook,The Complexity of Theorem-proving Procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158Google Scholar
- 6.R. M. Karp,Reducibility among Combinatorial Problems, in Complexity of Computer Computation, R. E. Miller and J. W. Tatcher (eds.), Plenum Press, New York (1972), 85–104.Google Scholar
- 7.J. Y.-T. Leung,Fast Algorithms for Packing Problems, Ph. D. Thesis, Pennsylvania State University, University Park, PA 16802, March 1977.Google Scholar
- 8.Moving Head Disc Controller — Model 412X, Technical Manual, Section 9B, Vol. 1, Modular Computer Systems, Inc.Google Scholar
- 9.C. V. Ramamoorthy, and P. R. Blevins,Arranging Frequency Dependent Data on Sequential Memories, AFIPS Conference Proceedings 38 (1971), SJCC, 545–556.Google Scholar