Sciweavers

870 search results - page 81 / 174
» The failure detector abstraction
Sort
View
IANDC
2007
84views more  IANDC 2007»
13 years 9 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
DSN
2009
IEEE
14 years 4 months ago
Fail-Aware Untrusted Storage
We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence y trusted by the clients. We introduce the abstraction of a fai...
Christian Cachin, Idit Keidar, Alexander Shraer
CCECE
2006
IEEE
14 years 3 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner
EPEW
2009
Springer
14 years 3 months ago
Passage-End Analysis
Abstract. Passage-end calculations are a new style of passage measurement for eXtended Stochastic Probes (XSP) [1] which add the ability to split the analysis into several cases de...
Allan Clark, Adam Duguid, Stephen Gilmore
SSS
2009
Springer
127views Control Systems» more  SSS 2009»
14 years 3 months ago
Robustness and Dependability of Self-Organizing Systems - A Safety Engineering Perspective
Abstract. This paper analyses the robustness of self-organizing (engineered) systems to perturbations (faults or environmental changes). It considers that a self-organizing system ...
Giovanna Di Marzo Serugendo