An efficient caching support for critical sections in large-scale shared-memory multiprocessors

  • Authors:

  • Sang Lyul Min;Jean-Loup Baer;Hyoung-Joo Kim

  • Affiliations:

  • Dept. of Computer Science and Engineering, University of Washington, Seattle, WA and IBM T. J. Watson Research Center, P.O.Box 704, Yorktown Heights, NY;Dept. of Computer Science and Engineering, University of Washington, Seattle, WA;School of Information and Computer Science, Georgia Institute of Technology, Atlanta, GA

  • Venue:
  • ICS '90 Proceedings of the 4th international conference on Supercomputing
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Directory-based and software-assisted schemes are the two main approaches to solving the cache coherence problem in large scale shared-memory multiprocessors. Until now, the emphasis in software-assisted schemes has been on ascertaining consistency within parallel constructs such as DoAll or DoAcross loops. In this paper, we propose a timestamped-based approach which also allows caching within critical sections. This scheme combines the best features of software-assisted and directory-based cache coherence protocols. It is based on a compile time analysis of interactions among critical sections and execution time local detection of cache incoherence by comparing the times when a variable was last written and last updated in the cache. A quantitative evaluation based on synthetic traces shows that this scheme results in hit ratios almost as high as in directory-based solutions while significantly reducing the network traffic.