Abstract
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. © 1979, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Beyer, E., & Buneman, P. (1979). A Space Efficient Dynamic Allocation Algorithm for Queuing Messages. ACM Transactions on Programming Languages and Systems (TOPLAS), 1(2), 287–294. https://doi.org/10.1145/357073.357082
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free