Abstract
We consider the problem of generic broadcast in asynchronous systems with crashes, a problem that was first studied in [12]. Roughly speaking, given a “conflict” relation on the set of messages, generic broadcast ensures that any two messages that conflict are delivered in the same order; messages that do not conflict may be delivered in different order. In this paper, we define what it means for an implementation generic broadcast to be “thrifty”, and give corresponding implementations that are optimal in terms of resiliency. We also give an interesting application of our results regarding the implementation of atomic broadcast.
Cite
CITATION STYLE
Aguilera, M. K., Delporte-Gallet, C., Fauconnier, H., & Toueg, S. (2000). Thrifty generic broadcast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1914, pp. 268–282). Springer Verlag. https://doi.org/10.1007/3-540-40026-5_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
