A Space Efficient Dynamic Allocation Algorithm for Queueing Messages.
WHARTON SCHOOL PHILADELPHIA PA DEPT OF DECISION SCIENCES
Pagination or Media Count:
It is often desirable for programs to communicate by queueing messages in shared areas of secondary storage. An algorithm is presented for the allocation of variable size blocks which are to be freed in the same order that they are allocated. Unlike a wrap-around technique, it does not require an initial allocation of a fixed amount of memory, but exploits the ability of many operating systems to increase the available storage as needed. By means of a worst-case analysis, its space efficiency is shown to be optimal. Author
- Theoretical Mathematics