An Efficient Bit Table Technique for Dynamic Storage Allocation of 2^n-word Blocks An efficient bit table technique for dynamic storage allocation of 2^n-word blocks, which requires a minimized amount of memory for bookkeeping purposes, is described. The technique has been tested in an implementation of the list processing language L^6. A number of ideas incorporated in the processor are also described. CACM September, 1971 Isoda, S. Goto, E. bit table, dynamic storage allocation, buddy system, L^6, list processing, free storage 3.89 4.12 4.9 CA710902 JB February 2, 1978 2:33 PM 1389 4 2162 1552 4 2162 1860 4 2162 1957 4 2162 2155 4 2162 2162 4 2162 2162 4 2162 2435 4 2162 2596 4 2162 2768 4 2162 2845 4 2162 2902 4 2162 2955 4 2162 1184 5 2162 1389 5 2162 2162 5 2162 2162 5 2162 2162 5 2162