Mutual Exclusion Between Neighboring Nodes in a Tree that Stabilizes Using Read/Write Atomicity

Gheorghe Antonoiu and Pradip K. Srimani

Abstract
Paper Abstract = Our purpose inthis paper is to propose a new protocol that can ensuremutual exclusion between neighboring nodes in a treestructured distributed system, i.e., under the given protocolno two neighboring nodes can execute their critical sectionsconcurrently. This protocol can be used torun a serial model self stabilizing algorithm in adistributedenvironment that accepts as atomic operations only send amessage, receive a message an update a state. Unlike thescheme our protocoldoes not use time-stamps (which are basically unboundedintegers); our algorithm usesonly bounded integers (actually, the integers can assumevalues only 0, 1, 2 and 3) and can be easily implemented.
Contact
Pradip K Srimani
Department of Computer Science,Colorado State University,Ft. Collins, CO 80523 USA,
srimani@cs.colostate.edu