Thumbnail
Access Restriction
Subscribed

Author Isoda, Sadahiro ♦ Goto, Eiichi ♦ Kimura, Izumi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword List processing ♦ Bit table ♦ Buddy system ♦ L6 ♦ Free storage ♦ Dynamic storage allocation
Abstract An efficient bit table technique for dynamic storage allocation of 2n-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 L6. A number of ideas incorporated in the processor are also described.
Description Affiliation: Tokyo Univ., Japan (Isoda, Sadahiro; Goto, Eiichi; Kimura, Izumi)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 14
Issue Number 9
Page Count 4
Starting Page 589
Ending Page 592


Open content in new tab

   Open content in new tab
Source: ACM Digital Library