SOSP09: LADIS: Session 5: Communication
Bulletin Board: A Scalable and Robust Eventually Consistent Shared Memory over a Peer-to-Peer Overlay
Vita Bortnikov (IBM Research), Gregory Chockler (IBM Research), Alexey Roytman (IBM Research) and Mike Spreitzer (IBM Research)
———————–
Faciliating group sharing of data in data centers
Write-Sub service model:
- pub/sub: topic-based communication
- Shared memory
- Group membership
Reliability: periodic refresh of the latest written value
Optimizing Information Flow in the Gossip Objects Platform
Ymir Vigfusson (Cornell University), Ken Birman (Cornell University), Qi Huang (Cornell University) and Deepak Parasam Nataraj (Cornell University)
———————–
When the number of groups increase the gossiping approach looses its bounded bandwidth property.
Solution: Adding a layer to take care of that
assumptions:
- gossip pkts are small
- can be piggy-backed on other messages
- groups are willing to forward the gossips of unrelated groups
You can guess the approach based on the assumptions 
Tags: SOSP 2009: LADIS