Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems

The set agreement problem requires that from n proposed values at most n - 1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but not recover, where processes have different identities, and where all processes initially...

• מחבר ראשי: Tang, J. (author)
• מחברים אחרים: Torres Tandazo, R. (author), Jiménez, E. (author), Arévalo, S. (author)
• פורמט: article
• יצא לאור: 2014
• נושאים: Message passing Asynchronous system; Crash recoveries; Failure Detectors; Message passing systems; Set-agreement
• גישה מקוונת: http://dspace.utpl.edu.ec/handle/123456789/19126