A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Relationships between communication models in networks using atomic registers
2006
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In shared-registers versions of this general description, neighbouring processors communicate by reading or writing shared registers, where each read or write is one atomic step. Variants of shared register models occur in the literature. This paper dened two models of shared registers determined by selecting the register
doi:10.1109/ipdps.2006.1639328
dblp:conf/ipps/HighamJ06
fatcat:hhzonscxzndcvlbw5dt2o5w3aa