Addressing operations for automatic data structure accessing

  • Authors:
  • P. M. Fenwick

  • Affiliations:
  • University of Auckland, Auckland, New Zealand

  • Venue:
  • ACM SIGARCH Computer Architecture News
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although present computers often provide excellent operations for data manipulation, data accessing is generally performed by manipulation of addresses with little recognition of the actual data structure of programs. In an attempt to overcome this deficiency, a technique is presented whereby all of the data-accessing algorithms are separated out into separate code streams which run as coroutines in a special address processor. The operations of this address processor are appropriate to the accessing of arrays and data structures. The resultant system is able to handle, in hardware, most of the data structures which are found in present programming languages.