Browse Prior Art Database

Efficient method of employing Flash storage as high speed tier for consistent hashing based object storage

IP.com Disclosure Number: IPCOM000245524D
Publication Date: 2016-Mar-15
Document File: 6 page(s) / 106K

Publishing Venue

The IP.com Prior Art Database

Abstract

By introducing the new type of virtual node with new algorithm to consistent hashing algorithm, we can integrate the high speed Flash/SSD drive with low speed HDD in the same hash ring. One object can be deloyed in Flash/SSD and HDD at the same time. So that it can speed up the read/write operation meanwhile save the space of Flash/SSD.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 54% of the total text.

Page 01 of 6

Efficient method of employing Flash storage as high speed tier for consistent hashing based object storage

Consistent Hashing algorithm is wildly used in object storage system. In current solution, it is based on mapping each object to a point on the edge of a circle (or equivalently, mapping each object to a real angle). The system maps each available machine (or other storage bucket) to many pseudo-randomly distributed virtual nodeon the edge of the same circle.

To find where an object should be placed, the system finds the location of that object's key on the edge of the circle; then walks around the circle until falling into the first virtual node it encounters (or equivalently, the first available virtual node with a higher angle). The result is that each virtual node contains all the resources located between it and the previous one.

Each virtual node will map to multiple physical node(system). The mapping between object, virtual node and physical node is shown as below:

1



Page 02 of 6

So the current solution have some drawbacks:

1. No considering of the Flash storage performance advantage.

2. All virtual node and physical node are random distributed. Can not map the specific hot object only to Flash storage so that to utilize Flash storage high performance.

3. Can not map the hot objects excluding others meanwhile to Flash storage.


1. Define a new type of virtual node named "black hole" virtual node.

* Map the black hole virtual node to Flash storage

* Object which hash valu...