A Model for Coherent Distributed Memory For Race Condition Detection
Franck Butelle, Camille Coti

TL;DR
This paper introduces a novel model for distributed shared memory systems utilizing remote data accesses and logical clocks to detect race conditions, simplifying reasoning about parallel program correctness.
Contribution
It proposes a new distributed memory model based on remote data accesses and logical clocks for race condition detection, enhancing analysis of parallel programs.
Findings
New distributed memory model based on remote data accesses
Race detection technique using logical clocks
Improved reasoning about data races in parallel programs
Abstract
We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations, remote direct memory access and OS bypass. This model leads to new interpretations of distributed algorithms allowing us to propose an innovative detection technique of race conditions only based on logical clocks. Indeed, the presence of (data) races in a parallel program makes it hard to reason about and is usually considered as a bug.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Distributed systems and fault tolerance · Distributed and Parallel Computing Systems
