Vector multiprocessors with arbitrated memory access

  • Authors:
  • Montse Peiron;Mateo Valero;Eduard Ayguadé;Tomás Lang

  • Affiliations:
  • Department d'Arquitectura de Computadors, Universitat Politècnica de Catalunya, c/ Gran Capità s/n, Mòdul D6, 08071 - Barcelona, Spain;Department d'Arquitectura de Computadors, Universitat Politècnica de Catalunya, c/ Gran Capità s/n, Mòdul D6, 08071 - Barcelona, Spain;Department d'Arquitectura de Computadors, Universitat Politècnica de Catalunya, c/ Gran Capità s/n, Mòdul D6, 08071 - Barcelona, Spain;Department of Electrical and Computer Engineering, University of California at Irvine

  • Venue:
  • ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

The high latency of memory accesses is one of the factors that most contribute to reduce the performance of current vector supercomputers. The conflicts that can occur in the memory modules plus the collisions in the interconnection network in the case of multiprocessors make that the execution time of applications increases significantly. In this work we propose a memory access method that for both cases of vector uniprocessors and multiprocessors allows to perform stream accesses with the smallest possible latency in the majority of the cases. The basic idea is to arbitrate the memory access by defining the order in which the memory modules are visited. The stream elements are requested out of order. In addition, the access method also reduces the cost of the interconnection network.