Performance analysis of multiprocessor cache consistency protocols using generalized timed Petri nets
- 1 May 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 14 (1) , 9-17
- https://doi.org/10.1145/317531.317534
Abstract
We use an exact analytical technique, based on Generalized Timed Petri Nets (GTPNs), to study the performance of shared bus cache consistency protocols for multiprocessors. We develop a general framework within which the key characteristics of the Write-Once protocol and four enhancements that have been combined in various ways in the literature can be identified and evaluated. We then quantitatively assess the performance gains for each of the four enhancements. We consider three levels of data sharing in our workload models. One of the enhancements substantially improves system performance in all cases. Two enhancements are shown to have negligible effect over the range of workloads analyzed. The fourth enhancement shows a small improvement for low levels of sharing, but shows more substantial improvement as sharing is increased, if we assume a “good access pattern”. The effects of two architectural parameters, the blocksize and the main memory cycle time are also considered.Keywords
This publication has 6 references indexed in Scilit:
- Discrete Time Stochastic Petri NetsIEEE Transactions on Software Engineering, 1985
- A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systemsACM Transactions on Computer Systems, 1984
- Dynamic decentralized cache schemes for mimd parallel processorsPublished by Association for Computing Machinery (ACM) ,1984
- A low-overhead coherence solution for multiprocessors with private cache memoriesPublished by Association for Computing Machinery (ACM) ,1984
- Using cache memory to reduce processor-memory trafficPublished by Association for Computing Machinery (ACM) ,1983
- Cache MemoriesACM Computing Surveys, 1982