Abstract
The implementation of synchronous communication primitives over asynchronous message-passing networks is investigated. Efficient algorithms are presented for the committee coordination problem and its more dynamic version called the first-order interaction problem. A new notion of strong fairness called 1- sf and algorithms achieving it are also described. It is further shown that any stronger notion of fairness cannot be implemented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
