Quasi-random access memory systems

  • Authors:
  • Gerhard L. Hollander

  • Affiliations:
  • Clevite Research Center, Cleveland, Ohio and The Philco Corporation, Philadelphia, Pa.

  • Venue:
  • AIEE-IRE '56 (Eastern) Papers and discussions presented at the December 10-12, 1956, eastern joint computer conference: New developments in computers
  • Year:
  • 1956
  • The manual use of automatic records

    AIEE-IRE '55 (Eastern) Papers and discussions presented at the the November 7-9, 1955, eastern joint AIEE-IRE computer conference: Computers in business and industrial systems

  • Evaluation of sorting methods

    AIEE-IRE '55 (Eastern) Papers and discussions presented at the the November 7-9, 1955, eastern joint AIEE-IRE computer conference: Computers in business and industrial systems

Quantified Score

Hi-index 0.00

Visualization

Abstract

Synopsis: To select an economical memory for business data-processing systems, the memory characteristics must be matched to the work cycle, processing rate, and permissible delay time of the system. Quasi-random systems feature the low memory cost of serial memories, high processing rates, short delay times, and minimum sorting. An efficient addressing method and rapid cross references reduce the total storage requirements. Typical business examples illustrate the principles.