CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A New Leader Election Implementation

Hans Svensson (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)) ; Thomas Arts
Proceedings of the ACM SIGPLAN 2005 Erlang Workshop (2005)
[Konferensbidrag, refereegranskat]

In this article we introduce a new implementation of a leader election algorithm used in the generic leader behavior known as gen_leader. The first open source release of the generic leader \cite{Wiger:impl} contains a few errors. The new implementation is based on a different algorithm, which has been adopted to fulfill the existing requirements. The testing techniques used to identify the errors in the first implementation have also been used to check the implementation we propose here. We even extended the amount of testing and used an additional new testing technique to increase our confidence in the implementation of this very tricky algorithm. The new implementation passed all tests successfully. In this paper we describe the algorithm and we discuss the testing techniques used during the implementation.

Nyckelord: Erlang, Leader election, Implementation

Denna post skapades 2006-08-25. Senast ändrad 2013-08-12.
CPL Pubid: 11245


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Verification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving