Sciweavers

13 search results - page 2 / 3
» The Complexity of Adding Failsafe Fault-Tolerance
Sort
View
DCOSS
2011
Springer
12 years 4 months ago
Construction of connected dominating sets in large-scale MANETs exploiting self-stabilization
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
Stefan Unterschutz, Volker Turau
ICDCS
2010
IEEE
13 years 4 months ago
Complexity Analysis of Weak Multitolerance
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
Jingshu Chen, Sandeep Kulkarni
SPDP
1993
IEEE
13 years 8 months ago
Group Membership in a Synchronous Distributed System
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
Gianluigi Alari, Augusto Ciuffoletti
EGC
2005
Springer
13 years 10 months ago
A Grid Architecture for Comfortable Robot Control
This paper describes a research project about robot control across a computing Grid, first step toward a Grid solution for generic process control. A computational Grid can signi...
Stéphane Vialle, Amelia De Vivo, Fabrice Sa...
COMPUTER
1999
95views more  COMPUTER 1999»
13 years 4 months ago
Wide-Area Computing: Resource Sharing on a Large Scale
abstract over a complex set of resources and provide a high-level way to share and manage them over the network. To be effective, such a system must address the challenges posed by...
Andrew S. Grimshaw, Adam Ferrari, Frederick Knabe,...