A Space Efficient Dynamic Allocation Algorithm for Queuing Messages

Authors:
Eric Beyer;Peter Buneman
Affiliations:
General Electric Company, Valley Forge Space Center, P.O. Box 8555, Philadelphia, PA;Department of Computer and Information Science, Moore School of Electrical Engineering D2, University of Pennsylvania, Philadelphia, PA
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1979

Citing 4
Cited 1

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An Estimate of the Store Size Necessary for Dynamic Storage Allocation

Journal of the ACM (JACM)
On the external storage fragmentation produced by first-fit and best-fit allocation strategies

Communications of the ACM

Performance Evaluation of the Computer Network Dynamic Congestion Table Algorthm

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.