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
Improving the Performance of Buddy Systems
IEEE Transactions on Computers
Disk file allocation based on the buddy system
ACM Transactions on Computer Systems (TOCS)
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Task Allocation in the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Tailored-List and Recombination-Delaying Buddy Systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
A weighted buddy method for dynamic storage allocation
Communications of the ACM
Demand paging through utilization of working sets onr the MANIAC II
Communications of the ACM
A class of dynamic memory allocation algorithms
Communications of the ACM
Fast Allocation and Deallocation with an Improved Buddy System
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Estimating internal memory fragmentation for Java programs
Journal of Systems and Software
Journal of Systems and Software
Memory management: tertiary buddy system
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Dynamic memory allocation systems for minimizing internal fragmentation
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Exact formulas for the buddy system
Information Sciences: an International Journal
Tertiary buddy system for efficient dynamic memory allocation
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
An empirical evaluation of extendible arrays
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
| Hi-index | 0.10 |
The utilization of space and the running speed of the buddy system are considered Equations are derived that give various statistical properties of the buddy system. For the bottom level with Poisson requests and exponential service times the expected amount of space wasted by pairing full cells with empty cells is about 0.513 &rgr;1/2 and the mean time between requests from the bottom level to the next level is about 1.880 &rgr;1/2 &lgr;-1, where &rgr; is the mean number of blocks in use on the bottom level and &lgr;-1 is the mean time between requests for blocks on the bottom level. The results of a number of simulations of the buddy system are also given and compared with the analytical studies.