Patents by Inventor Joseph Samuel Glider
Joseph Samuel Glider 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: 8706703Abstract: In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored.Type: GrantFiled: June 27, 2011Date of Patent: April 22, 2014Assignee: International Business Machines CorporationInventors: Michael Factor, Joseph Samuel Glider, Danny Harnik, Elliot K. Kolodner, Dalit Naor, Demyn Lee Plantenberg, Eran Rom, Sivan Tal, Paula Ta-Shma
-
Patent number: 8660997Abstract: Systems and methods for optimizing deduplication in a data storage system are provided. The method comprises associating a first name with first data blocks including first content stored in a data storage system, wherein the first name is associated with the first data blocks by way of a reference to a first meta file that points to a data file which points to the first data blocks; storing a first signature derived from the first content in an indexing data structure, wherein the first signature is used to associate the first name with the first data blocks and as means to verify whether a second content is a duplicate of the first content, based on value of a second signature derived from the second content.Type: GrantFiled: August 24, 2011Date of Patent: February 25, 2014Assignee: International Business Machines CorporationInventors: Michael E. Factor, Joseph Samuel Glider, Danny Harnik, Elliot K. Kolodner, Dalit Naor, Demyn Lee Plantenberg, Tal Sivan
-
Patent number: 8468135Abstract: An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.Type: GrantFiled: April 14, 2010Date of Patent: June 18, 2013Assignee: International Business Machines CorporationInventors: Mihail Corneliu Constantinescu, Joseph Samuel Glider
-
Publication number: 20130054540Abstract: Systems and methods for optimizing deduplication in a data storage system are provided. The method comprises associating a first name with first data blocks including first content stored in a data storage system, wherein the first name is associated with the first data blocks by way of a reference to a first meta file that points to a data file which points to the first data blocks; storing a first signature derived from the first content in an indexing data structure, wherein the first signature is used to associate the first name with the first data blocks and as means to verify whether a second content is a duplicate of the first content, based on value of a second signature derived from the second content.Type: ApplicationFiled: August 24, 2011Publication date: February 28, 2013Applicant: International Business Machines CorporationInventors: Michael E. Factor, Joseph Samuel Glider, Danny Harnik, Elliot K. Kolodner, Dalit Naor, Demyn Lee Plantenberg, Sivan Tal
-
Publication number: 20120330904Abstract: In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored.Type: ApplicationFiled: June 27, 2011Publication date: December 27, 2012Applicant: International Business Machines CorporationInventors: Michael Factor, Joseph Samuel Glider, Danny Harnik, Elliot K. Kolodner, Dalit Naor, Demyn Lee Plantenberg, Eran Rom, Sivan Tal, Paula Ta-Shma
-
Patent number: 8321543Abstract: A system and method for solving the weak membership problem in a system of nodes that might include redundancies. Each node is given the same random seed. Each node uses a link state protocol to determine the current system topography, and then an optimization such as simulated annealing is run on the topography at each node, independently of the other nodes, to determine the optimum weak membership for use thereof in subsequent system operations. Since each node starts with the same random seed, the nodes all arrive at the same solution without having to communicate a common solution between nodes.Type: GrantFiled: March 4, 2002Date of Patent: November 27, 2012Assignee: International Business Machines CorporationInventors: Henry Esmond Butterworth, Joseph Samuel Glider, Juan Carlos Gomez
-
Publication number: 20110258161Abstract: An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.Type: ApplicationFiled: April 14, 2010Publication date: October 20, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mihail Corneliu Constantinescu, Joseph Samuel Glider
-
Publication number: 20030167322Abstract: A system and method for solving the weak membership problem in a system of nodes that might include redundancies. Each node is given the same random seed. Each node uses a link state protocol to determine the current system topography, and then an optimization such as simulated annealing is run on the topography at each node, independently of the other nodes, to determine the optimum weak membership for use thereof in subsequent system operations. Since each node starts with the same random seed, the nodes all arrive at the same solution without having to communicate a common solution between nodes.Type: ApplicationFiled: March 4, 2002Publication date: September 4, 2003Applicant: International Business Machines CorporationInventors: Henry Esmond Butterworth, Joseph Samuel Glider, Juan Carlos Gomez
-
Patent number: 6587921Abstract: Providing high availability cache coherency in a distributed cache environment for a storage cluster. An extent owner node in a cluster controls extent disk requests and the locking and demotion of extent data. An extent client node may access the data but does not control destaging or locking. The extent client waits for a lock state grant prior to completing any I/O request. An extent client is allowed to receive data from a host for a write request and later let the extent owner sort out the proper cache coherency order. An extent client is not required to request a lock state change from the extent owner when a read cache hit occurs in the extent client. When a read miss occurs in an extent client, the extent client can initiate a stage request from disk and request the owner for a lock state change at a later time.Type: GrantFiled: May 7, 2001Date of Patent: July 1, 2003Assignee: International Business Machines CorporationInventors: Lawrence Yium-chee Chiu, Carlos Francisco Fuente, Joseph Samuel Glider
-
Publication number: 20020194429Abstract: Providing high availability cache coherency in a distributed cache environment for a storage cluster. An extent owner node in a cluster controls extent disk requests and the locking and demotion of extent data. An extent client node may access the data but does not control destaging or locking. The extent client waits for a lock state grant prior to completing any I/O request. An extent client is allowed to receive data from a host for a write request and later let the extent owner sort out the proper cache coherency order. An extent client is not required to request a lock state change from the extent owner when a read cache hit occurs in the extent client. When a read miss occurs in an extent client, the extent client can initiate a stage request from disk and request the owner for a lock state change at a later time.Type: ApplicationFiled: May 7, 2001Publication date: December 19, 2002Applicant: International Business Machines CorporationInventors: Lawrence Yium-Chee Chiu, Carlos Francisco Fuente, Joseph Samuel Glider