Allocation and compaction - a mathematical model for memory management

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Allocation and compaction - a mathematical model for memory management

Full text

Pdf (515 KB)

Source

Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation table of contents

Cambridge, Massachusetts, United States

Pages: 311 - 317

Year of Publication: 1976

Author

Dennis W. Ting

Sponsors

IFIP WG 7.3 : IFIP WG 7.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 8, Citation Count: 0

Additional Information:

abstract references index terms peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800200.806206 What is a DOI?

ABSTRACT

A mathematical model for the processes of allocation and compaction is developed. The behavior of the most commonly used compaction algorithm is studied under this model. The relationship between time and space and trade-offs between “conservative” and “non-conservative” compaction algorithms are also investigated.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Donald E. Knuth, The Art of Computer Programming Volumes 1-3 Boxed Set, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1998
	2	Lang, B. and Wegbreit, B., "Fast Compactification", Report No. 25-72, Center for Research in Computing Technology, Harvard University, Nov. 1971.
	3	J. M. Robson, An Estimate of the Store Size Necessary for Dynamic Storage Allocation, Journal of the ACM (JACM), v.18 n.3, p.416-423, July 1971 [doi>10.1145/321650.321658]
	4	E. G. Coffman , L. C. Varian, Further experimental data on the behavior of programs in a paging environment, Communications of the ACM, v.11 n.7, p.471-474, July 1968 [doi>10.1145/363397.363398]