Re: erasure coded pool why ever k>1?

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



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 replicas, space of 1/k*(m+k) replicas,  plus 
slowness
?

So one should never bother with k=1 b/c:
k=1, m:  fault tolerance of m+1, space of m+1 replicas, plus slowness.
(therefore, just use m+1 replicas!)

but
k=2, m=1:
might be useful instead of 2 replicas b/c it has fault tolerance of 2 
replicas, space of 1/2*(1+2) = 3/2 = 1.5 replicas, plus slowness.

And
k=2, m=2:
which should be as tolerant as 3 replicas,  but take up as much space as 
(1/2)*(2+2)=2 replicas (right?).

Thanks again!
Chad.
_______________________________________________
ceph-users mailing list
ceph-users@xxxxxxxxxxxxxx
http://lists.ceph.com/listinfo.cgi/ceph-users-ceph.com




[Index of Archives]     [Information on CEPH]     [Linux Filesystem Development]     [Ceph Development]     [Ceph Large]     [Ceph Dev]     [Linux USB Development]     [Video for Linux]     [Linux Audio Users]     [Yosemite News]     [Linux Kernel]     [Linux SCSI]     [xfs]


  Powered by Linux