Patents by Inventor Renen Hallak

Renen Hallak 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).

  • Publication number: 20210349643
    Abstract: A system and method for scalable storage. The method includes placing a lock on a portion of a storage node, wherein placing the lock further comprises replacing a first value stored in the storage node with a second value using an atomic operation, wherein the atomic operation replaces the first value with the second value when the first value indicates an empty lock status, wherein the second value indicates an active lock status; allocating a storage location in the storage node by updating metadata stored in the locked portion of the storage node when the lock has been placed; and releasing the lock, wherein releasing the lock further comprises replacing the second value with a third value, wherein the third value indicates the empty lock status.
    Type: Application
    Filed: May 5, 2020
    Publication date: November 11, 2021
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Alex TURIN
  • Patent number: 11061569
    Abstract: A system and method for efficiently providing snapshots in storage systems. The method includes creating a plurality of snaplines for a storage system, each snapline having metadata including a timestamp and a status marker for each of a plurality of offset ranges, wherein each offset range corresponds to data stored in the storage system, the storage system including a plurality of compute nodes, wherein the timestamp of each snapline is a value of a global counter at a time of creation of the snapline, wherein the global counter is uniform among the plurality of compute nodes; and creating a snapshot based on the plurality of snaplines and a time value, wherein the snapshot indicates a snapline of the plurality of snaplines that is not to be deleted, wherein the timestamp of the snapline that is not to be deleted corresponds to the time value.
    Type: Grant
    Filed: January 7, 2019
    Date of Patent: July 13, 2021
    Assignee: Vast Data Ltd.
    Inventors: Renen Hallak, Asaf Levy, Avi Goren, Vladimir Zdornov
  • Patent number: 11064051
    Abstract: Systems and methods for leader election. A disclosed method includes sending, by a first compute node of a plurality of compute nodes, a plurality of remote procedure calls (RPCs) to a plurality of storage boxes according to an order, wherein each of the plurality of RPCs causes a leader election algorithm to execute in one of the plurality of storage boxes; and updating a state of the first compute node to “leader” when a result of executing the leader election algorithm for each of the plurality of RPCs indicates that the first compute node is elected as a leader node.
    Type: Grant
    Filed: December 11, 2019
    Date of Patent: July 13, 2021
    Assignee: Vast Data Ltd.
    Inventors: Ido Yellin, Alon Horev, Yuval Mintz, Alex Turin, Renen Hallak
  • Publication number: 20210182273
    Abstract: A system and method for determining ancestry in directed acyclic graphs (DAGs). The method includes accessing a first node of a plurality of nodes in a DAG to obtain first change time data and ancestry data, wherein the plurality of nodes includes at least one point of interest, wherein the first change time data indicates a time of a first change to ancestry of the closest point of interest (CPOI); accessing a CPOI of the first node to obtain second change time data, wherein the second change time data indicates a time of a most recent change to ancestry of the CPOI; comparing the first change time data with the second change time data; and determining ancestry of the first node, wherein the ancestry of the first node is determined based on the ancestry data when the first change time data matches the second change time data.
    Type: Application
    Filed: December 16, 2019
    Publication date: June 17, 2021
    Applicant: Vast Data Ltd.
    Inventors: Vladimir ZDORNOV, Asaf LEVY, Asaf WEISMAN, Avi GOREN, Renen HALLAK
  • Publication number: 20210185150
    Abstract: Systems and methods for leader election. A disclosed method includes sending, by a first compute node of a plurality of compute nodes, a plurality of remote procedure calls (RPCs) to a plurality of storage boxes according to an order, wherein each of the plurality of RPCs causes a leader election algorithm to execute in one of the plurality of storage boxes; and updating a state of the first compute node to “leader” when a result of executing the leader election algorithm for each of the plurality of RPCs indicates that the first compute node is elected as a leader node.
    Type: Application
    Filed: December 11, 2019
    Publication date: June 17, 2021
    Applicant: Vast Data Ltd.
    Inventors: Ido YELLIN, Alon HOREV, Yuval MINTZ, Alex TURIN, Renen HALLAK
  • Patent number: 11023141
    Abstract: 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: Grant
    Filed: March 7, 2019
    Date of Patent: June 1, 2021
    Assignee: Vast Data Ltd.
    Inventors: Renen Hallak, Yogev Vaknin, Asaf Levy, Lior Klipper, Eli Malul
  • Publication number: 20210132818
    Abstract: 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: Application
    Filed: November 3, 2020
    Publication date: May 6, 2021
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Vladimir ZDORNOV, Yogev VAKNIN, Asaf LEVY, Alex TURIN
  • Publication number: 20210006269
    Abstract: 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: Application
    Filed: July 3, 2019
    Publication date: January 7, 2021
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Shachar FIENBLIT, Yogev VAKNIN, Eli MALUL, Lior KLIPPER
  • Publication number: 20200409885
    Abstract: A storage system is provided. The storage system includes a backplane; a plurality of single port storage devices; and a plurality of controllers, wherein the backplane routes a plurality of interconnection lanes between the plurality of controllers and the plurality of single port storage devices, wherein the plurality of controllers is configured to: enable at least one second interconnection lane of the plurality of interconnection lanes when a first controller of the plurality of controllers has failed, wherein a first interconnection lane of the plurality of interconnection lanes is between the first controller and a first single port storage device of the plurality of single port storage devices, wherein the at least one second interconnection lane is between a second controller of the plurality of controllers and the first single port storage device.
    Type: Application
    Filed: June 25, 2019
    Publication date: December 31, 2020
    Applicant: Vast Data Ltd.
    Inventors: Jeff DENWORTH, Renen HALLAK, Dan GLUSKIN, Alon HOREV, Yuval MINTZ
  • Patent number: 10877671
    Abstract: 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: Grant
    Filed: December 3, 2018
    Date of Patent: December 29, 2020
    Assignee: VAST DATA LTD.
    Inventors: Renen Hallak, Vladimir Zdornov, Yogev Vaknin, Asaf Levy, Alex Turin
  • Patent number: 10817212
    Abstract: Example embodiments of the present invention relate and a method and an apparatus for managing a short hash handle. The method including receiving an I/O including a first identifier for a data block and examining the first identifier in comparison with a second identifier. The data block identified in the I/O then may be managed according to the first identifier and the second identifier.
    Type: Grant
    Filed: June 11, 2019
    Date of Patent: October 27, 2020
    Assignee: EMC IP Holding Company LLC
    Inventors: Renen Hallak, Ronen Kalish, Kobi Luz, Ehud Rokach
  • Publication number: 20200285401
    Abstract: 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: Application
    Filed: March 7, 2019
    Publication date: September 10, 2020
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Yogev VAKNIN, Asaf LEVY, Lior KLIPPER, Eli MALUL
  • Publication number: 20200249841
    Abstract: 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: Application
    Filed: April 23, 2020
    Publication date: August 6, 2020
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Alex TURIN
  • Publication number: 20200249842
    Abstract: 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: Application
    Filed: April 24, 2020
    Publication date: August 6, 2020
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Vladimir ZDORNOV
  • Publication number: 20200218454
    Abstract: A system and method for efficiently providing snapshots in storage systems. The method includes creating a plurality of snaplines for a storage system, each snapline having metadata including a timestamp and a status marker for each of a plurality of offset ranges, wherein each offset range corresponds to data stored in the storage system, the storage system including a plurality of compute nodes, wherein the timestamp of each snapline is a value of a global counter at a time of creation of the snapline, wherein the global counter is uniform among the plurality of compute nodes; and creating a snapshot based on the plurality of snaplines and a time value, wherein the snapshot indicates a snapline of the plurality of snaplines that is not to be deleted, wherein the timestamp of the snapline that is not to be deleted corresponds to the time value.
    Type: Application
    Filed: January 7, 2019
    Publication date: July 9, 2020
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Vladimir ZDORNOV
  • Patent number: 10678461
    Abstract: 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: Grant
    Filed: June 7, 2018
    Date of Patent: June 9, 2020
    Assignee: Vast Data Ltd.
    Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Alex Turin
  • Publication number: 20200174678
    Abstract: 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: Application
    Filed: December 3, 2018
    Publication date: June 4, 2020
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Vladimir ZDORNOV, Yogev VAKNIN, Asaf LEVY, Alex TURIN
  • Patent number: 10656857
    Abstract: 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: Grant
    Filed: June 7, 2018
    Date of Patent: May 19, 2020
    Assignee: Vast Data Ltd.
    Inventors: Renen Hallak, Asaf Levy, Avi Goren, Yogev Vaknin, Vladimir Zdornov
  • Publication number: 20190377490
    Abstract: 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: Application
    Filed: June 7, 2018
    Publication date: December 12, 2019
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Alex TURIN
  • Publication number: 20190377491
    Abstract: 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: Application
    Filed: June 7, 2018
    Publication date: December 12, 2019
    Applicant: Vast Data Ltd.
    Inventors: Renen HALLAK, Asaf LEVY, Avi GOREN, Yogev VAKNIN, Vladimir ZDORNOV