Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Self-Stabilizing `-Exclusion Uri Abraham Shlomi Dolev y Ted Herman z Irit Koll x
 

Summary: Self-Stabilizing `-Exclusion
Uri Abraham  Shlomi Dolev y Ted Herman z Irit Koll x
June 11, 2001
Abstract
Our work presents a self-stabilizing solution to the `-exclusion problem. This problem
is a well-known generalization of the mutual-exclusion problem in which up to `, but
never more than `, processes are allowed simultaneously in their critical sections. Self-
stabilization means that even when transient failures occur and some processes crash,
the system nally resumes its regular and correct behavior. The model of communication
assumed here is that of shared memory, in which processes use single-writer multiple-reader
regular registers.
 Department of Mathematics and Computer Science, Ben-Gurion University, Beer-Sheva, 84105, Israel.
Email: abraham@cs.bgu.ac.il.
y
Department of Mathematics and Computer Science, Ben-Gurion University, Beer-Sheva, 84105, Israel.
Partially supported by the Israeli ministry of science and arts grant #6756195. Email: dolev@cs.bgu.ac.il.
z Department of Computer Science, University of Iowa. Email: herman@cs.uiowa.edu. This work is supported
by NSF CAREER award CCR-9733541.
x Elta, Israel Ltd. and Department of Mathematics and Computer Science, Ben-Gurion University, Beer-
Sheva, 84105, Israel. Email: iritk@is.elta.co.il.

  

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

 

Collections: Mathematics; Computer Technologies and Information Sciences