Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Digital Object Identifier (DOI) 10.1007/s00446-004-0111-6 Distrib. Comput. (2004) :
 

Summary: Digital Object Identifier (DOI) 10.1007/s00446-004-0111-6
Distrib. Comput. (2004) :
Unifying stabilization and termination in message-passing systems
Anish Arora1,
, Mikhail Nesterenko2,
1
Department of Computer and Information Science, Ohio State University, Columbus, OH 43210, USA (e-mail: anish@cis.ohio-state.edu)
2
Department of Computer Science, Kent State University, Kent, OH 44242, USA
Received:
Published online: c Springer-Verlag 2004
Abstract. The paper dispels the myth that it is impossible for
a message-passing program to be both terminating and sta-
bilizing. We consider a rather general notion of termination:
a terminating program eventually stops its execution after the
environment ceases to provide input. We identify termination-
symmetry to be a necessary condition for a problem to admit
a solution with such properties. Our results do confirm that
a number of well-known problems (e.g., consensus, leader
election) do not allow a terminating and stabilizing solution.

  

Source: Arora, Anish - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences