On 03/05/2019 23:56, Maged Mokhtar wrote:
On 03/05/2019 17:45, Robert Sander wrote:
Hi,
I would be glad if anybody could give me a tip for an erasure code
profile and an associated crush ruleset.
The cluster spans 2 rooms with each room containing 6 hosts and each
host has 12 to 16 OSDs.
On 03/05/2019 17:45, Robert Sander wrote:
Hi,
I would be glad if anybody could give me a tip for an erasure code
profile and an associated crush ruleset.
The cluster spans 2 rooms with each room containing 6 hosts and each
host has 12 to 16 OSDs.
The failure domain would be the room level,
Will m=6 cause huge CPU usage?
Best,
Feng
On Fri, May 3, 2019 at 11:57 AM Ashley Merrick wrote:
>
> I may be wrong, but your correct with your m=6 statement.
>
> Your need atleast K amount of shards available. If you had k=8 and m=2
> equally across 2 rooms (5 each), a faidlure in either room
On Fri, 3 May 2019 at 22:46, Robert Sander wrote:
> The cluster spans 2 rooms
...
> The failure domain would be the room level
...
> Is that even possible with erasure coding?
Sure deal but you'd need slightly more rooms then. For e. g., minimal
EC(2, 1) means (2 + 1) rooms.
--
End of message.
I may be wrong, but your correct with your m=6 statement.
Your need atleast K amount of shards available. If you had k=8 and m=2
equally across 2 rooms (5 each), a faidlure in either room would cause an
outrage.
With M=6 your atleast getting better disk space availability than 3
replication. But
Hi,
I would be glad if anybody could give me a tip for an erasure code
profile and an associated crush ruleset.
The cluster spans 2 rooms with each room containing 6 hosts and each
host has 12 to 16 OSDs.
The failure domain would be the room level, i.e. data should survive if
one of the rooms ha
