Algorithms for resolving conflicts in dynamic storage allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms for resolving conflicts in dynamic storage allocation

Full text

Pdf (1.29 MB)

Source

Journal of the ACM (JACM) archive
Volume 32 , Issue 2 (April 1985) table of contents

Pages: 327 - 343

Year of Publication: 1985

ISSN:0004-5411

Authors

Brenda S. Baker	AT&T Bell Labs, Murray Hill, NJ
Dan E. Willard	State Univ. of New York, Albany

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 25, Citation Count: 5

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/3149.335126 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.

	1	B S. Baker , E G. Coffman, Jr., Insertion and compaction algorithms in sequentially allocated storage, SIAM Journal on Computing, v.13 n.3, p.600-609, August 1984 [doi>10.1137/0213037]
	2	Kenneth C. Knowlton, A fast storage allocator, Communications of the ACM, v.8 n.10, p.623-624, Oct. 1965 [doi>10.1145/365628.365655]
	3	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	4	KROGDAHL, S.A dynamic storage allocation problem. Inf. Proc. Lett. 2 (1973), 96-99.
	5	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 [doi>10.1145/321832.321846]

CITED BY 5

	Dan E. Willard, Good worst-case algorithms for inserting and deleting records in dense sequential files, ACM SIGMOD Record, v.15 n.2, p.251-260, June 1986
	E G Coffman, Jr. , F T Leighton, A provably efficient algorithm for dynamic storage allocation, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.77-90, May 28-30, 1986, Berkeley, California, United States
	Tian F. Lim , Przemysław Pardyak , Brian N. Bershad, A memory-efficient real-time non-copying garbage collector, ACM SIGPLAN Notices, v.34 n.3, p.118-129, March 1999
	Carsten Vogt, A Buffer-Based Method for Storage Allocation in an Object-Oriented System, IEEE Transactions on Computers, v.39 n.3, p.375-383, March 1990
	Henry G. Baker, The treadmill: real-time garbage collection without motion sickness, ACM SIGPLAN Notices, v.27 n.3, p.66-70, March 1992