Patents by Inventor Christopher Lumb

Christopher Lumb 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: 20210382618
    Abstract: Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node.
    Type: Application
    Filed: August 20, 2021
    Publication date: December 9, 2021
    Inventors: Robert Lee, Christopher Lumb, Ethan L. Miller, Igor Ostrovsky
  • Patent number: 11119656
    Abstract: Systems and methods of deduplication aware scalable content placement am described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list m view of the characteristic and sending the data to the identified node.
    Type: Grant
    Filed: June 10, 2019
    Date of Patent: September 14, 2021
    Assignee: Pure Storage, Inc.
    Inventors: Robert Lee, Christopher Lumb, Ethan L. Miller, Igor Ostrovsky
  • Patent number: 10534677
    Abstract: Migrating applications executing on a storage system, including: detecting, by the storage system, that an application executing on a first platform within the storage system should be migrated to a second platform within the storage system; rejecting, by the storage system, all pending input/output (‘I/O’) requests received by the storage system from the application executing on the first platform; and initiating, by the storage system, execution of the application on the second platform.
    Type: Grant
    Filed: March 1, 2018
    Date of Patent: January 14, 2020
    Assignee: Pure Storage, Inc.
    Inventors: Jonathan Curley, Yuchen Jin, Christopher Lumb, Alexei Potashnik, Dilip Kumar Uppugandla, Christian Zankel, Xiaojing Zheng
  • Publication number: 20190294329
    Abstract: Systems and methods of deduplication aware scalable content placement am described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list m view of the characteristic and sending the data to the identified node.
    Type: Application
    Filed: June 10, 2019
    Publication date: September 26, 2019
    Inventors: Robert Lee, Christopher Lumb, Ethan L. Miller, Igor Ostrovsky
  • Patent number: 10359942
    Abstract: Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node.
    Type: Grant
    Filed: October 31, 2016
    Date of Patent: July 23, 2019
    Assignee: Pure Storage, Inc.
    Inventors: Robert Lee, Christopher Lumb, Ethan L. Miller, Igor Ostrovsky
  • Publication number: 20180293017
    Abstract: Migrating applications executing on a storage system, including: detecting, by the storage system, that an application executing on a first platform within the storage system should be migrated to a second platform within the storage system; rejecting, by the storage system, all pending input/output (‘I/O’) requests received by the storage system from the application executing on the first platform; and initiating, by the storage system, execution of the application on the second platform.
    Type: Application
    Filed: March 1, 2018
    Publication date: October 11, 2018
    Inventors: JONATHAN CURLEY, YUCHEN JIN, CHRISTOPHER LUMB, ALEXEI POTASHNIK, DILIP KUMAR UPPUGANDLA, CHRISTIAN ZANKEL, XIAOJING ZHENG
  • Publication number: 20180121089
    Abstract: Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node.
    Type: Application
    Filed: October 31, 2016
    Publication date: May 3, 2018
    Inventors: Robert Lee, Christopher Lumb, Ethan L. Miller, Igor Ostrovsky
  • Patent number: 9910618
    Abstract: Migrating applications executing on a storage system, including: detecting, by the storage system, that an application executing on a first platform within the storage system should be migrated to a second platform within the storage system; rejecting, by the storage system, all pending input/output (‘I/O’) requests received by the storage system from the application executing on the first platform; and initiating, by the storage system, execution of the application on the second platform.
    Type: Grant
    Filed: April 27, 2017
    Date of Patent: March 6, 2018
    Assignee: Pure Storage, Inc.
    Inventors: Jonathan Curley, Yuchen Jin, Christopher Lumb, Alexei Potashnik, Dilip Kumar Uppugandla, Christian Zankel, Xiaojing Zheng
  • Patent number: 7917903
    Abstract: A quality-of-service controller and related method for a data storage system. Requests for each of a plurality of storage system workloads are prioritized. The requests are selectively forwarded to a storage device queue according to their priorities so as to maintain the device queue at a target queue depth. The target queue depth is adjusted response to a latency value for the requests wherein the latency value is computed based on a difference between an arrival time and a completion time of the requests for each workload. Prioritizing the requests may be accomplished by computing a target deadline for a request based on a monitored arrival time of the request and a target latency for its workload. To reduce latencies, the target queue depth may be reduced when the target latency for a workload is less than its computed latency value. To increase throughput, the target queue depth may be increased when the target latency for each workload is greater than each computed latency value.
    Type: Grant
    Filed: March 27, 2003
    Date of Patent: March 29, 2011
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Christopher Lumb, Arif Merchant, Guillermo Alvarez
  • Patent number: 7643983
    Abstract: A technique for emulation of a data storage system. The invention allows the level of services to be provided by a data storage system to be specified in terms of the level of services provided by another storage system. In one aspect, a performance characterization of a data storage device to be emulated is obtained (e.g., by experimental techniques). A specification of a workload is also obtained that includes a specification of a plurality of data stores for the workload. The data stores are assigned to an emulation data storage device according to the performance characterization and according to the specification of the workload such that sufficient resources of the emulation data storage device are allocated to the workload to meet the performance characterization of the data storage device to be emulated. The emulation data storage device is then operated under the workload. Quality-of-service (QoS) control may be performed so as to provide a degree of performance isolation among the workloads.
    Type: Grant
    Filed: March 27, 2003
    Date of Patent: January 5, 2010
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Christopher Lumb, Arif Merchant, Guillermo Alvarez
  • Publication number: 20040193397
    Abstract: A technique for emulation of a data storage system. The invention allows the level of services to be provided by a data storage system to be specified in terms of the level of services provided by another storage system. In one aspect, a performance characterization of a data storage device to be emulated is obtained (e.g., by experimental techniques). A specification of a workload is also obtained that includes a specification of a plurality of data stores for the workload. The data stores are assigned to an emulation data storage device according to the performance characterization and according to the specification of the workload such that sufficient resources of the emulation data storage device are allocated to the workload to meet the performance characterization of the data storage device to be emulated. The emulation data storage device is then operated under the workload. Quality-of-service (QoS) control may be performed so as to provide a degree of performance isolation among the workloads.
    Type: Application
    Filed: March 28, 2003
    Publication date: September 30, 2004
    Inventors: Christopher Lumb, Arif Merchant, Guillermo Alvarez
  • Publication number: 20040194095
    Abstract: A quality-of-service controller and related method for a data storage system. Requests for each of a plurality of storage system workloads are prioritized. The requests are selectively forwarded to a storage device queue according to their priorities so as to maintain the device queue at a target queue depth. The target queue depth is adjusted response to a latency value for the requests wherein the latency value is computed based on a difference between an arrival time and a completion time of the requests for each workload. Prioritizing the requests may be accomplished by computing a target deadline for a request based on a monitored arrival time of the request and a target latency for its workload. To reduce latencies, the target queue depth may be reduced when the target latency for a workload is less than its computed latency value. To increase throughput, the target queue depth may be increased when the target latency for each workload is greater than each computed latency value.
    Type: Application
    Filed: March 27, 2003
    Publication date: September 30, 2004
    Inventors: Christopher Lumb, Arift Merchant, Guillemo Alvarez