Memory utilization efficiency under a class of first-fit algorithms
Abstract
References
Index Terms
- Memory utilization efficiency under a class of first-fit algorithms
Recommendations
A comparison of next-fit, first-fit, and best-fit
“Next-fit” allocation differs from first-fit in that a first-fit allocator commences its search for free space at a fixed end of memory, whereas a next-fit allocator commences its search wherever it previously stopped searching. This strategy is called “...
A comparison of first-fit allocation strategies
ACM '78: Proceedings of the 1978 annual conference - Volume 2Two modifications of the first-fit algorithm of storage allocation presented by Knuth are simulated. They are compared under two measures of efficiency: average allocation search time and memory utilization efficiency.
A class of dynamic memory allocation algorithms
A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the “buddy” system. A generalization is mentioned which includes both of these systems as special ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 223Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in