Content area

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.

Details

1009240
Title
A Model for Coherent Distributed Memory For Race Condition Detection
Publication title
arXiv.org; Ithaca
Publication year
2011
Publication date
Feb 12, 2011
Section
Computer Science
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2015-03-17
Milestone dates
2011-01-21 (Submission v1); 2011-02-12 (Submission v2)
Publication history
 
 
   First posting date
17 Mar 2015
ProQuest document ID
2081358538
Document URL
https://www.proquest.com/working-papers/model-coherent-distributed-memory-race-condition/docview/2081358538/se-2?accountid=208611
Full text outside of ProQuest
Copyright
© 2011. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2019-04-13
Database
ProQuest One Academic