How heketi allocates bricks

Updated -

The simple ring allocator is Heketi's algorithm used to determine where to place bricks across a single cluster. The goal of the algorithm is to return to the caller a list of devices, where the order of devices have been arranged according to their failure domain. For example, the caller could receive a list like the following:

[ 
    {Zone3, Node 192.168.13.100, Device /dev/sd...

Subscriber exclusive content

A Red Hat subscription provides unlimited access to our knowledgebase, tools, and much more.

Current Customers and Partners

Log in for full access

Log In

New to Red Hat?

Learn more about Red Hat subscriptions

Using a Red Hat product through a public cloud?

How to access this content