BIT Numerical Mathematics

, Volume 18, Issue 1, pp 52–66 | Cite as

An efficient algorithm for allocating paged, drum-like storage

  • E. G. CoffmanJr.
  • Donald B. Johnson
  • Joseph Y. -T. Leung
Article
  • 23 Downloads

Abstract

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.

Keywords

Optimal Algorithm Computational Mathematic General Problem Efficient Algorithm Storage Device 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    R. A. Cody, and E. G. Coffmann Jr.,Record Allocation for Minimizing Expected Retrieval Costs on Drum-like Storage Devices, J. ACM 23, 1 (January 1976), 103–115.CrossRefGoogle Scholar
  3. 3.
    E. G. Coffman Jr., and P. J. Denning,Operating System Theory, Prentice Hall, Englewood Cliffs, NJ, 1973.Google Scholar
  4. 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
  5. 5.
    D. D. Grossman, and H. F. Silverman,Placement of Records on a Secondary Storage Device to Minimize Access Time, J. ACM 20, 3 (July 1973), 429–438.CrossRefGoogle Scholar
  6. 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. 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. 8.
    Moving Head Disc Controller — Model 412X, Technical Manual, Section 9B, Vol. 1, Modular Computer Systems, Inc.Google Scholar
  9. 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
  10. 10.
    P. C. Yue, and C. K. Wong,On the Optimality of the Probability Ranking Scheme in Storage Applications, J. ACM 20, 4 (October 1973), 624–633CrossRefGoogle Scholar

Copyright information

© BIT Foundations 1978

Authors and Affiliations

  • E. G. CoffmanJr.
    • 1
    • 2
    • 3
  • Donald B. Johnson
    • 1
    • 2
    • 3
  • Joseph Y. -T. Leung
    • 1
    • 2
    • 3
  1. 1.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaSanta Barbara
  2. 2.Computer Science Department The PennsylvaniaState UniversityUniversity Park
  3. 3.Department of Electrical Engineering and Computer ScienceNorthwestern UniversityEvanston

Personalised recommendations