Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A note on the Elusive Atomic Register Uri Abraham
 

Summary: A note on the Elusive Atomic Register
Uri Abraham
Department of Mathematics and Computer Science
Ben-Gurion University, Be'er Sheva, Israel.
June 10, 2001
Abstract
A time-e∆cient version of the Elusive Atomic Register of Singh,
Anderson, and Gouda [SAG] is presented and its correctness is proved.
The concurrent time-complexity of the protocol is 6 for the Reader and
3 for the Writer (it is in the order of the number of Readers in the
protocol of [SAG]).
Our aim is to advocate a \behavioral" approach to the correctness
proofs of protocols, and this protocol serves as an example. System
executions, and not histories (sequences of states) are the structures
to which the correctness conditions refer to. An advantage of system
executions is the ease of dealing with both the higher{level and lower{
level views (granularities) of the runs (Lamport [1986]). We exploit
this advantage and our proof is clearly divided into a higher and a
lower level. The higher{level part of the proof does not refer to the
protocol but to abstract properties, which are in fact shared by an-

  

Source: Abraham, Uri - Departments of Computer Science & Mathematics, Ben-Gurion University

 

Collections: Mathematics; Computer Technologies and Information Sciences