article · International Journal of Networking and Computing · 2012
Data Coherency in Distributed Shared Memory
Cited by 2Open access
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.
Cite this paper
Butelle, F., & Coti, C. (2012). Data Coherency in Distributed Shared Memory. International Journal of Networking and Computing, 2(1), 117–130. https://doi.org/10.15803/ijnc.2.1_117
Butelle, Franck, and Camille Coti. “Data Coherency in Distributed Shared Memory.” International Journal of Networking and Computing, vol. 2, no. 1, 2012, pp. 117–30, https://doi.org/10.15803/ijnc.2.1_117.
Butelle, Franck, and Camille Coti. 2012. “Data Coherency in Distributed Shared Memory.” International Journal of Networking and Computing 2 (1): 117–30. https://doi.org/10.15803/ijnc.2.1_117.
Butelle, F. and Coti, C. (2012) ‘Data Coherency in Distributed Shared Memory’, International Journal of Networking and Computing, 2(1), pp. 117–130. Available at: https://doi.org/10.15803/ijnc.2.1_117.
@article{butelle2012data,
title = {{Data Coherency in Distributed Shared Memory}},
author = {Butelle, Franck and Coti, Camille},
journal = {International Journal of Networking and Computing},
volume = {2},
number = {1},
pages = {117--130},
year = {2012},
doi = {10.15803/ijnc.2.1_117}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.