Summary: ­­ ­­
Appears in the Proceedings of the 18th Annual International Symposium on Computer Architecture
Detecting Data Races on Weak Memory Systems +
Sarita V. Adve, Mark D. Hill, Barton P. Miller, Robert H.B. Netzer
Computer Sciences Department
University of Wisconsin
Madison, Wisconsin 53706
sarita@cs.wisc.edu
ABSTRACT
For shared­memory systems, the most commonly
assumed programmer's model of memory is sequential
consistency. The weaker models of weak ordering, release
consistency with sequentially consistent synchronization
operations, data­race­free­0, and data­race­free­1 provide
higher performance by guaranteeing sequential consistency
to only a restricted class of programs ­ mainly programs
that do not exhibit data races. To allow programmers to
use the intuition and algorithms already developed for
sequentially consistent systems, it is important to determine
when a program written for a weak system exhibits no data

Source: Adve, Sarita - Department of Computer Science, University of Illinois at Urbana-Champaign

Collections: Computer Technologies and Information Sciences