Accession Number:

ADA088319

Title:

COMPLEXITY OF Storage and Retrieval Problems.

Descriptive Note:

Final rept. 14 Jan 77-30 May 80,

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE

Personal Author(s):

Report Date:

1980-07-18

Pagination or Media Count:

6.0

Abstract:

This project has investigated the costs imposed by the need for communication between user and machine and between components of the machine in solving data-processing problems. There have been three principal substasks. The first, exploration of the minimal costs of storing and accessing information in simple data structures, is the oldest and results have been reported in several publications. The second is the design of minimax optimal universal codeword sets which can be used to represent any message set efficiently by assigning messages in order of decreasing probability to codewords in order of increasing length. A manuscript giving results of this research is almost ready for publication. The third is the exploration of switching networks which can be used for communication between a number of processors engaged in common computational task that work is still in an early stage and is not yet ready for publication. Author

Subject Categories:

  • Computer Programming and Software
  • Computer Hardware
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE