Hi,
On 22/01/2015 16:37, Chad William Seys wrote:
Hi Loic,
The size of each chunk is object size / K. If you have K=1 and M=2 it will
be the same as 3 replicas with none of the advantages ;-)
Interesting! I did not see this explained so explicitly.
So is the general explanation of k
Hi Loic,
The size of each chunk is object size / K. If you have K=1 and M=2 it will
be the same as 3 replicas with none of the advantages ;-)
Interesting! I did not see this explained so explicitly.
So is the general explanation of k and m something like:
k, m: fault tolerance of m+1
Hello all,
What reasons would one want k1?
I read that m determines the number of OSD which can fail before loss. But
I don't see explained how to choose k. Any benefits for choosing k1?
Thanks!
Chad.
___
ceph-users mailing list
On 21/01/2015 22:42, Chad William Seys wrote:
Hello all,
What reasons would one want k1?
I read that m determines the number of OSD which can fail before loss. But
I don't see explained how to choose k. Any benefits for choosing k1?
The size of each chunk is object size / K. If you
Of Loic
Dachary
Sent: 21 January, 2015 15:18
To: Chad William Seys; ceph-users@lists.ceph.com
Subject: Re: [ceph-users] erasure coded pool why ever k1?
On 21/01/2015 22:42, Chad William Seys wrote:
Hello all,
What reasons would one want k1?
I read that m determines the number of OSD which
