Detecting data races on weak memory systems

摘要: For shared-memory systems, the most commonly assumed programmer’s model of memory is sequential consistency. The weaker models weak ordering, release consistency with sequentially consistent synchronization operations, data-race-free-O, and data-race-free-1 provide higher performance by guaranteeing to only a restricted class programs - mainly that do not exhibit data races. To allow programmers use intuition algorithms already developed for it impontant determine when program written system exhibits no In this paper, we investigate extension dynamic race detection techniques systems systems. A potential problem in presence race, fail guarantee therefore may give meaningful results. However, reason practice will preserve at least until “first” races since cannot predict if occur. We formalize condition show allows be dynamically detected. Further, obeyed all proposed implementations full can exploited.