A Space Efficient Dynamic Allocation Algorithm for Queuing Messages

Eric Beyer; Peter Buneman

doi:10.1145/357073.357082

A Space Efficient Dynamic Allocation Algorithm for Queuing Messages

Eric Beyer, Peter Buneman

School of Informatics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	287-294
Number of pages	8
Journal	ACM Letters on Programming Languages and Systems
Volume	1
Issue number	2
DOIs	https://doi.org/10.1145/357073.357082
Publication status	Published - 1979

Access to Document

10.1145/357073.357082

http://dl.acm.org/citation.cfm?id=357082

Cite this

@article{180fbd55442c4e328820ab864d80c589,

title = "A Space Efficient Dynamic Allocation Algorithm for Queuing Messages",

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.",

author = "Eric Beyer and Peter Buneman",

year = "1979",

doi = "10.1145/357073.357082",

language = "English",

volume = "1",

pages = "287--294",

journal = "ACM Letters on Programming Languages and Systems",

issn = "0164-0925",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - A Space Efficient Dynamic Allocation Algorithm for Queuing Messages

AU - Beyer, Eric

AU - Buneman, Peter

PY - 1979

Y1 - 1979

N2 - 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.

AB - 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.

U2 - 10.1145/357073.357082

DO - 10.1145/357073.357082

M3 - Article

VL - 1

SP - 287

EP - 294

JO - ACM Letters on Programming Languages and Systems

JF - ACM Letters on Programming Languages and Systems

SN - 0164-0925

IS - 2

ER -

A Space Efficient Dynamic Allocation Algorithm for Queuing Messages

Abstract

Access to Document

Fingerprint

Cite this