Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Self-stabilization
ACM Transactions on Computer Systems (TOCS)
ICSE '81 Proceedings of the 5th international conference on Software engineering
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Secure web applications via automatic partitioning
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
A fast distributed slicing algorithm
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Facilitating gossip programming with the GossipKit framework
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Gossip-based distribution estimation in peer-to-peer networks
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
| Hi-index | 0.00 |
Code-Partitioning Gossip (CPG) is a novel technique to facilitate implementation and analysis of gossip protocols. A gossip exchange is a pair-wise transaction between two nodes; a gossip system executes an endless sequence of exchanges between nodes chosen by a randomized procedure. Using CPG, the effects of a gossip exchange are succinctly defined by a single function that atomically updates a pair of node states based on their previous values. This function is automatically partitioned via program slicing into executable code for the roles of gossip-initiator and gossip-recipient, and networking code is added automatically. CPG may have concrete benefits for protocol analysis and authoring composite gossip protocols.