Thumbnail
Access Restriction
Subscribed

Author Robson, J. M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The amount of store necessary to operate a dynamic storage allocation system, subject to certain constraints, with no risk of breakdown due to storage fragmentation, is considered. Upper and lower bounds are given for this amount of store, both of them stronger than those established earlier. The lower bound is the exact solution of a related problem concerning allocation of blocks whose size is always a power of 2.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 3
Page Count 9
Starting Page 491
Ending Page 499


Open content in new tab

   Open content in new tab
Source: ACM Digital Library