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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Synchronous Do-All with Crashes and Point-to-Point Messaging. In: Do-All Computing in Distributed Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-69045-2_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-69045-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30918-7
Online ISBN: 978-0-387-69045-2
eBook Packages: Computer ScienceComputer Science (R0)