• Aucun résultat trouvé

Fault-tolerant distributed computing scheme based on erasure codes

N/A
N/A
Protected

Academic year: 2021

Partager "Fault-tolerant distributed computing scheme based on erasure codes"

Copied!
6
0
0

Texte intégral

Loading

Références

Documents relatifs

In advance of the increased experiment data rates and monitoring data volumes foreseen for LHC Run 3, starting in 2012, a new infrastructure has been provided by the CERN-IT

The overall goal of the CRIC information system is focused to provide a consistent description of distributed computing models used by the all LHC Experiments, collect and

The article presents the sea waves spectral density identification problem in the linear case and the software and hardware structure proposed to make a solution.. The solution of

However, in NVP, an incitation to increase the number of variants is the fact that two similar errors can outvote a good result in a three-version scheme, whereas they would be

The hierarchy of solutions arising from the above problem is called the “first order hierarchy” (abbreviation for “first order conditional moment hierarchy”), which may possibly

The models allow us to derive the probability distribution function of the system response time which corresponds to a particular consistency level (ONE, ALL or QUORUM)

We will not discuss the technicals properties of the algorithms (robustness, invisibility, speed. ) but only their aims and objectives. With encryption, an

Based on this, the next step will be to propose new unified fault-tolerant parallel and distributed computation models and methods under which our goal is to achieve