Performance of cache-based multiprocessors

  • Authors:
  • Fayé A. Briggs;Michel Dubois

  • Affiliations:
  • School of Electrical Engineering, Purdue University, West Lafayette, IN;School of Electrical Engineering, Purdue University, West Lafayette, IN

  • Venue:
  • SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
  • Year:
  • 1981

Quantified Score

Hi-index 0.01

Visualization

Abstract

A possible design alternative to improve the performance of a multiprocessor system is to insert a private cache between each processor and the shared memory. The caches act as high-speed buffers, reducing the memory access time, and affect the delays caused by memory conflicts. In this paper, we study the performance of a multiprocessor system with caches. The shared memory is pipelined and interleaved to improve the block transfer rate, and assumes an L-M organization, previously studied under random word access. An approximate model is developed to estimate the processor utilization and the speedup improvement provided by the caches. These two parameters are essential to a cost-effective design. An example of a design is treated to illustrate the usefulness of this investigation.