The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Experience in automatic storage allocation
Communications of the ACM
Programming Systems and Languages.
Programming Systems and Languages.
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Hypercube management in the presence of node failures
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Space Efficient Dynamic Allocation Algorithm for Queuing Messages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
A comparison of next-fit, first-fit, and best-fit
Communications of the ACM
Anomalous behavior of the fifty-percent rule in dynamic memory allocation
Communications of the ACM
Dynamic memory allocation in computer simulation
Communications of the ACM
Methodology and empirical results of program behaviour measurements
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
A technique to evaluate dynamic storage management
ANSS '79 Proceedings of the 12th annual symposium on Simulation
Memory utilization efficiency under a class of first-fit algorithms
ACM '80 Proceedings of the ACM 1980 annual conference
A comparison of first-fit allocation strategies
ACM '78 Proceedings of the 1978 annual conference - Volume 2
An algorithm with constant execution time for dynamic storage allocation
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
An Architecture for Reusable Libraries
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Reducing internal fragmentation in segregated free lists using genetic algorithms
Proceedings of the 2006 international workshop on Workshop on interdisciplinary software engineering research
A tunable hybrid memory allocator
Journal of Systems and Software
Implementation of a constant-time dynamic storage allocator
Software—Practice & Experience
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
Analysis of free-storage algorithms: revisited
IBM Systems Journal
Reduction of storage fragmentation on direct access devices
IBM Journal of Research and Development
A new approach to "storage management" restrictions using the "data quality" concept
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
A study of best-fit memory allocators
Computer Languages, Systems and Structures
Hi-index | 48.28 |
Published comparisons of the external fragmentation produced by first-fit and best-fit memory allocation have not been consistent. Through simulation, a series of experiments were performed in order to obtain better data on the relative performance of first-fit and best-fit and a better understanding of the reasons underlying observed differences. The time-memory-product efficiencies of first-fit and best-fit were generally within 1 to 3 percent of each other. Except for small populations, the size of the request population had little effect on allocation efficiency. For exponential and hyperexponential distributions of requests, first-fit outperformed best-fit; but for normal and uniform distributions, and for exponential distributions distorted in various ways, best-fit out-performed first-fit. It is hypothesized that when first-fit outperforms best-fit, it does so because first-fit, by preferentially allocating toward one end of memory, encourages large blocks to grow at the other end. Sufficient contiguous space is thereby more likely to be available for relatively large requests. Results of simulation experiments supported this hypothesis and showed that the relative performance of first-fit and best-fit depends on the frequency of requests that are large compared to the average request. When the coefficient of variation of the request distribution is greater than or approximately equal to unity, first-fit outperformed best-fit.