Exploiting parallelism in a Relational Associative Processor

  • Authors:
  • Paul J. Sadowski;S. A. Schuster

  • Affiliations:
  • University of Toronto;University of Toronto

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Relational Associative Processor (RAP) is a special purpose non-numeric back-end processor used in supporting general Data Base Management Systems. In particular, it is ideally suited for supporting a relational data base. The architecture and instruction set of RAP are discussed in this context. It is the purpose of this paper to show that RAP performance can be enhanced considerably by more fully exploiting its parallel nature. It is shown that a greater degree of concurrent activity will result in better overall performance. An operating system executive to support this high level of concurrency is proposed and modelled using simulation techniques. Both the analytic and simulation results support the value of the proposals.