Sciweavers

11580 search results - page 5 / 2316
» Communication vs. Computation
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Sharing the cost of backbone networks: Simplicity vs. precision
—Internet backbone operators face a trade-off in quantifying the costs that their customers inflict on their infrastructure since the precision of these methods depends on the r...
László Gyarmati, Michael Sirivianos,...
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 8 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
AUTOMATICA
2011
13 years 2 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 1 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
IPPS
2005
IEEE
14 years 1 months ago
Using Leader-Based Communication to Improve the Scalability of Single-Round Group Membership Algorithms
Sigma, the first single-round group membership (GM) algorithm, was recently introduced and demonstrated to operate consistently with theoretical expectations in a simulated WAN en...
Roger Khazan, Sophia Yuditskaya