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 |