Hewlett-packard Development Company, L.p.

Craig A Soules

Kimberly Keeton

Alistair Veitch

Charles B Morrey, Iii

Arif Abdulhusein Merchant

Yasushi Saito

Karl Anders Gyllstrom

Ludmila Cherkasova

John Wilkes

Mark David Lillibridge

Vinay K Deolalikar

James Adam Cipar

A data processing system includes a plurality of processing stages. In response to a query, a membership structure is accessed to determine whether partially processed data from a particular one of the processing stages.

Responding to a query in a data processing system

A processing subsystem has plural processing stages, where output of one of the plural processing stages is provided to another of the processing stages. Resources are dynamically assigned to the plural processing stages.

Assigning resources to processing stages of a processing subsystem

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.

Scheduling data analysis operations in a computer system

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.

Identifying similar files in an environment having multiple client computers

A method collects user interface events and file system events to capture text snippets in focus on an output device. The method then pairs the text snippets with related files to build a context graph and discover files associated with a task.

Methods for pairing text snippets to file activity

An embodiment of a method of cooperative caching for a distributed storage system begins with a step of requesting data from storage devices which hold the data. The method continues with a step of receiving any cached blocks and expected response times for providing non-cached blocks from the storage devices. The method concludes with a step of requesting a sufficient number of the non-cached blocks from one or more particular storage devices which provides an expectation of optimal performance.

Method of cooperative caching for distributed storage system

One embodiment is a method that stores user interface events and file system events to capture text snippets visible on an output device. Similar text snippets are merged into a context graph that is used to locate a document from a query.

Methods for merging text snippets for context classification

An embodiment of a method of hashing an address space to a plurality of storage servers begins with a first step of dividing the address space by a number of the storage servers to form data segments. Each data segment comprises a base address. A second step assigns the data segments to the storage servers according to a sequence. The method continues with a third step of measuring a load on each of the storage servers. According to an embodiment, the method concludes with a fourth step of adjusting data shares assigned to the storage servers according to the sequence to approximately balances the loads on the storage servers while maintaining the base address for each data segment on an originally assigned storage server. According to another embodiment, the method periodically performs the third and fourth steps to maintain an approximately balanced load on the storage servers.

Growing community of inventors

San Francisco, CA, United States of America

Craig A Soules