×

zbMATH — the first resource for mathematics

An efficient algorithm for allocating paged, drum-like storage. (English) Zbl 0379.68022
MSC:
68W99 Algorithms in computer science
68Q25 Analysis of algorithms and problem complexity
68N01 General topics in the theory of software
PDF BibTeX XML Cite
Full Text: DOI
References:
[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.
[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. · Zbl 0315.68052 · doi:10.1145/321921.321933
[3] E. G. Coffman Jr., and P. J. Denning,Operating System Theory, Prentice Hall, Englewood Cliffs, NJ, 1973.
[4] S. A. Cook,The Complexity of Theorem-proving Procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971), 151–158
[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. · Zbl 0265.68022 · doi:10.1145/321765.321775
[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.
[7] J. Y.-T. Leung,Fast Algorithms for Packing Problems, Ph. D. Thesis, Pennsylvania State University, University Park, PA 16802, March 1977.
[8] Moving Head Disc Controller – Model 412X, Technical Manual, Section 9B, Vol. 1, Modular Computer Systems, Inc.
[9] C. V. Ramamoorthy, and P. R. Blevins,Arranging Frequency Dependent Data on Sequential Memories, AFIPS Conference Proceedings 38 (1971), SJCC, 545–556.
[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–633 · Zbl 0277.68017 · doi:10.1145/321784.321790
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.