JOURNAL ARTICLE

Performance of cache-based multiprocessors

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.

Keywords:
Computer science Parallel computing Multiprocessing Cache Speedup Block (permutation group theory) Shared memory Cache coherence Cache pollution CPU cache Cache algorithms

Metrics

4
Cited By
2.08
FWCI (Field Weighted Citation Impact)
11
Refs
0.89
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Parallel Computing and Optimization Techniques
Physical Sciences →  Computer Science →  Hardware and Architecture
Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Optimization and Search Problems
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Performance of cache-based multiprocessors

Fayé A. BriggsMichel Dubois

Journal:   ACM SIGMETRICS Performance Evaluation Review Year: 1981 Vol: 10 (3)Pages: 181-190
JOURNAL ARTICLE

The performance of cache-coherent ring-based multiprocessors

Luiz André BarrosoMichel Dubois

Journal:   ACM SIGARCH Computer Architecture News Year: 1993 Vol: 21 (2)Pages: 268-277
© 2026 ScienceGate Book Chapters — All rights reserved.