Patents by Inventor Kimberly Keeton

Kimberly Keeton 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: 8019765
    Abstract: To determine files associated with one or more workflows, a trace of accesses of files in at least one server is received. The files are grouped into at least one set of files, where the files in the set are accessed together more than a predetermined number of times in the trace. Files associated with the particular workflow are identified based on the at least one set.
    Type: Grant
    Filed: October 29, 2008
    Date of Patent: September 13, 2011
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Anna Povzner, Kimberly Keeton, Marcos K. Aguilera, Arif A. Merchant, Charles B. Morrey, III, Mustafa Uysal
  • Publication number: 20110196880
    Abstract: A system has a processing pipeline with a plurality of processing stages, where each of the processing stages has one or plural processors, and where the processing stages are individually and independently scalable. A first of the processing stages of the processing pipeline provides a received date update into an update data structure, where the update data structure is accessible to process a query received by the system. One or more additional of the processing stages transforms the update data structure to allow for merging of the transformed update data structure into a database, where the transformed update data structure is accessible to process the query. Content of the transformed update data structure is stored into the database.
    Type: Application
    Filed: February 11, 2010
    Publication date: August 11, 2011
    Inventors: CRAIG A.N. SOULES, Kimberly Keeton, Charles B. Morrey, III, Alistair Veitch
  • Patent number: 7979742
    Abstract: A method and a system of improving recoverability of a dataset associated with a multi-tier storage system are provided. Updates to a dataset are stored in first storage. The dataset and a point-in-time copy of the dataset reside on second storage, and the first storage provides higher reliability than the second storage. The dataset is restored using at least a subset of the stored updates in combination with the point-in-time copy in the event that the dataset is lost.
    Type: Grant
    Filed: July 19, 2007
    Date of Patent: July 12, 2011
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Mustafa Uysal, Arif A. Merchant, Kimberly Keeton, Marcos K. Aguilera, Kiran-Kumar Muniswamy-Reddy
  • Publication number: 20110055843
    Abstract: A technique includes determining an order for projects to be performed on a computer system. Each project is associated with multiple job sets, such that any of the job sets may be executed on the computer system to perform the project. The technique includes selecting the projects in a sequence according to the determined order to progressively build a schedule of jobs for execution on the computer system. For each selected project, incorporating one of the associated job sets into the schedule based on a cost of each of the associated job sets.
    Type: Application
    Filed: September 3, 2009
    Publication date: March 3, 2011
    Inventors: Kimberly Keeton, Manish Gupta
  • Publication number: 20100274888
    Abstract: Information relating to monitored communications between user machines and a resource of a particular machine is received. Group information that identifies groups of the users is received. Based on the monitored communications and the group information, a summary of a subset of users that have accessed the resource is generated.
    Type: Application
    Filed: April 27, 2009
    Publication date: October 28, 2010
    Inventors: Mark David Lillibridge, Kimberly Keeton
  • Publication number: 20100251256
    Abstract: A technique receiving identifiers from a plurality of nodes. Each identifier identifies an associated data object, and at least some of the data objects being replicated on different nodes. The technique includes scheduling analysis of the data objects on the nodes based at least in part on a distribution of replicas of the data objects among the nodes and modeled performances of the nodes.
    Type: Application
    Filed: March 30, 2009
    Publication date: September 30, 2010
    Inventors: Craig A. Soules, Kimberly Keeton, Charles B. Morrey, III
  • Publication number: 20100250480
    Abstract: To identify similar files in an environment having multiple client computers, a first client computer receives, from a coordinator computer, a request to find files located at the first client computer that are similar to at least one comparison file, wherein the request has also been sent to other client computers by the coordinator computer to request that the other client computers also find files that are similar to the at least one comparison file. In response to the request, the first client computer compares signatures of the files located at the first client computer with a signature of the at least one comparison file to identify at least a subset of the files located at the first client computer that are similar to the at least one comparison file according to a comparison metric. The first client computer sends, to the coordinator computer, a response relating to the comparing.
    Type: Application
    Filed: March 24, 2009
    Publication date: September 30, 2010
    Inventors: Ludmila Cherkasova, Charles B. Morrey, III, Vinay Deolalikar, Kimberly Keeton, Mark David Lillibridge, Craig A. Soules, Alistair Veitch
  • Patent number: 7734867
    Abstract: Techniques for data storage using disk drives. To conserve power and reduce heat generation so that higher packaging density is possible, only some of the disk drives in an array may be powered on at any one time. Disk accesses may then be scheduled so that appropriate drives are powered on and off at appropriate times. In addition, various levels of storage services may be provided depending, for example, upon how accessible the drives are to individual clients and upon a level of data redundancy provided. Another advantage includes off-loading of tasks to a controller or processor included within the disk drives themselves. For example, the disk drives themselves may compute error detection or error correction representations and perform data integrity checks based on those representations. Failure simulation may also be performed to verify the ability to recover lost data and the disk drives may be used to convert the data into general formats that may be expected to be more easily read in the future.
    Type: Grant
    Filed: May 17, 2002
    Date of Patent: June 8, 2010
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, Eric Anderson
  • Publication number: 20100114832
    Abstract: Systems, methods, and other embodiments associated with forensic snapshots are described. One example method includes creating a snapshot of an operational data. The example method may also include creating a hash tree by hashing lowest level data blocks of the snapshot to produce lowest level hashes. Creating a hash tree may also include repeatedly growing the hash tree bottom up by selectively hashing lower level hashes into higher level hashes until a root node is produced. The example method may also include providing a forensic data associated with the hash tree, where the forensic data is used to verify the integrity of the snapshot.
    Type: Application
    Filed: October 31, 2008
    Publication date: May 6, 2010
    Inventors: Mark D. Lillibridge, Kimberly Keeton
  • Publication number: 20100106681
    Abstract: To determine files associated with one or more workflows, a trace of accesses of files in at least one server is received. The files are grouped into at least one set of files, where the files in the set are accessed together more than a predetermined number of times in the trace. Files associated with the particular workflow are identified based on the at least one set.
    Type: Application
    Filed: October 29, 2008
    Publication date: April 29, 2010
    Inventors: Anna POVZNER, Kimberly Keeton, Marcos K. Aguilera, Arif A. Merchant, Charles B. Morrey, III, Mustafa Uysal
  • Patent number: 7680635
    Abstract: A configuration method includes selecting a design configuration, and modeling the solution configuration having a failure event for the selected solution configuration to determine an amount of down time associated with the failure event. A first penalty cost function is applied the amount of down time to determine a first penalty cost associated with the failure event of the selected solution configuration.
    Type: Grant
    Filed: September 17, 2004
    Date of Patent: March 16, 2010
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, John Wilkes, Cipriano A. Santos, Dirk Beyer, Arif Merchant, Jeffrey Scott Chase
  • Patent number: 7644249
    Abstract: An embodiment of a method of designing a storage system begins with a step of assigning decision variables to a range of candidate storage systems. Each of the decision variables identifies a single candidate storage system. The method concludes with a step of employing the decision variables in a mathematical program to determine which of the candidate storage systems meets availability and reliability criteria and incurs a near minimal projected cost.
    Type: Grant
    Filed: September 17, 2004
    Date of Patent: January 5, 2010
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, John Wilkes, Cipriano A. Santos, Dirk Beyer, Jeffrey Scott Chase, Arif Merchant
  • Patent number: 7536585
    Abstract: An embodiment of a method of estimating storage system availability begins with a first step of modeling a storage system design in operation under a workload to determine location of retrieval points. The retrieval points provide sources for primary storage recovery for a plurality of failure scenarios. For a particular failure scenario, the method continues with a second step of finding a secondary storage location of a most recent retrieval point relative to a target recovery time that is available for recovery. A third step determines a recovery time for propagation of the most recent retrieval point from the secondary storage location to primary storage.
    Type: Grant
    Filed: June 23, 2005
    Date of Patent: May 19, 2009
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, Arif Merchant
  • Publication number: 20090024813
    Abstract: Embodiments of the present invention pertain to improving recoverability of a dataset associated with a multi-tier storage system. According to one embodiment, updates to a dataset are stored in first storage. The dataset and a point-in-time copy of the dataset reside on second storage, and the first storage provides higher reliability than the second storage. The dataset is restored using at least a subset of the stored updates in combination with the point-in-time copy in the event that the dataset is lost.
    Type: Application
    Filed: July 19, 2007
    Publication date: January 22, 2009
    Inventors: Mustafa Uysal, Arif A. Merchant, Kimberly Keeton, Marcos K. Aguilera, Kiran-Kumar Muniswamy-Reddy
  • Patent number: 7467333
    Abstract: According to one embodiment, a method comprises intercepting, at an interposition agent, requests for accessing a data storage device. The method further comprises determining, by the interposition agent, at least one of the requests to impact, and selectively simulating, by the interposition agent, a fault for the selected at least one of the requests. According to another embodiment, a system comprises at least one data storage device, and at least one requester operable to request access to the at least one data storage device. The system further comprises at least one interposition agent communicatively interposed between the requestor(s) and the data storage device(s) to intercept requests for access from the requestor(s) to the data storage device(s), wherein the interposition agent is operable to selectively determine ones of the intercepted requests to impact and selectively simulate a fault for the selected at least one of the requests.
    Type: Grant
    Filed: September 1, 2005
    Date of Patent: December 16, 2008
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, Arif Merchant, John Wilkes
  • Patent number: 7426616
    Abstract: Provided is a method for determining a recovery schedule. The method includes accepting as input a recovery graph. The recovery graph presents one or more strategies for data recovery. In addition, at least one objective is provided and accepted. The recovery graph is formalized as an optimization problem for the provided objective. When formalized as an optimization problem, at least one solution technique is applied to determine at least one recovery schedule.
    Type: Grant
    Filed: August 22, 2006
    Date of Patent: September 16, 2008
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Kimberly Keeton, Dirk Beyer, Ernesto Brau, Arif Merchant, Cipriano Santos, Alex Zhang
  • Publication number: 20080126279
    Abstract: Provided is a method for determining a recovery schedule. The method includes accepting as input a recovery graph. The recovery graph presents one or more strategies for data recovery. In addition, at least one objective is provided and accepted. The recovery graph is formalized as an optimization problem for the provided objective. When formalized as an optimization problem, at least one solution technique is applied to determine at least one recovery schedule.
    Type: Application
    Filed: August 22, 2006
    Publication date: May 29, 2008
    Inventors: Kimberly Keeton, Dirk Beyer, Ernesto Brau, Arif Merchant, Cipriano Santos, Alex Zhang
  • Publication number: 20070050686
    Abstract: According to one embodiment, a method comprises intercepting, at an interposition agent, requests for accessing a data storage device. The method further comprises determining, by the interposition agent, at least one of the requests to impact, and selectively simulating, by the interposition agent, a fault for the selected at least one of the requests. According to another embodiment, a system comprises at least one data storage device, and at least one requester operable to request access to the at least one data storage device. The system further comprises at least one interposition agent communicatively interposed between the requestor(s) and the data storage device(s) to intercept requests for access from the requestor(s) to the data storage device(s), wherein the interposition agent is operable to selectively determine ones of the intercepted requests to impact and selectively simulate a fault for the selected at least one of the requests.
    Type: Application
    Filed: September 1, 2005
    Publication date: March 1, 2007
    Inventors: Kimberly Keeton, Arif Merchant, John Wilkes
  • Publication number: 20060173935
    Abstract: An embodiment of a method of restoring data begins with a step of restoring point-in-time data from a local copy. The method concludes with a step of restoring at least a portion of an incremental difference between the point-in-time data and a desired state of the data from a remote mirror.
    Type: Application
    Filed: February 3, 2005
    Publication date: August 3, 2006
    Inventors: Arif Merchant, Kimberly Keeton
  • Patent number: 6978259
    Abstract: An automated system adaptation technique for computer systems, networks and subsystems generally and, more particularly, for data storage systems. The invention programmatically designs, configures and manages a system, such as a data storage system. This is accomplished by performing a sequence of steps in an iterative loop, including analyzing the operation of the system under a workload, generating a new design based on the analysis and migrating the existing system to the new design. By systematically exploring a large design space and developing designs based on analyses of the workload, the invention generates designs that are improved in comparison to conventional design techniques. By programmatically repeating these tasks, the invention causes the system to converge to one that supports the workload without being over-provisioned.
    Type: Grant
    Filed: October 23, 2001
    Date of Patent: December 20, 2005
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Eric Anderson, Michael Hobbs, Kimberly Keeton, Susan Spence, Mustafa Uysal, Alistair Craig Veitch, John Wilkes