article

Free access

Adaptive exact-fit storage management

Authors:

Rodney R. Oldehoeft,

Stephen J. AllanAuthors Info & Claims

Communications of the ACM, Volume 28, Issue 5

Pages 506 - 511

https://doi.org/10.1145/3532.3536

Published: 01 May 1985 Publication History

PDF eReader

Abstract

Tested against extremes in the characteristics of arrival patterns to dynamic allocation software, the working-set approach outperforms the FIFO method except in the case of completely random request patterns—where the working-set method performs as well as the FIFO method.

References

[1]

Bozman. G., Buco, W. Daly, T. and Tetzlaff, W. Analysis of free storage algorithms-Revisited. IBM Syst. 1. 23, 1 (Feb. 1984). 44-64. A study of VM/SP shows problems with conventional methods, the predictive value of known distributions of request sizes, and the value of caching free blocks.

Digital Library

Google Scholar

[2]

Bozman. G. The software lookaside buffer reduces search overhead with linked lists. Commun. ACM 27, 3 (Mar. 1984). 222-227. The FIFO caching method is explained, and its potential performance improvement is demonstrated.

Digital Library

Google Scholar

[3]

Denning. P.J. The working-set model for program behavior. Commun. ACM I I. 5 (May 1966). 323-333. This is an early discussion of working sets for paged virtual-memory management.

Digital Library

Google Scholar

[4]

Denning. P.J. Working sets past and present. IEEE Trans. Softw. Eng. SE-6.1 (Jan. 1960). 64-64. This is a review of research with working sets up to the date of publication.

Google Scholar

[5]

Knuth. D.E. The Arf of Computer Programming. Vol. 1, Fundamental Algorithms. 2nd ed. Addison-Wesley, Reading, Mass. 1973. pp. 435- 455. A summary and analysis of several dynamic storage-allocation techniques are given.

Digital Library

Google Scholar

[6]

Leverett. B., and Hibbard, P. An adaptive system for dynamic storage allocation. Sofrtu. Pracf. Exper. 12,3 (Mar. 1962). 543-555. An adaptive method in support of an ALGOL 66 implementation is explained.

Google Scholar

[7]

Margolin, B. Parmelee. R. and Schatzoff, M. Analysis of free storage algorithms. IBM Syst. 1. 10, 4 (Dec. 1971). 263-304. An empirical study of CP-67 behavior, a new algorithm with variations, and performance improvements are discussed.

Digital Library

Google Scholar

[8]

McGraw, J. et al. SISAL: Streams and iteration in a singleassignment language. Lang. Ref. Man., Ver. 1.2, Lawrence Livermore National Laboratory M-146, Livermore. Calif. 1964. This is the current reference manual for a functional language being implemented on several parallel computer systems.

Google Scholar

[9]

Saponas, T. Distributed and decentralized control in fully distributed processing systems. Ph.D. dissertation, School of Information and Computer Science, Georgia Institute of Technology, Atlanta, 1961. A simulator program that supported some of this research was instrumented to provide data for this work.

Digital Library

Google Scholar

[10]

Smith, B. A pipelined, shared resource MIMD computer. In Proceodings of the International Conference on Parallel Processing (Bellaire, Mich. Aug. 22-25). IEEE, New York, 1976, pp. 6-6. This is e short introduction to the architecture of the Denelcor HEP multiprocessor system.

Google Scholar

[11]

Weinstock, C. Dynamic storage allocation techniques. Ph.D. dissertation, Carnegie-Mellon Univ., Pittsburgh, Pa., 1976. A classification scheme for storage-allocation techniques is explained, and many methods and their variations are discussed.

Digital Library

Google Scholar

Cited By

View all

Wilson PJohnstone MNeely MBoles D(2005)Dynamic storage allocation: A survey and critical reviewMemory Management10.1007/3-540-60368-9_19(1-116)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60368-9_19
Oldehoeft RCann DAllan S(2005)SISAL: Initial MIMD performance resultsCONPAR 8610.1007/3-540-16811-7_161(120-127)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16811-7_161
Ogasawara T(1995)An algorithm with constant execution time for dynamic storage allocationProceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications10.5555/527074.828551Online publication date: 25-Oct-1995
https://dl.acm.org/doi/10.5555/527074.828551
Show More Cited By

Index Terms

Adaptive exact-fit storage management

Recommendations

On the Asymptotic Optimality of First-Fit Storage Allocation

Suppose requests to store files arrive at a storage facility in a Poisson stream at rate 1. Each file is allocated storage space on arrival and each remains independently for an exponential time with mean l/p. The lengths of the files are assumed to be ...
Storage management in large distributed object-based storage systems
Parity management scheme for a hybrid-storage RAID
SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied Computing

Recently, the notion of RAID technique has been adopted in SSD-based storage systems to improve the system reliability. However, directly applying RAID technique over SSD's would incur performance degradation due to the out-place-update nature of flash ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 28, Issue 5

May 1985

88 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3532

Editor:
Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1985

Published in CACM Volume 28, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
357
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)6

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wilson PJohnstone MNeely MBoles D(2005)Dynamic storage allocation: A survey and critical reviewMemory Management10.1007/3-540-60368-9_19(1-116)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60368-9_19
Oldehoeft RCann DAllan S(2005)SISAL: Initial MIMD performance resultsCONPAR 8610.1007/3-540-16811-7_161(120-127)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-16811-7_161
Ogasawara T(1995)An algorithm with constant execution time for dynamic storage allocationProceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications10.5555/527074.828551Online publication date: 25-Oct-1995
https://dl.acm.org/doi/10.5555/527074.828551
Ogasawara T(1995)An algorithm with constant execution time for dynamic storage allocationProceedings Second International Workshop on Real-Time Computing Systems and Applications10.1109/RTCSA.1995.528746(21-25)Online publication date: 1995
https://doi.org/10.1109/RTCSA.1995.528746
Bonwick J(1994)The slab allocatorProceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 110.5555/1267257.1267263(6-6)Online publication date: 6-Jun-1994
https://dl.acm.org/doi/10.5555/1267257.1267263
Zorn BGrunwald D(1994)Evaluating models of memory allocationACM Transactions on Modeling and Computer Simulation10.1145/174619.1746244:1(107-131)Online publication date: 1-Jan-1994
https://dl.acm.org/doi/10.1145/174619.174624
van Wezenbeek AWithagen W(1993)A survey of memory managementMicroprocessing and Microprogramming10.1016/0165-6074(93)90254-I36:3(141-162)Online publication date: 1-May-1993
https://dl.acm.org/doi/10.1016/0165-6074%2893%2990254-I
Grunwald DZorn B(1993)CustoMallocSoftware—Practice & Experience10.1002/spe.438023080423:8(851-869)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1002/spe.4380230804
Zorn B(1993)The measured cost of conservative garbage collectionSoftware—Practice & Experience10.1002/spe.438023070423:7(733-756)Online publication date: 1-Jul-1993
https://dl.acm.org/doi/10.1002/spe.4380230704
Zorn BGrunwald D(1992)Empirical measurements of six allocation-intensive C programsACM SIGPLAN Notices10.1145/142181.14220027:12(71-80)Online publication date: 1-Dec-1992
https://dl.acm.org/doi/10.1145/142181.142200
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

On the Asymptotic Optimality of First-Fit Storage Allocation

Storage management in large distributed object-based storage systems

Parity management scheme for a hybrid-storage RAID

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations