A Model for Coherent Distributed Memory For Race Condition Detection
Guardado en:
| Publicado en: | arXiv.org (Feb 12, 2011), p. n/a |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Publicado: |
Cornell University Library, arXiv.org
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full text outside of ProQuest |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2081358538 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2081358538 | ||
| 045 | 0 | |b d20110212 | |
| 100 | 1 | |a Butelle, Franck | |
| 245 | 1 | |a A Model for Coherent Distributed Memory For Race Condition Detection | |
| 260 | |b Cornell University Library, arXiv.org |c Feb 12, 2011 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a 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. | |
| 653 | |a Network interface cards | ||
| 653 | |a Distributed shared memory | ||
| 653 | |a Interface cards | ||
| 653 | |a Algorithms | ||
| 653 | |a Parallel programming | ||
| 653 | |a Clocks | ||
| 653 | |a Distributed memory | ||
| 700 | 1 | |a Coti, Camille | |
| 773 | 0 | |t arXiv.org |g (Feb 12, 2011), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2081358538/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/1101.4193 |