Process of Membership in Asynchronous Environments

Ricciardi, Aleta; Birman, Kenneth P.

doi:10.21236/ada264399

Cited by 25 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As indication of how challenging specifying and implementing asynchronous membership algorithms is, widely cited research articles that attempt to give formal specifications for the primary partition and partitionable asynchronous membership problem [50] and [24], as well as their updated versions [25], [49], [51], contain some flaws in their formalisms. Anceaum et al [3] showed that algorithms in [49], [50] and [51] allow undesirable executions and the specifications in [24] and [25] can be satisfied by trivial protocols.…”

Section: Historical Backgroundmentioning

confidence: 99%

A group membership algorithm with a practical specification

Franceschetti

Bruck²

2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐThis paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet nontrivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under different models.

show abstract

Section: Historical Backgroundmentioning

confidence: 99%

A group membership algorithm with a practical specification

Franceschetti

Bruck²

2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…The group membership problem has been extensively discussed in the literature, both from a theoretical [1,2,3,4,5] and from a practical point of view (e.g. [6,7,8,9,10,11]). A unique specification of the problem does not exist but, informally speaking, a group membership service must provide its user applications or components with consistent information about the correct and failed processors in the system.…”

Section: Motivation and Scopementioning

confidence: 99%

“…The firstly devised distributed systems were typically characterised by a reduced number of members and stable connections over, for instance, a LAN. Therefore the original distributed services, in particular group membership ones as [8,9], were specified and designed for such scenarios. The cost of the strong consistency provided by classical algorithms may become excessive when the same algorithms are applied to larger scale or rapidly changing systems.…”

Section: Motivation and Scopementioning

confidence: 99%

“…The first and best known group communication system, Isis, implemented as membership service a protocol that solved the Strong Group Membership Problem specified by Ricciardi and Birman [8]. S-GMP is a primary component service whose main goal is to provide a consistent and unique global view of the system.…”

Section: Classical Systemsmentioning

confidence: 99%

“…The basic algorithm for view proposal and confirmation is similar to the S-GMP protocol proposed in [8] for the Isis system, that was described in sect. 2.2.1.…”

Section: Basic Operationmentioning

confidence: 99%

See 2 more Smart Citations

Protocolos de pertenencia a grupos para entornos dinámicos

Polo¹,

Carmén²

View full text Add to dashboard Cite

En primer lugar me gustaría dar las gracias a mi director de tesis, el Profesor Pablo Galdámez Saiz, por su apoyo y colaboración a lo largo del trabajo científico, y por su ayuda para lidiar con los trámites burocráticos en la etapa final de esta tesis.Al Profesor José M. Bernabéu Aubán agradezco que me diera en primer lugar la oportunidad de entrar a formar parte del grupo de Sistemas Distribuidos. Asimismo, agradezco al Instituto Tecnológico de Informática el haberme permitido investigar durante estos años los problemas de algoritmos distribuidos tratados en esta tesis, y compaginar mi trabajo con la investigación y la docencia en otros campos.Mi agradecimiento también es para el profesor Francesc D. Muñoz Escoí, cuya revisión y asesoramiento han sido de gran ayuda a lo largo de las distintas fases del trabajo. También agradezco al profesor Pietro Manzoni las sugerencias que llevaron a desarrollar laúltima parte de esta tesis.Agradezco igualmente a los revisores de este manuscrito los comentarios y correcciones que han contribuido a mejorarlo y a darle su forma definitiva.Quiero dar las gracias a todos los miembros de los grupos de investigación de Sistemas Fiables y Sistemas Distribuidos del ITI, y en particular a Emili Miedes y Juan Carlos García, con quienes he colaborado directamente en algunos de losúltimos trabajos, y a Rubén de Juan por su colaboración en la revisión de este texto. Hago extensivo mi agradecimiento a todos los compañeros del Instituto por su ayuda con los diferentes problemas técnicos y por hacer el trabajo de cada día más ameno y gratificante.Porúltimo, aunque no por ello menos importante, agradezco a toda mi familia su apoyo yánimo. Y muy especialmente agradezco a Emi el que esté siempre a mi lado, confiando en mí y alentándome a continuar cuando no sé cómo seguir adelante.

show abstract

Development of an atomic-broadcast protocol using LOTOS

James

Endler

Gaudel

1999

Softw: Pract. Exper.

View full text Add to dashboard Cite

In this article we report on the development of a group-communication service using the formal specification language LOTOS, and present our experience in using publicly available tools for this purpose. The service implements atomic broadcast through a Two-Phase-Commit protocol, providing at-least-once delivery semantics and with no restriction on message delivery order. First we wrote an informal specification describing the desired properties from the service, the interfaces with the underlying network layer and the upper user layer, and the protocol to be used by the service. Then we developed the formal specification of the protocol in LOTOS. After validating the formal specification and thus having a certain confidence in its adequacy with respect to the informal specification, we derived test cases from the formal specification and implemented the service using the Concert/C distributed programming language. While testing the implementation, we found that most errors were related to unspecified features or bugs in the execution environment. From this experience, we draw our conclusions on the usefulness of software development based on formal techniques.It is the result of a large cooperative project. Its description can be found elsewhere [12]. We could have also used general purpose tools (e.g., PVS from Stanford [13] or HOL from Oxford [14]), but they would have required switching to another logic system, and consequently also a mapping between their formal systems and the one used by LOTOS.Unfortunately, the documentation of the LOTOS tools we selected indicated that more tool support was available than is in fact the case. Even so, we believe that LOTOS was a good choice for the development of a multi-agent communication protocol.

show abstract

Process of Membership in Asynchronous Environments

Cited by 25 publications

References 13 publications

A group membership algorithm with a practical specification

A group membership algorithm with a practical specification

Protocolos de pertenencia a grupos para entornos dinámicos

Development of an atomic-broadcast protocol using LOTOS

Contact Info

Product

Resources

About