Sciweavers

1189 search results - page 18 / 238
» Minimizing churn in distributed systems
Sort
View
PDCAT
2009
Springer
14 years 2 months ago
Analytical Study of Adversarial Strategies in Cluster-based Overlays
Abstract—Awerbuch and Scheideler have shown that peerto-peer overlays networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topo...
Emmanuelle Anceaume, Francisco V. Brasileiro, Roma...
CODES
2009
IEEE
13 years 11 months ago
Minimization of the reconfiguration latency for the mapping of applications on FPGA-based systems
Field-Programmable Gate Arrays (FPGAs) have become promising mapping fabric for the implementation of System-on-Chip (SoC) platforms, due to their large capacity and their enhance...
Vincenzo Rana, Srinivasan Murali, David Atienza, M...
IPPS
2006
IEEE
14 years 1 months ago
A self-stabilizing minimal dominating set algorithm with safe convergence
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
Hirotsugu Kakugawa, Toshimitsu Masuzawa
NSDI
2007
13 years 10 months ago
Network Coordinates in the Wild
Network coordinates provide a mechanism for selecting and placing servers efficiently in a large distributed system. This approach works well as long as the coordinates continue ...
Jonathan Ledlie, Paul Gardner, Margo I. Seltzer
DATE
2003
IEEE
86views Hardware» more  DATE 2003»
14 years 25 days ago
Schedulability Analysis and Optimization for the Synthesis of Multi-Cluster Distributed Embedded Systems
1 We present an approach to schedulability analysis for the synthesis of multi-cluster distributed embedded systems consisting of timetriggered and event-triggered clusters, interc...
Paul Pop, Petru Eles, Zebo Peng