Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Evaluating the Performance of Four Snooping Cache Coherency Protocols

Susan J. Eggers and Randy H. Katz

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-88-478
December 1988

http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/CSD-88-478.pdf

Write-invalidate and write-broadcast coherency protocols have been criticized for being unable to achieve good bus performance across all cache configurations. In particular, write-invalidate performance can suffer as block size increases; and large cache sizes will hurt write-broadcast. Read-broadcast and competitive snooping extensions to the protocols have been proposed to solve each problem.

Our results indicate that the benefits of the extensions are limited. Read-broadcast reduces the number of invalidation misses, but at a high cost in processor lockout from the cache. The net effect can be an increase in total execution cycles. Competitive snooping benefits only those programs with high per processor locality of reference to shared data. For programs characterized by inter-processor contention for shared addresses, competitive snooping can degrade performance by causing a slight increase in bus utilization and total execution time.


BibTeX citation:

@techreport{Eggers:CSD-88-478,
    Author = {Eggers, Susan J. and Katz, Randy H.},
    Title = {Evaluating the Performance of Four Snooping Cache Coherency Protocols},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1988},
    Month = {Dec},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6054.html},
    Number = {UCB/CSD-88-478},
    Abstract = {Write-invalidate and write-broadcast coherency protocols have been criticized for being unable to achieve good bus performance across all cache configurations. In particular, write-invalidate performance can suffer as block size increases; and large cache sizes will hurt write-broadcast.  Read-broadcast and competitive snooping extensions to the protocols have been proposed to solve each problem.   <p>Our results indicate that the benefits of the extensions are limited. Read-broadcast reduces the number of invalidation misses, but at a high cost in processor lockout from the cache. The net effect can be an increase in total execution cycles. Competitive snooping benefits only those programs with high per processor locality of reference to shared data. For programs characterized by inter-processor contention for shared addresses, competitive snooping can degrade performance by causing a slight increase in bus utilization and total execution time.}
}

EndNote citation:

%0 Report
%A Eggers, Susan J.
%A Katz, Randy H.
%T Evaluating the Performance of Four Snooping Cache Coherency Protocols
%I EECS Department, University of California, Berkeley
%D 1988
%@ UCB/CSD-88-478
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6054.html
%F Eggers:CSD-88-478