The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 21, 2017

Filed:

Nov. 26, 2013
Applicant:

Skyera, Llc, San Jose, CA (US);

Inventors:

Radoslav Danilak, Cupertino, CA (US);

Ladislav Steffko, San Ramon, CA (US);

Qi Wu, San Jose, CA (US);

Assignee:

Skyera, LLC, San Jose, CA (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 12/00 (2006.01); G06F 3/06 (2006.01); G06F 17/30 (2006.01); G06F 12/10 (2016.01); G06F 12/1027 (2016.01); G06F 12/1018 (2016.01); G06F 12/02 (2006.01);
U.S. Cl.
CPC ...
G06F 3/0638 (2013.01); G06F 3/0604 (2013.01); G06F 3/065 (2013.01); G06F 3/0619 (2013.01); G06F 3/0631 (2013.01); G06F 3/0641 (2013.01); G06F 3/0683 (2013.01); G06F 3/0689 (2013.01); G06F 12/10 (2013.01); G06F 12/1027 (2013.01); G06F 17/30292 (2013.01); G06F 17/30327 (2013.01); G06F 17/30336 (2013.01); G06F 12/0238 (2013.01); G06F 12/0292 (2013.01); G06F 12/1018 (2013.01); G06F 2212/7201 (2013.01); Y02B 60/1225 (2013.01);
Abstract

A translation system can translate a storage request having multiple fields to a physical address using the fields as keys to traverse a map. By using a map table, multiple storage services can be condensed into a single map traversal. The map can be made of nodes that include one or more node entries. The node entries can be stored in a hashed storage area or sorted storage area of a node. A node entry of root nodes or inner nodes can include a link to a next node. A node entry of a leaf node can include a physical address. Using the request fields as a key to a node, a node entry can be determined. A pointer in a root node entry or inner node entry can be followed to a next node. A physical address in a leaf node can be the translation of the storage request.


Find Patent Forward Citations

Loading…