Synchronous Do-All with Crashes and Point-to-Point Messaging

We now study theDo-All problem assuming that only point-to-point messaging is available for processors to communicate. This in contrast with the assumptions in the previous chapter, we considered the Do-All prob- lem assuming that processors where assisted by an oracle or that reliable multicast was available. As one would expect, in the point-to-point messag- ing setting the problem becomes more challenging and different techniques need to be employed in order to obtain efficient (deterministic) algorithms for Do-All.


Local Knowledge Majority Phase Deterministic Algorithm Communication Graph Message Complexity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Personalised recommendations