Sciweavers

7133 search results - page 284 / 1427
» Communication algorithms with advice
Sort
View
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
16 years 18 days ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman
EUROPAR
2007
Springer
15 years 10 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
TAAS
2008
70views more  TAAS 2008»
15 years 6 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch
IPPS
1998
IEEE
15 years 11 months ago
Fault-Tolerant Broadcasting in Toroidal Networks
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
Bader Almohammad, Bella Bose
CAV
2007
Springer
122views Hardware» more  CAV 2007»
15 years 10 months ago
Parameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...