PODC 2009 - PDF Preprint Papers

PODC 2009 Annual ACM Symposium on Principles of Distributed Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PODC-2009 Paper

click to vote

PODC
2009
ACM

259views Distributed and Parallel Com...» more PODC 2009»

Load balancing without regret in the bulletin board model

14 years 12 months ago

Download www.cs.cornell.edu

We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...

Éva Tardos, Georgios Piliouras, Robert D. K...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	259	Load balancing without regret in the bulletin board model	claim
2	232	Distributed and parallel algorithms for weighted vertex cover and other covering problems	claim
3	224	Brief announcement: collaborative measurement of upload speeds in P2P systems	claim
4	203	Max registers, counters, and monotone circuits	claim
5	199	Brief announcement: minimum spanning trees and cone-based topology control	claim
6	185	Fast distributed random walks	claim
7	184	Coloring unstructured wireless multi-hop networks	claim
8	165	Fast scalable deterministic consensus for crash failures	claim
9	153	Memory models: a case for rethinking parallel languages and hardware	claim
10	152	Bounding the locality of distributed routing algorithms	claim
11	149	Oblivious interference scheduling	claim
12	148	Concurrent imitation dynamics in congestion games	claim
13	140	A distributed polylogarithmic time algorithm for self-stabilizing skip graphs	claim
14	138	Brief announcement: locality-based aggregate computation in wireless sensor networks	claim
15	136	Brief announcement: self-assembly as graph grammar as distributed system	claim
16	132	The wireless synchronization problem	claim
17	126	Brief announcement: new bounds for the controller problem	claim
18	123	Simple and efficient asynchronous byzantine agreement with optimal resilience	claim
19	123	Tight bounds for clock synchronization	claim
20	113	Brief announcement: global consistency can be easier than point-to-point communication	claim
21	111	Brief announcement: hardness of broadcasting in wireless networks with unreliable communication	claim
22	111	Brief announcement: (more) efficient pruning of ad-hoc wireless networks	claim
23	107	Randomized mutual exclusion in O(log N / log log N) RMRs	claim
24	105	The weakest failure detector for solving k-set agreement	claim
25	104	Partial synchrony based on set timeliness	claim
26	98	Dynamic atomic storage without consensus	claim
27	97	Correctness of gossip-based membership under message loss	claim
28	97	Preventing versus curing: avoiding conflicts in transactional memories	claim
29	95	On a selfish caching game	claim
30	90	Vertical paxos and primary-backup replication	claim
31	90	Parsimonious flooding in dynamic graphs	claim
32	81	SINR diagrams: towards algorithmically usable SINR models of wireless networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers