Loading...
conference paper
On the Hardness of the Strongly Dependent Decision Problem
January 1, 2019
Icdcn '19: Proceedings Of The 2019 International Conference On Distributed Computing And Networking
We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchronous systems, we show that any algorithm that solves the SDD problem induces a set of executions that is closed with respect to the point-set topology. We also show that the SDD problem is not solvable in the asynchronous system augmented with any arbitrarily strong failure detectors.
Use this identifier to reference this record
Type
conference paper
Web of Science ID
WOS:000484491600013
Authors
Publication date
2019-01-01
Publisher
Published in
Icdcn '19: Proceedings Of The 2019 International Conference On Distributed Computing And Networking
ISBN of the book
978-1-4503-6094-4
Publisher place
New York
Start page
120
End page
123
Subjects
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Bangalore, INDIA | Jan 04-07, 2019 | |
Available on Infoscience
September 20, 2019