Sciweavers

661 search results - page 45 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay
ICPPW
2009
IEEE
15 years 4 months ago
Decentralized Load Balancing for Improving Reliability in Heterogeneous Distributed Systems
Abstract—A probabilistic analytical framework for decentralized load balancing (LB) strategies for heterogeneous distributed-computing systems (DCSs) is presented with the overal...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
15 years 10 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
DCOSS
2006
Springer
15 years 1 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg