By Topic

Performance comparisons of buffer coherency policies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dan, A. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Yu, P.S.

A comparison is made of four buffer coherency policies: check on access, check on access with periodic notification, selective notification, and broadcast invalidation. These policies differ in their basic approaches on how and when the invalidated granules are identified, and hence, achieve different tradeoffs between buffer hits and overhead of notifications. Analytic models are developed to evaluate the buffer hit probability, CPU overhead, and overall response time under these coherency policies. The analysis is validated through simulations. It is found that the difference in buffer hit probabilities is very sensitive to the skewness of the data access and is further affected by the number of nodes, update rates, and the buffer size

Published in:

Distributed Computing Systems, 1991., 11th International Conference on

Date of Conference:

20-24 May 1991