Patents by Inventor Yogev VAKNIN
Yogev VAKNIN has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11221777Abstract: 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.Type: GrantFiled: April 24, 2020Date of Patent: January 11, 2022Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Vladimir Zdornov
-
Patent number: 11210006Abstract: 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.Type: GrantFiled: April 23, 2020Date of Patent: December 28, 2021Assignee: Vast Data Ltd.Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Alex Turin
-
Patent number: 11150805Abstract: 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.Type: GrantFiled: May 2, 2019Date of Patent: October 19, 2021Assignee: VAST DATA LTD.Inventor: Yogev Vaknin
-
Patent number: 11036652Abstract: The presently disclosed subject matter includes various inventive aspects, which are directed to direct access of a host computer device to a share storage space in a storage system, as well as secured access control of the direct access of the host computer device by a control computer device in the storage system, the direct access including direct read access and direct write access.Type: GrantFiled: September 4, 2018Date of Patent: June 15, 2021Assignee: THE SILK TECHNOLOGIES ILC LTDInventors: Yogev Vaknin, Gilad Hitron, Eyal Gordon, Eran Mann
-
Patent number: 11023141Abstract: A distributed storage system and a method for providing resiliency in distributed storage systems. The distributed storage system includes a plurality of storage nodes including a plurality of disks, wherein the plurality of disks includes a plurality of blocks, wherein the plurality of disks is logically segmented into the plurality of stripes, wherein each of the plurality of stripes is dynamically allocated to a portion of the plurality of blocks distributed across a subset of the plurality of disks; and a plurality of compute nodes, wherein each of the plurality of compute nodes is configured to read data from each of the plurality of storage nodes, wherein each of the plurality of compute nodes is assigned at least one stripe of the plurality of stripes, wherein each of the plurality of compute nodes is configured to write data to each stripe assigned to the compute node.Type: GrantFiled: March 7, 2019Date of Patent: June 1, 2021Assignee: Vast Data Ltd.Inventors: Renen Hallak, Yogev Vaknin, Asaf Levy, Lior Klipper, Eli Malul
-
Publication number: 20210132818Abstract: A system and method for prolonging lifespans of storage drives. The method includes determining an expected expiration time for each of a plurality of blocks, wherein each block includes data of a respective file, wherein the expected expiration of each block is determined based on a file type of the respective file; and writing a portion of data to at least one block of the plurality of blocks based on the expected expiration time for each block.Type: ApplicationFiled: November 3, 2020Publication date: May 6, 2021Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Vladimir ZDORNOV, Yogev VAKNIN, Asaf LEVY, Alex TURIN
-
Publication number: 20210103597Abstract: A system and method for time synchronization. The method includes incrementing at least one instance of a snap value, wherein the at least one instance is stored in at least one storage node of a distributed storage system, wherein each of the at least one instance is incremented using a single-phase commit operation, wherein each of the plurality of storage nodes includes at least one timestamp, wherein each timestamp indicates a corresponding snap time, wherein each snap time is determined by reading one of the at least one instance at a time of creation of the corresponding timestamp.Type: ApplicationFiled: October 3, 2019Publication date: April 8, 2021Applicant: Vast Data Ltd.Inventors: Avi GOREN, Asaf LEVY, Yogev VAKNIN
-
Publication number: 20210006269Abstract: A system and method for erasure coding. The method includes distributing a plurality of data chunks according to a mirroring scheme, wherein the plurality of data chunks is distributed as a plurality of rows among a plurality of non-volatile memory (NVM) nodes, wherein the mirroring scheme defines a plurality of groups, each group including a subset of the plurality of data chunks, wherein each data chunk in a group has a role corresponding to a relative position of the data chunk within the group, wherein data chunks included in the plurality of groups having the same relative positions within their respective groups have the same role, wherein each row of the plurality of rows includes at least one summation data chunk that is a function of at least one data chunk included in the row and of at least one extra data chunk included in at least one other row.Type: ApplicationFiled: July 3, 2019Publication date: January 7, 2021Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Shachar FIENBLIT, Yogev VAKNIN, Eli MALUL, Lior KLIPPER
-
Patent number: 10877671Abstract: A system and method for prolonging lifespans of storage drives. The method includes writing at least a first portion of data to at least one high endurance drive; and writing at least a second portion of data to at least one low endurance drive, wherein a storage system includes a plurality of drives, wherein the plurality of drives includes the at least one high endurance drive and the at least one low endurance drive, wherein each high endurance drive has a longer total lifespan than each low endurance drive.Type: GrantFiled: December 3, 2018Date of Patent: December 29, 2020Assignee: VAST DATA LTD.Inventors: Renen Hallak, Vladimir Zdornov, Yogev Vaknin, Asaf Levy, Alex Turin
-
Publication number: 20200348855Abstract: 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.Type: ApplicationFiled: May 2, 2019Publication date: November 5, 2020Applicant: Vast Data Ltd.Inventor: Yogev VAKNIN
-
Publication number: 20200285401Abstract: A distributed storage system and a method for providing resiliency in distributed storage systems. The distributed storage system includes a plurality of storage nodes including a plurality of disks, wherein the plurality of disks includes a plurality of blocks, wherein the plurality of disks is logically segmented into the plurality of stripes, wherein each of the plurality of stripes is dynamically allocated to a portion of the plurality of blocks distributed across a subset of the plurality of disks; and a plurality of compute nodes, wherein each of the plurality of compute nodes is configured to read data from each of the plurality of storage nodes, wherein each of the plurality of compute nodes is assigned at least one stripe of the plurality of stripes, wherein each of the plurality of compute nodes is configured to write data to each stripe assigned to the compute node.Type: ApplicationFiled: March 7, 2019Publication date: September 10, 2020Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Yogev VAKNIN, Asaf LEVY, Lior KLIPPER, Eli MALUL
-
Publication number: 20200249842Abstract: 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.Type: ApplicationFiled: April 24, 2020Publication date: August 6, 2020Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Vladimir ZDORNOV
-
Publication number: 20200249841Abstract: 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.Type: ApplicationFiled: April 23, 2020Publication date: August 6, 2020Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Alex TURIN
-
Patent number: 10735462Abstract: According to the presently disclosed subject matter, malware induced data compression is harnessed for detecting infection of a host computer by the malicious software, which caused data compression. To this end, compressed ratio of the compressed data received from a host computer is compared with an expected compression ratio and based on the comparison it is determined whether the received data is suspected of being infected by a malware.Type: GrantFiled: December 1, 2016Date of Patent: August 4, 2020Assignee: Kaminario Technologies Ltd.Inventors: Ran Sheri, Yogev Vaknin
-
Patent number: 10678461Abstract: 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; 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.Type: GrantFiled: June 7, 2018Date of Patent: June 9, 2020Assignee: Vast Data Ltd.Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Alex Turin
-
Publication number: 20200174678Abstract: A system and method for prolonging lifespans of storage drives. The method includes writing at least a first portion of data to at least one high endurance drive; and writing at least a second portion of data to at least one low endurance drive, wherein a storage system includes a plurality of drives, wherein the plurality of drives includes the at least one high endurance drive and the at least one low endurance drive, wherein each high endurance drive has a longer total lifespan than each low endurance drive.Type: ApplicationFiled: December 3, 2018Publication date: June 4, 2020Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Vladimir ZDORNOV, Yogev VAKNIN, Asaf LEVY, Alex TURIN
-
Patent number: 10656857Abstract: 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 each pointer points to one of the plurality of metadata blocks or to one of the data blocks, wherein data of the plurality of data blocks is read by navigating at least one of the plurality of element trees.Type: GrantFiled: June 7, 2018Date of Patent: May 19, 2020Assignee: Vast Data Ltd.Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Vladimir Zdornov
-
Publication number: 20200142591Abstract: A system for finding differences between a given block in two periodical snapshots. Data indicative of a coarse grain data structure corresponding to the given logical unit and including a plurality of entries wherein each entry is representative of a write or no-write operation to a respective memory chunk of in the logical unit. Data indicative of at least one bloom filter, each bloom filter includes a plurality of bits wherein each group of bits is representative of a probable false positive write indication or no-write operation to a block in the chunk. In response to a request to compare between a given block in at least two periodic snapshots: an older snapshotj and a younger snapshotk, perform: with respect to the block in a chunk, test in a selected bloom filter if the corresponding group of bits is representative of a false positive, and provide “possible snapshots difference” indication.Type: ApplicationFiled: November 7, 2018Publication date: May 7, 2020Applicant: Kaminario Technologies Ltd.Inventors: Amir Sasson, Doron Tal, Gilad Hitron, Yogev Vaknin
-
Patent number: 10599359Abstract: The presently disclosed subject matter includes a data storage system and method for the purpose of migrating data in a distributed storage system comprising a plurality of separate storage areas.Type: GrantFiled: October 25, 2017Date of Patent: March 24, 2020Assignee: Kaminario Technologies Ltd.Inventor: Yogev Vaknin
-
Publication number: 20190377490Abstract: 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; 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.Type: ApplicationFiled: June 7, 2018Publication date: December 12, 2019Applicant: Vast Data Ltd.Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Alex TURIN