Sciweavers

3497 search results - page 286 / 700
» Making Distributed Applications Robust
Sort
View
KDD
2005
ACM
178views Data Mining» more  KDD 2005»
16 years 5 days ago
Failure detection and localization in component based systems by online tracking
The increasing complexity of today’s systems makes fast and accurate failure detection essential for their use in mission-critical applications. Various monitoring methods provi...
Haifeng Chen, Guofei Jiang, Cristian Ungureanu, Ke...
154
Voted
EUROPAR
2009
Springer
16 years 1 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...
PDP
2008
IEEE
16 years 1 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
INFOSCALE
2006
ACM
16 years 20 days ago
Analysis and comparison of P2P search methods
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
Dimitrios Tsoumakos, Nick Roussopoulos
SPAA
2004
ACM
16 years 3 days ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson