The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
Efficient implementation of the first-fit strategy for dynamic storage allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Storage management in IBM APL systems
IBM Systems Journal
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
Anomalous behavior of the fifty-percent rule in dynamic memory allocation
Communications of the ACM
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
A tunable hybrid memory allocator
Journal of Systems and Software
Grid capacity planning with negotiation-based advance reservation for optimized QoS
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Analysis of free-storage algorithms: revisited
IBM Systems Journal
Scalable node allocation for improved performance in regular and anisotropic 3D torus supercomputers
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
A study of best-fit memory allocators
Computer Languages, Systems and Structures
| Hi-index | 48.25 |
“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 “modified first-fit” by Shore [2] and is significantly faster than the first-fit allocator. To evaluate the relative efficiency of next-fit (as well as to confirm Shore's results) a simulation was written in Basic Plus on the PDP-11, using doubly linked lists to emulate the memory structure of the simulated computer. The simulation was designed to perform essentially in the manner described in [2]. The results of the simulation of the three methods show that the efficiency of next-fit is decidedly inferior to first-fit and best-fit when the mean size of the block requested is less than about 1/16 the total memory available. Beyond this point all three allocation schemes have similar efficiencies.