Abstract
Several mechanisms have been proposed for maintaining cache coherence in large-scale shared memory multiprocessors. Two important factors that distinguish these coherence mechanisms are: 1) the coherence enforcement strategy, such as updating or invalidating, that is used to prevent access to stale data; and 2) the coherence detection strategy, which is used to detect the existence of incoherent cached copies either at compile-time or at run-time. This paper examines the range of performance that can be realized by a compiler-directed coherence mechanism using three different levels of compiler ability. This performance is compared to the performance of the updating and the invalidating directory schemes. In addition, the performance of all three coherence schemes is compared with respect to different cache block sizes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
