The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Statistical Properties of the Buddy System
Journal of the ACM (JACM)
An algorithm for locating adjacent storage blocks in the buddy system
Communications of the ACM
A simplified recombination scheme for the Fibonacci buddy system
Communications of the ACM
On the external storage fragmentation produced by first-fit and best-fit allocation strategies
Communications of the ACM
A weighted buddy method for dynamic storage allocation
Communications of the ACM
A class of dynamic memory allocation algorithms
Communications of the ACM
A efficient bit table technique for dynamic storage allocation of 2"-word blocks
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
Communications of the ACM
Communications of the ACM
Communications of the ACM
Symbol manipulation in FORTRAN: SASP I subroutines
Communications of the ACM
Communications of the ACM
Ada simulation technology - methods and metrics
ANSS '88 Proceedings of the 21st annual symposium on Simulation
A Buffer-Based Method for Storage Allocation in an Object-Oriented System
IEEE Transactions on Computers
High-level dynamic memory management for object-oriented real-time systems
ACM SIGPLAN OOPS Messenger - Special issue: object-oriented real-time systems
A dynamic storage allocation technique based on memory residence time
Communications of the ACM
Storage management in APL machines
ACM SIGAPL APL Quote Quad
Scalability of dynamic storage allocation algorithms
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
A technique to evaluate dynamic storage management
ANSS '79 Proceedings of the 12th annual symposium on Simulation
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
Memory management: tertiary buddy system
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Implementation of a constant-time dynamic storage allocator
Software—Practice & Experience
A constant-time dynamic storage allocator for real-time systems
Real-Time Systems
Tertiary buddy system for efficient dynamic memory allocation
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
A study of best-fit memory allocators
Computer Languages, Systems and Structures
| Hi-index | 48.24 |
e of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms maintaining separate free space lists for each size of memory block used tended to perform quite well compared with other algorithms. Simple algorithms operating on memory ordered lists (without any free list) performed surprisingly well. Algorithms employing power-of-two block sizes had favorable processing requirements but generally unfavorable memory usage. Algorithms employing LIFO, FIFO, or memory ordered free lists generally performed poorly compared with others.