Title: About Consistent Hashing Algorithms Describe the issue: Consistent hashing algorithms arrange the hash space as a circle. Owners are assigned for segments of the hash space. When a key is assigned to an owner, the hash of the key is used to determine in which segment the key should be stored. If an owner is removed, then its segment is allocated to its neighbors in the circle. This means that if an owner is removed, most of the hash space remains stable, resulting in less overhead. << Now no hash circle is used Suggestions for improvement: Please refer to development documentation to improve this section or ask developers about new hashing algorithm Additional information:
OK, so Tristan is away and we are close to GA at the moment, so for now I'll just exclude this section. After GA, we can get in touch with the developers and formulate the correct information for this and put it back into the docs. Cloned bug for later development: https://bugzilla.redhat.com/show_bug.cgi?id=1118700 For this bug, I've just excluded the topic. "About Consistent Hashing Algorithms" should not be in the doc anymore.
Ok lets exclude this section and leave it for 6.4 but we should not forget or ignore this bug
Now available on access.redhat.com under the JBoss Data Grid 6.3 documentation label.