144
click to vote
SPAA
15 years 6 months ago
2010 ACM 
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
120
click to vote
SPAA
15 years 6 months ago
2010 ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
114
click to vote
SPAA
15 years 1 months ago
2010 ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
133
click to vote
SPAA
15 years 6 months ago
2010 ACM
Transactional Memory (TM) is a promising technique that simplifies parallel programming for shared-memory applications. To date, most TM systems have been designed to efficientl...
SPAA
15 years 6 months ago
2010 ACM
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
|
Distributed And Parallel Computing