Lucent Technologies Inc.

Hewlett-packard Company

Elizabeth A Shriver

Bruce K Hillyer

Yossi Matias

Eran Gabber

Mark Henry Hansen

Jeffrey S Vitter

Rakesh D Barve

Bjorn Markus Jakobsson

Arif Abdulhusein Merchant

John Wilkes

Theodore Sizer

Sachin More

Richard Andrew Golding

Banu Rahime Ozden

Mirjana Spasojevic

Katherine Grace August

Phillip B Gibbons

Shanmugavelayut Muthukrishnan

Ping-Wen Ong

Michelle McNerney

Elizabeth Lynn Borowsky

Craig R Nohl

Wee Teck Ng

Daniel D Lee

Christopher Stein

Lan Huang

Chin-Sheng Chuang

Tim Sullivan

Phillio B Gibbons

A method for organizing records of a database by topical relevance generates statistics on relevance by monitoring search terms used and search paths traversed by a database user community. Records reviewed most often in relation to a given search term are assumed to be most relevant to that search term in the eyes of members of the user community. Additionally, a record reviewed in relation to a plurality of search terms is determined to be related by topical relevance to other records reviewed in relation to that plurality of search terms. Again, a probability is calculated, based on a frequency of record review and search terms used, as a measure of this record topical relevance. An embodiment directed toward Internet searches provides for seeding the probability calculations with information from labeled data available from open source Internet directories. The activities of the user community are monitored, for example, at a proxy server, or by reviewing proxy server logs. Other monitoring points are contemplated.

Method for organizing records of database search activity by topical relevance

A special-purpose file system is provided which includes a combination of services and features which improve the performance of applications employing caches, such as caching web proxies. This file system also provides a file system cache which can be used as a general high-performance file system cache for file systems which need a cache. The services and features include collocating files together on a disk; keeping file meta-data in memory; compressing file names to hash values for reference; using a flat naming scheme for files; providing background daemons that pack files into clusters and clean disk and main memory space; and implementing a user-level library. The file system reduces access to related disk files, eliminates disk operations that are needed to maintain directory and meta-data information, and avoids multiple buffering of file data, and saves and efficiently manages disk and main memory space.

File system for caching web proxies

A data replication system is disclosed in which replication functionalities between a host computer, an interconnecting computer network, and a plurality of storage devices are separated into host elements and a plurality of storage elements. The host computer is connected to one or more host elements. The host element is responsible for replicating data between the storage devices, which are each connected to an associated storage element, and for maintaining data consistency. Further, the host element instructs a storage element whose associated storage device does not contain up-to-date data to recover from another one of the plurality of storage elements and its associated storage device. The storage elements and their associated storage devices may be located in any combination of diverse or same geographical sites in a manner to ensure sufficient replication in the event of a site or equipment failure. The storage elements are responsible for executing read and write requests received from the host computer and for maintaining data consistency. When a storage element and its associated storage device is determined not to contain up-to-date data, recovery is effected by data transfer from one of the other storage elements and its associated storage device, that is indicated by the host element. Such recovery is done directly between the respective storage elements and associated storage devices, without transiting the data through the host element.

Redundant data storage and data recovery system

A system and method for information searching comprising determination of, in fine granularity, a Community of Interest (COI), further data mining in search results, using at least one of COI and expert preferences to identify important knowledge, formulation and manipulation of results, and summarization of search results into a document like entity with dynamic attributes described. More particularly, the invention relates to a system and method for providing interactive dialogue and iterative search functions to find information on a large network of servers such as the world wide web.

System and method for providing interactive dialogue and iterative search functions to find information

A method and apparatus for scheduling jobs having a staging time and a processing time are described. In one method, the jobs are divided into subsets based on a predetermined criteria such as depending on whether the staging time is longer than the processing time. In this method, the jobs in each subset are ordered independently. The jobs are then scheduled by alternating between the ordered subsets. In a second method, the jobs are again divided into subsets based on a predetermined criteria such as depending on whether the staging time is longer than the processing time. The jobs in each subset are ordered independently. The jobs in one subset are then simply appended to the other subset. In a third method, the jobs are ordered according to a predetermined criterion into a list and are executed by alternating between both ends of the list. The invention is also applicable to scheduling jobs having a destaging time. In this case, the staging time is set equal to the staging time plus the processing time and the processing time is set equal to the processing time plus the destaging time. The jobs are then scheduled according to the second method discussed above.

Method to increase the efficiency of job sequencing from sequential storage

An apparatus for and a method of multi-dimensional constraint optimization in a storage system configuration. In accordance with the primary aspect of the present invention, the objective function for a storage system is determined the workload units are selected and their standards are determined, and the storage devices are selected and their characteristics are determined. These selections and determinations are then used by a constraint based solver through constraint integer optimization to generate an assignment plan for the workload units to the storage devices.

Apparatus for and method of multi-dimensional constraint optimization in storage system configuration

The present invention is an apparatus for generating random bits from a computer system. The apparatus comprises a rotating storage device operating within the computer system. A rotational latency of the rotating storage device is associated with the computer system accessing information from the storage device with the rotational latency causing the accessing of the information to have an entropy. An extraction mechanism extracts random bits derived from entropy of the rotational latency of the storage device.

Storage device random bit generator

A method for scheduling access of data blocks located in a computer system having a plurality of disk drives, each disk drive has a disk cache with a specified fence parameter value coupled to a host computer via a common bus. The method according to one embodiment, comprises the steps of: (a) sequentially accessing each of the disk drives for a predetermined number of iterations to retrieve a predetermined number of data blocks; (b) for a specified number of the iterations, transferring data located in the disk cache to be transferred to the common bus and requesting data corresponding to the following iteration to be transferred to the disk cache; and (c) repeating steps (a) and (b) until the predetermined iterations are completed.

System and method for modeling and optimizing I/O throughput of multiple disks on a bus

A method for estimating and read durations, in response to requests to read data blocks stored in the disk drives in a computer system having a plurality of disk drives. Each disk drive has a disk cache with a non-zero fence parameter value coupled to a host computer via a common bus. The method according to one embodiment, comprises the steps of: (a) measuring an overhead period corresponding to the time during which a request to read is transmitted to a disk drive via the bus; (b) measuring an expected minimum positioning time corresponding to the shortest time required for a disk drive to locate said data block; (c) measuring mechanism-to-cache read time corresponding to the time required for a disk drive to transfer a data portion B,to a disk cache; (d) measuring the time required to transfer data blocks stored in each of said disk caches to the host; and (e) adding the times measured at steps (a) through (d).

Growing community of inventors

Jersey City, NJ, United States of America

Elizabeth A Shriver