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).
-
Patent number: 9442941Abstract: In one aspect, a method includes providing a server that stores a hash digest metadata table and configuring entries in the hash digest metadata table to include entries that include persistent fields and non-persistent fields. The hash digest metadata table maps a hash digest representing X-Page data to its metadata information. The persistent fields include a short hash digest field, a physical layout offset field, a deduplication reference count field and a flags field.Type: GrantFiled: March 28, 2014Date of Patent: September 13, 2016Assignee: EMC CORPORATIONInventors: Kobi Luz, Tal Ben-Moshe, Renen Hallak
-
Patent number: 9367398Abstract: In one aspect, a method includes receiving and recording journal data at a client on a first server, providing the data to a journal component, transferring the journal data from the journal component to a reserve memory in a memory of a second server using a remote direct memory access (RDMA), after failure of the client, retrieving the journal data from the reserve memory using the RDMA and replacing the journal data lost from the failure of the client with the journal data from the reserve memory.Type: GrantFiled: March 28, 2014Date of Patent: June 14, 2016Assignee: EMC CorporationInventors: Tal Ben-Moshe, Renen Hallak, Kobi Luz, Eli Dorfman
-
Patent number: 9286003Abstract: 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: GrantFiled: December 31, 2013Date of Patent: March 15, 2016Assignee: EMC CorporationInventors: Renen Hallak, Ronen Kalish, Kobi Luz, Ehud Rokach
-
Patent number: 9208162Abstract: In one aspect, a method includes receiving hash signature, determining if there is an existing hash signature that matches the hash signature received, determining if there is an existing short hash handle that matches the hash signature received, designating n-1 least significant bits of the hash signature to be n-1 least significant bits of a n-bit short hash handle if there is not an existing short hash handle that matches the hash signature received and adding a hash handle bit to the n-1 bits to form the n-bit short hash handle.Type: GrantFiled: September 26, 2013Date of Patent: December 8, 2015Assignee: EMC CorporationInventors: Renen Hallak, Ronen Kalish, Kobi Luz, Ehud Rokach
-
Patent number: 9141290Abstract: A memory management system for a thinly provisioned memory volume in which a relatively larger virtual address range of virtual address blocks is mapped to a relatively smaller physical memory comprising physical memory blocks via a mapping table containing entries only for addresses of the physical memory blocks containing data. The memory management system comprises a snapshot provision unit to take a given snapshot of the memory volume at a given time, the snapshot comprising a mapping table and memory values of the volume, the mapping table and memory values comprising entries only for addresses of the physical memory containing data. The snapshot is managed on the same thin provisioning basis as the volume itself, and the system is particularly suitable for RAM type memory disks.Type: GrantFiled: May 13, 2012Date of Patent: September 22, 2015Assignee: EMC CorporationInventors: Renen Hallak, Kirill Shoikhet, Irit Yadin-Lempel, Erez Webman, Shahar Frank
-
Patent number: 9104326Abstract: A device for scalable block data storage and retrieval uses content addressing. Data storage devices store data blocks, and are connected over a network to computing modules. The modules comprise control modules and data modules and carry out content addressing for both storage and retrieval. The network defines separate control paths via the control modules and data paths via the data modules.Type: GrantFiled: November 15, 2010Date of Patent: August 11, 2015Assignee: EMC CorporationInventors: Shahar Frank, Erez Webman, Renen Hallak, Kobi Luz, Irit Yadin-Lempel, Yaron Segev
-
Patent number: 9063910Abstract: In one aspect, a redundant array of independent disk (RAID) memory storage system includes a plurality of data storage disks comprising data blocks, a first redundancy storage disk comprising parity blocks that are a parity by row of the data blocks in the data storage disks, a second redundancy storage disk comprising parity blocks storing parities of diagonals of the data blocks in the data storage disks, a third redundancy storage disk comprising parity blocks storing parities of diagonals of the data blocks in the data storage disks and circuitry configured to recover data from three failed storage disks.Type: GrantFiled: February 12, 2015Date of Patent: June 23, 2015Assignee: EMC CorporationInventors: Renen Hallak, Tal Ben-Moshe, Yaron Segev, Kirill Shoikhet, Niko Farhi
-
Publication number: 20150169408Abstract: A redundant array of independent disk (RAID) memory storage system comprising data storage blocks arranged in a first plurality of data rows and a second plurality of data columns, wherein parity data is stored in additionally defined parity blocks, and wherein numbers of data blocks in respective columns are different, to accommodate the additional diagonal parity data block that the geometry of the system requires. The system is suitable for an SSD array in which sequential disk readout is not required.Type: ApplicationFiled: February 27, 2015Publication date: June 18, 2015Inventors: Renen Hallak, Yaron Segev
-
Patent number: 9026729Abstract: In one aspect, a redundant array of independent disk (RAID) memory storage system includes a plurality of data storage disks comprising data blocks, a first redundancy storage disk comprising parity blocks that are a parity by row of the data blocks in the data storage disks, a second redundancy storage disk comprising parity blocks storing parities of diagonals of the data blocks in the data storage disks, a third redundancy storage disk comprising parity blocks storing parities of diagonals of the data blocks in the data storage disks and circuitry configured to recover data from three failed storage disks.Type: GrantFiled: September 25, 2014Date of Patent: May 5, 2015Assignee: EMC CorporationInventors: Renen Hallak, Tal Ben-Moshe, Yaron Segev, Kirill Shoikhet, Niko Farhi
-
Patent number: 8990495Abstract: A redundant array of independent disk (RAID) memory storage system comprising data storage blocks arranged in a first plurality of data rows and a second plurality of data columns, wherein parity data is stored in additionally defined parity blocks, and wherein numbers of data blocks in respective columns are different, to accommodate the additional diagonal parity data block that the geometry of the system requires. The system is suitable for an SSD array in which sequential disk readout is not required.Type: GrantFiled: November 15, 2011Date of Patent: March 24, 2015Assignee: EMC CorporationInventors: Renen Hallak, Yaron Segev
-
Patent number: 8799705Abstract: A disk array memory system comprises: a plurality of disks in a disk array for storage of content data and parity data in stripes, content data in a same stripe sharing parity bits of said parity data, each disk having a spare disk capacity including at least some of a predefined array spare capacity, said array spare capacity providing a dynamic space reserve over said array to permit data recovery following a disk failure event; a cache for caching content data prior to writing to said disk array; and a controller configured to select a stripe currently having a largest spare stripe capacity, for a current write operation of data from said cache, thereby to write all said data of said current write operation on a same stripe, thereby to maximize sharing of parity bits per write operation and minimize separate parity write operations.Type: GrantFiled: March 15, 2012Date of Patent: August 5, 2014Assignee: EMC CorporationInventors: Renen Hallak, Tal Ben Moshe, Niko Farhi, Erez Webman
-
Publication number: 20130305002Abstract: A memory management system for a thinly provisioned memory volume in which a relatively larger virtual address range of virtual address blocks is mapped to a relatively smaller physical memory comprising physical memory blocks via a mapping table containing entries only for addresses of the physical memory blocks containing data. The memory management system comprises a snapshot provision unit to take a given snapshot of the memory volume at a given time, the snapshot comprising a mapping table and memory values of the volume, the mapping table and memory values comprising entries only for addresses of the physical memory containing data. The snapshot is managed on the same thin provisioning basis as the volume itself, and the system is particularly suitable for RAM type memory disks.Type: ApplicationFiled: May 13, 2012Publication date: November 14, 2013Applicant: XtremIO Ltd.Inventors: Renen HALLAK, Kirill Shoikhet, Irit Yadin-Lempel, Erez Webman, Shahar Frank
-
Publication number: 20130173955Abstract: A disk array memory system comprises: a plurality of disks in a disk array for storage of content data and parity data in stripes, content data in a same stripe sharing parity bits of said parity data, each disk having a spare disk capacity including at least some of a predefined array spare capacity, said array spare capacity providing a dynamic space reserve over said array to permit data recovery following a disk failure event; a cache for caching content data prior to writing to said disk array; and a controller configured to select a stripe currently having a largest spare stripe capacity, for a current write operation of data from said cache, thereby to write all said data of said current write operation on a same stripe, thereby to maximize sharing of parity bits per write operation and minimize separate parity write operations.Type: ApplicationFiled: March 15, 2012Publication date: July 4, 2013Applicant: XtremlO LtdInventors: Renen Hallak, Tal Ben Moshe, Niko Farhi, Erez Webman
-
Patent number: 8464318Abstract: A method for securing a web client against malicious web attacks, the method is performed by a secure gateway deployed between a web client and a web server. The method comprises receiving a uniform resource locator (URL) request from the web client; sending the URL request to the web server for executing server side web application code responsive to the URL request; receiving client side application code from the web server; executing the client side application code on behalf of the web client; and sending the web client user interface updates rendered responsive to the execution of the client side application code.Type: GrantFiled: November 23, 2009Date of Patent: June 11, 2013Inventor: Renen Hallak
-
Publication number: 20130124776Abstract: A redundant array of independent disk (RAID) memory storage system comprising data storage blocks arranged in a first plurality of data rows and a second plurality of data columns, wherein parity data is stored in additionally defined parity blocks, and wherein numbers of data blocks in respective columns are different, to accommodate the additional diagonal parity data block that the geometry of the system requires. The system is suitable for an SSD array in which sequential disk readout is not required.Type: ApplicationFiled: November 15, 2011Publication date: May 16, 2013Applicant: XtremlO Ltd.Inventors: Renen HALLAK, Yaron Segev
-
Publication number: 20120317395Abstract: A CAS data storage method and apparatus comprising: receiving input data including a succession of data items with corresponding logical addresses at a source CAS data storage space for storage therein and for replication at a destination CAS data storage space, generating a hash key for each data item at the source storage space, comparing respective hash keys with hash keys stored at a hash key storage table, to determine whether respective further data items are already present at the destination storage device; transferring respective data items to the destination storage space if no match is made to a hash key stored at the hash key storage table, but not transferring respective further data items if a match is made to a hash key stored at the hash key storage table, thereby transferring to the destination storage space only unique data items.Type: ApplicationFiled: June 13, 2012Publication date: December 13, 2012Applicant: XtremlO Ltd.Inventors: Yaron SEGEV, Renen HALLAK, Shahar FRANK
-
Publication number: 20120124282Abstract: A device for scalable block data storage and retrieval uses content addressing. Data storage devices store data blocks, and are connected over a network to computing modules. The modules comprise control modules and data modules and carry out content addressing for both storage and retrieval. The network defines separate control paths via the control modules and data paths via the data modules.Type: ApplicationFiled: November 15, 2010Publication date: May 17, 2012Applicant: XtremlO Ltd.Inventors: Shahar FRANK, Erez Webman, Renen Hallak, Kobi Luz, Irit Yadin-Lempel, Yaron Segev