gt;> >
>> >
>> https://github.com/madiator/HadoopUSC/blob/developUSC/src/contrib/raid/src/java/org/apache/hadoop/raid/SimpleRegeneratingCode.java
>> >
>> > If there is a high interest in this, you could port the code from
>> Java to C++ and u
> > From: ceph-devel-ow...@vger.kernel.org
> <mailto:ceph-devel-ow...@vger.kernel.org> [ceph-devel-ow...@vger.kernel.org
> <mailto:ceph-devel-ow...@vger.kernel.org>] on behalf of Loic Dachary
> [l...@dachary.org <mailto:l...@dachary.org>]
> > Sent: 30 J
e
> used GF multiplications.
>
> Cheers Andreas.
>
>
>
> From: ceph-devel-ow...@vger.kernel.org [ceph-devel-ow...@vger.kernel.org] on
> behalf of Loic Dachary [l...@dachary.org]
> Sent: 30 June 2014 11:06
> To: Koleos Fuscus
> Cc:
To: Koleos Fuscus
Cc: Ceph Development
Subject: Re: erasure code and coefficients
Hi koleosfuscus,
It clarifies it enough to raise a question : where can I read code (or an
algorithm if not code) that chose the coefficients desirable to implement what
is suggested in the Xorbas paper ?
Cheers
Hi koleosfuscus,
It clarifies it enough to raise a question : where can I read code (or an
algorithm if not code) that chose the coefficients desirable to implement what
is suggested in the Xorbas paper ?
Cheers
On 30/06/2014 10:18, Koleos Fuscus wrote:
> Hi Loic,
>
> I am happy to contribute
Hi Loic,
I am happy to contribute with some clarifications. In fact,
erasure/reliability concepts are not blocking my progress with the
reliability model at ceph. It is the ceph model itself that has some
parts not clear to me, and nobody had time yet to review the state
model diagram that I publi
Hi koleofuscus,
Thanks for the explanation : it is very conforting to know that you understand
this :-) At the risk of being thick, I must say that the very notion of
"coefficient" eludes me. What are they ?
Cheers
On 29/06/2014 20:38, Koleos Fuscus wrote:
> Hello Loic,
> Dimakis (one of the a
Hello Loic,
Dimakis (one of the authors of xorbas) is talking about coefficients
because they want to find a way to reduce the storage overhead used
with LRC. In the simple case used in Fig. 2, a RS (k=10, m=4) has
14/10 storage overhead but when using LRC, the overhead increases to
17/10 because y
Hi Andreas,
In http://anrg.usc.edu/~maheswaran/Xorbas.pdf I get the idea of computing local
coding chunks the way it is implemented in
https://github.com/ceph/ceph/pull/1921 (i.e. delegating encoding / decoding to
other plugins). However, there are theoretical aspects of the paper that I do
no
