Memory requirements for balanced computer architectures

  • Authors:
  • H. T. Kung

  • Affiliations:
  • Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
  • Year:
  • 1986

Quantified Score

Hi-index 0.01

Visualization

Abstract

One particular result is that to balance an array of p linearly connected PEs for performing matrix computations such as matrix multiplication and matrix triangularization, the size of each PE's local memory must grow linearly with p. Thus, the larger the array is, the larger each PE's local memory must be.