A Model for Coherent Distributed Memory For Race Condition Detection

I tiakina i:

Ngā taipitopito rārangi puna kōrero
I whakaputaina i:	arXiv.org (Feb 12, 2011), p. n/a
Kaituhi matua:	Butelle, Franck
Ētahi atu kaituhi:	Coti, Camille
I whakaputaina:	Cornell University Library, arXiv.org
Ngā marau:	Network interface cards Distributed shared memory Interface cards Algorithms Parallel programming Clocks Distributed memory
Urunga tuihono:	Citation/Abstract Full text outside of ProQuest
Ngā Tūtohu:	Tāpirihia he Tūtohu Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!

Whakaahuatanga
Whakarāpopotonga:	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
Puna:	Engineering Database