An Estimate of the Store Size Necessary for Dynamic Storage Allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Estimate of the Store Size Necessary for Dynamic Storage Allocation

Full text

Pdf (429 KB)

Source

Journal of the ACM (JACM) archive
Volume 18 , Issue 3 (July 1971) table of contents

Pages: 416 - 423

Year of Publication: 1971

ISSN:0004-5411

Author

J. M. Robson

Oxford University, Programming Research Group, Oxford University Computing Laboratory, Oxford, England

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 39, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

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/321650.321658 What is a DOI?

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.

GRAHAM, R.L. Bounds for dynamic storage allocation strategies (unpublished).

CITED BY 11

	J. M. Robson, Bounds for Some Functions Concerning Dynamic Storage Allocation, Journal of the ACM (JACM), v.21 n.3, p.491-499, July 1974
	D. Julia. M. Davies, Memory occupancy patterns in garbage collection systems, Communications of the ACM, v.27 n.8, p.819-825, Aug 1984
	Sandeep Sikka , George Varghese, Memory-efficient state lookups with fast updates, ACM SIGCOMM Computer Communication Review, v.30 n.4, p.335-347, October 2000
	Hans-J. Boehm, Bounding space usage of conservative garbage collectors, ACM SIGPLAN Notices, v.37 n.1, p.93-100, Jan. 2002
	Dennis W. Ting, Allocation and compaction - a mathematical model for memory management, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.311-317, March 29-31, 1976, Cambridge, Massachusetts, United States
	Eric Beyer , Peter Buneman, A Space Efficient Dynamic Allocation Algorithm for Queuing Messages, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.287-294, Oct. 1979
	Hans-J. Boehm, The space cost of lazy reference counting, ACM SIGPLAN Notices, v.39 n.1, p.210-219, January 2004
	Michael G. Luby , Joseph (Seffi) Naor , Ariel Orda, Tight bounds for dynamic storage allocation, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.724-732, January 23-25, 1994, Arlington, Virginia, United States
	Miguel Masmano , Ismael Ripoll , Patricia Balbastre , Alfons Crespo, A constant-time dynamic storage allocator for real-time systems, Real-Time Systems, v.40 n.2, p.149-179, November 2008
	R. L. Graham, Bounds on multiprocessing anomalies and related packing algorithms, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada
	M. Masmano , I. Ripoll , J. Real , A. Crespo , A. J. Wellings, Implementation of a constant-time dynamic storage allocator, Software—Practice & Experience, v.38 n.10, p.995-1026, August 2008