A simplified recombination scheme for the Fibonacci buddy system
暂无分享,去创建一个
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.
[1] Victor R. Basili,et al. SIMPL-T: A Structured Programming Language. , 1974 .
[2] Daniel S. Hirschberg,et al. A class of dynamic memory allocation algorithms , 1973, CACM.
[3] James A. Hinds. An algorithm for locating adjacent storage blocks in the buddy system , 1975, CACM.