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:
May. 07, 2019

Filed:

Mar. 27, 2017
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:
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/1018 (2016.01); G06F 12/10 (2016.01); G06F 12/1027 (2016.01); G06F 12/02 (2006.01); A63F 13/45 (2014.01); A63F 13/50 (2014.01); A63F 13/55 (2014.01); A63F 13/79 (2014.01); A63F 13/795 (2014.01);
U.S. Cl.
CPC ...
G06F 3/0638 (2013.01); A63F 13/45 (2014.09); A63F 13/50 (2014.09); A63F 13/55 (2014.09); A63F 13/79 (2014.09); A63F 13/795 (2014.09); 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/0655 (2013.01); G06F 3/0683 (2013.01); G06F 3/0688 (2013.01); G06F 3/0689 (2013.01); G06F 12/0238 (2013.01); G06F 12/0292 (2013.01); G06F 12/10 (2013.01); G06F 12/1018 (2013.01); G06F 12/1027 (2013.01); G06F 17/30292 (2013.01); G06F 17/30327 (2013.01); G06F 17/30336 (2013.01); G06F 2212/7201 (2013.01); Y02D 10/13 (2018.01);
Abstract

A translation system can translate a storage request to a physical address using fields as keys to traverse a map of nodes with node entries. A node entry can include a link to a next node or a physical address. Using a portion of the key as noted in node metadata, a node entry can be determined. When adding node entries to a node, a node utilization can exceed a threshold value. A new node can be created such that node entries are split between the original and new node. Node metadata of the parent node, new node and original node can be revised to identify which parts of the key are used to identify a node entry. When removing node entries from a node, node utilization can cross a minimum threshold value. Node entries from the node can be merged with a sibling, or the map can be rebalanced.


Find Patent Forward Citations

Loading…