Sciweavers

7133 search results - page 57 / 1427
» Communication algorithms with advice
Sort
View
CDC
2010
IEEE
148views Control Systems» more  CDC 2010»
13 years 3 months ago
Convergence rates of consensus algorithms in stochastic networks
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
Stacy Patterson, Bassam Bamieh
IPPS
2000
IEEE
14 years 1 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 9 months ago
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...
IJFCS
2006
82views more  IJFCS 2006»
13 years 8 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
ICCAD
2003
IEEE
188views Hardware» more  ICCAD 2003»
14 years 5 months ago
Communication-Aware Task Scheduling and Voltage Selection for Total Systems Energy Minimization
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
Girish Varatkar, Radu Marculescu