Vast Data Assigned Five Patents

Clustering compute nodes in distributed storage
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,221,799) developed by Horev, Alon, Tel Aviv, Israel, Denworth, Jeff, Red Bank, NJ, Pernsteiner, Andrew, Portland, OR, Mintz, Yuval, Herzliya, Israel, and Turin, Alex, Kiryat Ono, Israel, for “techniques for clustering compute nodes in distributed storage.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A distributed storage system. The distributed storage system includes a plurality of storage nodes (DNodes) wherein the DNodes are configured to store a plurality of elements and a plurality of data blocks, wherein each element is a persistent metadata structure, wherein at least one of the elements store at least one attribute, wherein the at least one attribute includes a plurality of pointers, and a plurality of compute nodes (CNodes) wherein each CNode has access to each of the DNodes, wherein each CNode is assigned to a respective at least one cluster of a plurality of clusters, wherein each CNode is configured to receive at least a portion of access commands directed to the respective at least one cluster and to execute the received access commands based on the plurality of elements.”

The patent application was filed on February 18, 2020 (16/793,444).

Storage system indexed using persistent metadata structures
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,221,777) developed by Hallak, Renen, Tenafly, NJ, Levy, Asaf, Goren, Avi, Tel Aviv, Israel, Vaknin, Yogev, Karkur, Israel, and Zdornov, Vladimir, Kfar Saba, Israel, for a “storage system indexed using persistent metadata structures.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A storage system. The storage system includes a data store including a plurality of data blocks, and an element store, the element store including a plurality of element trees, wherein each element tree includes a plurality of metadata blocks containing pointers, wherein data of the plurality of data blocks is read by navigating at least one of the plurality of element trees, wherein the element store includes a first level and at least one second level, wherein the first level is shared among the plurality of plurality of element trees.”

The patent application was filed on April 24, 2020 (16/857,786).

Distributed scalable storage
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,210,006) developed by Hallak, Renen, Tenafly, NJ, Levy, Asaf, Goren, Avi, Tel Aviv, Israel, Vaknin, Yogev, Karkur, Israel, and Turin, Alex, Kiryat Ono, Israel, for a “distributed scalable storage.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A storage system. The storage system includes a plurality of storage nodes, DNodes, wherein the DNodes are configured to store a plurality of elements and a plurality of data blocks, wherein each element is a persistent metadata structure, wherein at least one of the elements store at least one attribute, wherein the at least one attribute includes a plurality of pointers, wherein at least one of the data blocks is stored in at least one of the elements when the at least one of the data blocks has a size below a threshold size, and a plurality of compute nodes, CNodes, wherein each CNode has access to each of the DNodes, wherein each CNode is configured to receive an access command and to execute the access command based on the elements.”

The patent application was filed on April 23, 2020 (16/856,701).

Using free space to improve erasure code locality
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,150,805) developed by Vaknin, Yogev, Karkur, Israel, for “system and method for using free space to improve erasure code locality.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A system and method for using free space to improve erasure code locality. The method includes logically segmenting an erasure coding data set into a stripe based on an erasure coding scheme, wherein the erasure coding data set includes a plurality of chunks, wherein the plurality of chunks includes a plurality of chunks of systematic data and a plurality of chunks of parity data, wherein the stripe includes free user data, and distributing the stripe across a plurality of non-volatile memory nodes based on the erasure coding scheme, wherein the free user data is stored in at least one memory location among the plurality of non-volatile memory nodes, wherein each non-volatile node is a unit of non-volatile memory.”

The patent application was filed on May 2, 2019 (16/401,691).

Transaction manager
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,113,251) developed by Levy, Asaf, Goren, Avi, Tel Aviv, Israel, and Fienblit, Shachar, Ein Ayala, Israel, for a “transaction manager.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: “A system and method for transaction management. The system includes a processing circuitry, and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: assign a transaction identifier (ID) to a transaction, wherein the transaction includes at least one modification to at least one object stored in a storage system, each object having a persistent state, wherein the transaction ID indicates a state of the transaction, wherein the state of the transaction initially indicates that the transaction is in progress, modify the at least one object, wherein the modifying further comprises adding at least one conditional entry to each object, wherein each conditional entry includes one of the at least one modification that is conditional on the state of the transaction, and update the transaction ID when a termination event occurs, wherein the updating further includes changing the state of the transaction.”

The patent application was filed on September 5, 2018 (16/122,036).