Role of data-race-free programs in recoverable DSM
Conference Paper
Overview
Additional Document Info
View All
Overview
abstract
In recent years, several algorithms have been proposed to implement distributed share memory systems that can tolerate processor failures. This paper presents a more abstract algorithm to provide a recoverable DSM and analyzes the role of data-race-free programs in recovery to point out where the real benefits of weakly consistent DSM might come from. For this, two specific algorithms that have been proposed for recoverable distributed shared memory are explored.