Distributed and Parallel Computing

48

SPAA
2010
ACM

198views Distributed And Parallel Com...» more SPAA 2010»

On the bit communication complexity of randomized rumor spreading

14 years 4 months ago

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...

Pierre Fraigniaud, George Giakkoupis

claim paper

Read More »

40

click to vote

SPAA
2010
ACM

120views Distributed And Parallel Com...» more SPAA 2010»

Brief announcement: on speculative replication of transactional systems

14 years 4 months ago

Download www.gsd.inesc-id.pt

Paolo Romano, Roberto Palmieri, Francesco Quaglia,...

claim paper

Read More »

40

click to vote

SPAA
2010
ACM

116views Distributed And Parallel Com...» more SPAA 2010»

Computing the throughput of probabilistic and replicated streaming applications

14 years 4 months ago

Download www.labri.fr

Anne Benoit, Fanny Dufossé, Matthieu Gallet...

claim paper

Read More »

49

click to vote

CCGRID
2010
IEEE

143views Distributed And Parallel Com...» more CCGRID 2010»

FaReS: Fair Resource Scheduling for VMM-Bypass InfiniBand Devices

14 years 4 months ago

Download www.cc.gatech.edu

In order to address the high performance I/O needs of HPC and enterprise applications, modern interconnection fabrics, such as InfiniBand and more recently, 10GigE, rely on network...

Adit Ranadive, Ada Gavrilovska, Karsten Schwan

claim paper

Read More »

40

click to vote

PODC
2010
ACM

121views Distributed and Parallel Com...» more PODC 2010»

Non-blocking binary search trees

14 years 4 months ago

Download www.cse.yorku.ca

Faith Ellen, Panagiota Fatourou, Eric Ruppert, Fra...

claim paper

Read More »

40

click to vote

PODC
2010
ACM

127views Distributed and Parallel Com...» more PODC 2010»

On the theoretical gap between synchronous and asynchronous MPC protocols

14 years 4 months ago

Download www.crypto.ethz.ch

Multiparty computation (MPC) protocols among n parties secure against t active faults are known to exist if and only if

Zuzana Beerliová-Trubíniová, ...

claim paper

Read More »

57

click to vote

PODC
2010
ACM

146views Distributed and Parallel Com...» more PODC 2010»

The k-bakery: local-spin k-exclusion using non-atomic reads and writes

14 years 4 months ago

Download www.cs.toronto.edu

Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...

Robert Danek

claim paper

Read More »

57

click to vote

PODC
2010
ACM

155views Distributed and Parallel Com...» more PODC 2010»

Brief announcement: swarming secrets

14 years 4 months ago

Download ect.bell-labs.com

We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...

Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...

claim paper

Read More »

27

click to vote

PODC
2010
ACM

117views Distributed and Parallel Com...» more PODC 2010»

On utilizing speed in networks of mobile agents

14 years 4 months ago

Download tx.technion.ac.il

Joffroy Beauquier, Janna Burman, Julien Clement, S...

claim paper