We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

View-based consistency and its implementation

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Huang, Z. ; Dept. of Comput. Sci., Otago Univ., Dunedin, New Zealand ; Sun, C. ; Cranefield, S. ; Purvis, M.

The paper proposes a novel view based consistency model for distributed shared memory. A view is a set of ordinary, data objects that a processor has the right to access in a data-race-free program. The view based consistency model only requires that the data objects of a view are updated before a processor accesses them. Compared with other memory consistency models, the view based consistency model can achieve data selection without user annotation and can reduce much false-sharing effect. This model has been implemented based on TreadMarks. Performance results have shown that for all our applications, the view based consistency model outperforms the lazy release consistency model

Published in:

Cluster Computing and the Grid, 2001. Proceedings. First IEEE/ACM International Symposium on

Date of Conference: