A Model for Coherent Distributed Memory For Race Condition Detection
保存先:
| 出版年: | arXiv.org (Feb 12, 2011), p. n/a |
|---|---|
| 第一著者: | |
| その他の著者: | |
| 出版事項: |
Cornell University Library, arXiv.org
|
| 主題: | |
| オンライン・アクセス: | Citation/Abstract Full text outside of ProQuest |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 抄録: | 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. |
|---|---|
| ISSN: | 2331-8422 |
| ソース: | Engineering Database |