A simple dynamic allocation algorithm is described for queuing variable length messages in memory. The algorithm makes use of the ability of many operating system to increase and decrease available memory as required. Some results describing its efficiency are presented.
|Number of pages||8|
|Journal||ACM Letters on Programming Languages and Systems|
|Publication status||Published - 1979|