Patents by Inventor Jeremy M. Pinson
Jeremy M. Pinson 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: 8832370Abstract: A data storage system includes three or more storage devices, each associated with a unique data volume. A first one of the data storage devices at least has two or more data storage areas but can have more storage areas, which can be either data storage areas or parity storage areas. A second data storage device at least has two storage areas, one of which is a data storage area. A third data storage device at least has a parity storage area but can have more storage areas, which can be either data storage areas or parity storage areas. A first group of corresponding storage areas is defined by at least the data storage areas of the first and second storage devices and the parity storage area of the third storage device. A second group of corresponding storage areas is defined by at least the storage areas of the first and second storage devices.Type: GrantFiled: December 3, 2010Date of Patent: September 9, 2014Assignee: Netapp, Inc.Inventors: Vladimir Popovski, Nelson Nahum, Jeremy M. Pinson
-
Publication number: 20110202721Abstract: A data storage system includes three or more storage devices, each associated with a unique data volume. A first one of the data storage devices at least has two or more data storage areas but can have more storage areas, which can be either data storage areas or parity storage areas. A second data storage device at least has two storage areas, one of which is a data storage area. A third data storage device at least has a parity storage area but can have more storage areas, which can be either data storage areas or parity storage areas. A first group of corresponding storage areas is defined by at least the data storage areas of the first and second storage devices and the parity storage area of the third storage device. A second group of corresponding storage areas is defined by at least the storage areas of the first and second storage devices.Type: ApplicationFiled: December 3, 2010Publication date: August 18, 2011Applicant: LSI CorporationInventors: Vladimir Popovski, Nelson Nahum, Jeremy M. Pinson
-
Patent number: 7669008Abstract: A method of destage management of redundant data copies in a cache storage subsystem includes providing a plurality of target storage devices, each of the plurality of target storage devices capable of storing a complete copy of a data image. The data image and the plurality of target storage devices are subdivided into a plurality of sub-regions, each of the plurality of sub-regions organized such that a minimum cumulative total of the plurality of sub-regions on the target storage devices equals a number of sub-regions required to form the complete copy of the data image. Data is destaged from a write cache to the plurality of sub-regions on the target storage devices in an order such that a minimum number of sub-regions can be combined to restore the complete copy of the data image.Type: GrantFiled: February 9, 2007Date of Patent: February 23, 2010Assignee: International Business Machines CorporationInventors: Robert A. Kubo, Jeremy M. Pinson
-
Patent number: 7555599Abstract: The write operations to the storage devices are managed so that the write operations that would force a storage device to reposition its read/write head outside its read optimization boundary are queued until a threshold is reached. Upon reaching the write queue threshold, the write operations are sent to the storage devices in a burst mode that limits the impact of storage device seek operations that force the device read/write head out of position relative to the data that is assigned as it's primary read region, keeping the read/write head in it's primary locality to optimize the performance of read operations.Type: GrantFiled: September 6, 2006Date of Patent: June 30, 2009Assignee: International Business Machines CorporationInventors: Robert A. Kubo, Jeremy M. Pinson
-
Publication number: 20090006904Abstract: An apparatus and method to check integrity when handling data. The method provides a storage array which includes a plurality of sectors. The method defines (N) data state identifiers and (N) parity state identifiers. The method receives a command to handle data, where that command designates a target sector. The method determines the data state identifier assigned to the target sector, determines the parity state identifier assigned to the target sector, and compares the data state identifier and the parity state identifier. If the method determines that the data state identifier and the parity state identifier are the same, the method performs the command to handle data. Alternatively, if the method determines that the data state identifier and the parity state identifier differ, the method generates an error message.Type: ApplicationFiled: September 4, 2008Publication date: January 1, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: STEVEN T. BROADBENT, MICHAEL H. HARTUNG, CARL E. JONES, KARL A. NIELSEN, JEREMY M. PINSON
-
Patent number: 7454686Abstract: An apparatus and method to check integrity when handling data. The method provides a storage array which includes a plurality of sectors. The method defines (N) data state identifiers and (N) parity state identifiers. The method receives a command to handle data, where that command designates a target sector. The method determines the data state identifier assigned to the target sector, determines the parity state identifier assigned to the target sector, and compares the data state identifier and the parity state identifier. If the method determines that the data state identifier and the parity state identifier are the same, the method performs the command to handle data. Alternatively, if the method determines that the data state identifier and the parity state identifier differ, the method generates an error message.Type: GrantFiled: November 23, 2004Date of Patent: November 18, 2008Assignee: International Business Machines CorporationInventors: Steven T. Broadbent, Michael H. Hartung, Carl E. Jones, Karl A. Nielsen, Jeremy M. Pinson
-
Publication number: 20080282245Abstract: A method for media operational queue management in disk storage systems evaluates a plurality of pending storage operations requiring a destage storage operation. A first set of the plurality of pending storage operations is organized in a first array queue grouping (AQG). The AQG is structured such that all of the storage operations are completed within a predefined latency period. A computer-implemented method manages a plurality of pending storage operations in a disk storage system. A pending operation queue is examined to determine a plurality of read and write operations for a first array. A first set of the plurality of read and write operations is grouped into a first array queue grouping (AQG). The first set of the plurality of read and write operations is sent to a redundant array of independent disks (RAID) controller adapter for processing.Type: ApplicationFiled: May 8, 2007Publication date: November 13, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert A. Kubo, Karl A. Nielsen, Jeremy M. Pinson
-
Publication number: 20080195807Abstract: A method of destage management of redundant data copies in a cache storage subsystem includes providing a plurality of target storage devices, each of the plurality of target storage devices capable of storing a complete copy of a data image. The data image and the plurality of target storage devices are subdivided into a plurality of sub-regions, each of the plurality of sub-regions organized such that a minimum cumulative total of the plurality of sub-regions on the target storage devices equals a number of sub-regions required to form the complete copy of the data image. Data is destaged from a write cache to the plurality of sub-regions on the target storage devices in an order such that a minimum number of sub-regions can be combined to restore the complete copy of the data image.Type: ApplicationFiled: February 9, 2007Publication date: August 14, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert A. Kubo, Jeremy M. Pinson
-
Publication number: 20080059699Abstract: The write operations to the storage devices are managed so that the write operations that would force a storage device to reposition its read/write head outside its read optimization boundary are queued until a threshold is reached. Upon reaching the write queue threshold, the write operations are sent to the storage devices in a burst mode that limits the impact of storage device seek operations that force the device read/write head out of position relative to the data that is assigned as it's primary read region, keeping the read/write head in it's primary locality to optimize the performance of read operations.Type: ApplicationFiled: September 6, 2006Publication date: March 6, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert A. Kubo, Jeremy M. Pinson