Two new gossip algorithms achieve fast rumor spreading with polylog n message sizes: one in O(c log n / Φ_c) rounds optimal in weak conductance, and one in Õ(D + √n) rounds independent of conductance.
In: Proceed- ings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures , ACM, pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
SemanticLock uses an operation conflict graph to enable more concurrent operations than standard locks, shown on a toy array and augmented ConcurrentHashMap.
Monadic fixed-point logic with counting is proposed as a natural specification language for properties on improvement graphs in social choice and games, with an efficient model checking algorithm whose complexity depends on graph size.
citing papers explorer
-
Fast Gossip-based Rumor Spreading using Small Messages
Two new gossip algorithms achieve fast rumor spreading with polylog n message sizes: one in O(c log n / Φ_c) rounds optimal in weak conductance, and one in Õ(D + √n) rounds independent of conductance.
-
Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph
SemanticLock uses an operation conflict graph to enable more concurrent operations than standard locks, shown on a toy array and augmented ConcurrentHashMap.