Patents by Inventor Stephen B. Whitehill

Stephen B. Whitehill 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: 7558856
    Abstract: A data storage system comprising a plurality of storage nodes, each node existing at a physical location having one or more contexts. Interface mechanisms couple to each storage node to communicate storage access requests with the storage node. Data storage management processes select one or more of the storage nodes to serve a data storage request based at least in part upon the particular contexts of each of the storage nodes.
    Type: Grant
    Filed: November 29, 2004
    Date of Patent: July 7, 2009
    Assignee: EMC Corporation
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill
  • Patent number: 7509420
    Abstract: A data storage system comprising a plurality of storage nodes, each node existing at a physical location having one or more contexts. Interface mechanisms couple to each storage node to communicate storage access requests with the storage node. Data storage management processes select one or more of the storage nodes to serve a data storage request based at least in part upon the particular contexts of each of the storage nodes.
    Type: Grant
    Filed: February 5, 2001
    Date of Patent: March 24, 2009
    Assignee: EMC Corporation
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill
  • Publication number: 20040148306
    Abstract: A system and method for a computer file system that is based and organized upon hashes and/or strings of digits of certain, different, or changing lengths and which is capable of eliminating or screening redundant copies of aggregate blocks of data (or parts of data blocks) from the system. The hash file system of the present invention utilizes hash values for computer files or file pieces which may be produced by a checksum generating program, engine or algorithm such as industry standard MD4, MD5, SHA or SHA-1 algorithms. Alternatively, the hash values may be generated by a checksum program, engine, algorithm or other means that produces an effectively unique hash value for a block of data of indeterminate size based upon a non-linear probablistic mathematical algorithm.
    Type: Application
    Filed: January 14, 2004
    Publication date: July 29, 2004
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill
  • Patent number: 6704730
    Abstract: A system and method for a computer file system that is based and organized upon hashes and/or strings of digits of certain, different, or changing lengths and which is capable of eliminating or screening redundant copies of aggregate blocks of data (or parts of data blocks) from the system. The hash file system of the present invention utilizes hash values for computer files or file pieces which may be produced by a checksum generating program, engine or algorithm such as industry standard MD4, MD5, SHA or SHA-1 algorithms. Alternatively, the hash values may be generated by a checksum program, engine, algorithm or other means that produces an effectively unique hash value for a block of data of indeterminate size based upon a non-linear probablistic mathematical algorithm.
    Type: Grant
    Filed: February 5, 2001
    Date of Patent: March 9, 2004
    Assignee: Avamar Technologies, Inc.
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill
  • Publication number: 20010037323
    Abstract: A system and method for a computer file system that is based and organized upon hashes and/or strings of digits of certain, different, or changing lengths and which is capable of eliminating or screening redundant copies of aggregate blocks of data (or parts of data blocks) from the system. The hash file system of the present invention utilizes hash values for computer files or file pieces which may be produced by a checksum generating program, engine or algorithm such as industry standard MD4, MD5, SHA or SHA-1 algorithms. Alternatively, the hash values may be generated by a checksum program, engine, algorithm or other means that produces an effectively unique hash value for a block of data of indeterminate size based upon a non-linear probablistic mathematical algorithm.
    Type: Application
    Filed: February 5, 2001
    Publication date: November 1, 2001
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill
  • Publication number: 20010034795
    Abstract: A data storage system comprising a plurality of storage nodes, each node existing at a physical location having one or more contexts. Interface mechanisms couple to each storage node to communicate storage access requests with the storage node. Data storage management processes select one or more of the storage nodes to serve a data storage request based at least in part upon the particular contexts of each of the storage nodes.
    Type: Application
    Filed: February 5, 2001
    Publication date: October 25, 2001
    Inventors: Gregory Hagan Moulton, Stephen B. Whitehill