We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems

Thumbnail Image
Download
Name

MIT-LCS-TM-475.pdf

Size

1.18 MB

Format

Adobe PDF

Checksum (MD5)

d644411b94963b69841177fdf052a210

Author(s)
Chaudhuri, Soma
Date Issued
September 1992
Series/Report no.
MIT-LCS-TM-475
Abstract
We define k-set consensus problem as an extension of the consensus problem, where each processors decides on a single value such that the set of decided values in any run is of size at most k. We require the agreement condition that all values decided upon are initial values of some processor. We show that the problem has a simple ( k - 1 )-resilient protocol in a totally asynchronous system.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.