On the weakest failure detector for hard agreement problems

Author： Larrea M.  

Publisher： Elsevier

ISSN： 1383-7621

Source： Journal of Systems Architecture, Vol.49, Iss.7, 2003-10, pp. : 345-353

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The weakest failure detector to solve nonuniform consensus

By Eisler Jonathan   Hadzilacos Vassos   Toueg Sam  

Distributed Computing, Vol. 19, Iss. 4, 2007-03 ,pp. : 335-359

Springer Publishing Company

Access to resources Recommend Favorite

Implementing the weakest failure detector for solving the consensus problem

By Larrea Mikel   Anta Antonio Fernández   Arévalo Sergio  

International Journal of Parallel, Emergent and Distributed Systems, Vol. 28, Iss. 6, 2013-12 ,pp. : 537-555

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the computability power and the robustness of set agreement-oriented failure detector classes

By Mostefaoui Achour   Rajsbaum Sergio   Raynal Michel   Travers Corentin  

Distributed Computing, Vol. 21, Iss. 3, 2008-09 ,pp. : 201-222

Springer Publishing Company

Access to resources Recommend Favorite

The weakest failure detectors to boost obstruction-freedom

By Guerraoui Rachid   Kapałka Michał   Kouznetsov Petr  

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 415-433

Springer Publishing Company

Access to resources Recommend Favorite

Generating highly balanced sudoku problems as hard problems

By Ansótegui Carlos  

Journal of Heuristics, Vol. 17, Iss. 5, 2011-10 ,pp. : 589-614

Springer Publishing Company

Access to resources Recommend Favorite