Sciweavers

438 search results - page 24 / 88
» A Theory of Competitive Analysis for Distributed Algorithms
Sort
View
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
PODC
2004
ACM
14 years 25 days ago
On the design of distributed protocols from differential equations
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
Indranil Gupta
APVIS
2011
12 years 7 months ago
Loose capacity-constrained representatives for the qualitative visual analysis in molecular dynamics
Molecular dynamics is a widely used simulation technique to investigate material properties and structural changes under external forces. The availability of more powerful cluster...
Steffen Frey, Thomas Schlömer, Sebastian Grot...
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 7 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman