The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The software lookaside buffler reduces search overhead with linked lists
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Dynamic storage allocation techniques.
Dynamic storage allocation techniques.
Distributed and decentralized control in fully distributed processing systems
Distributed and decentralized control in fully distributed processing systems
DI: an interactive debugging interpreter for applicative languages
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Empirical measurements of six allocation-intensive C programs
ACM SIGPLAN Notices
Evaluating models of memory allocation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
The slab allocator: an object-caching kernel memory allocator
USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
| Hi-index | 48.22 |
Tested against extremes in the characteristics of arrival patterns to dynamic allocation software, the working-set approach outperforms the FIFO method except in the case of completely random request patterns—where the working-set method performs as well as the FIFO method.