Sciweavers

1113 search results - page 11 / 223
» Performance under Failures of DAG-based Parallel Computing
Sort
View
CONCUR
2006
Springer
13 years 11 months ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
INFOCOM
2010
IEEE
13 years 5 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
PDCAT
2005
Springer
14 years 25 days ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
ICPP
2009
IEEE
14 years 2 months ago
Optimizing the Latency of Streaming Applications under Throughput and Reliability Constraints
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
Anne Benoit, Mourad Hakem, Yves Robert
PDP
2002
IEEE
14 years 8 days ago
Eventually Consistent Failure Detectors
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to sol...
Mikel Larrea, Antonio Fernández, Sergio Ar&...