A Space Efficient Dynamic Allocation Algorithm for Queueing Messages.

Abstract

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 23, 1979
Accession Number
ADA067602

Entities

People

  • Eric Beyer
  • Peter Buneman

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Contractors
  • Contracts
  • Directives
  • Efficiency
  • Engineering
  • Information Science
  • Language
  • Operating Systems
  • Schools
  • Security
  • Sequences
  • Simulations
  • Transitions
  • Translations

Fields of Study

  • Computer science

Readers

  • Microwave Engineering.
  • Parallel and Distributed Computing.

Technology Areas

  • Space