A simplified recombination scheme for the Fibonacci buddy system
Authors:
Open Access
- 1 June 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (6) , 331-332
Abstract
A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented.Keywords
This publication has 1 reference indexed in Scilit:
- A class of dynamic memory allocation algorithmsCommunications of the ACM, 1973