Yahoo! Inc.

Compaq Computer Corporation, Inc.

Alta Vista Company

Overture Services, Inc.

Leonidas Kontothanassis

David E Kovalcin

Brian S Eberman

Michael Sokolov

Arjen P deVries

Rishiyur S Nikhil

Galen Clyde Hunt

James Matthew Rehg

Robert H Halstead, Jr

Sandhya Dwarkadas

Umakishore Ramachandran

Michael L Scott

Christopher F Joerg

Arjen P De Vries

Nikos Hardavellas

Robert Stets

A technique for processing data in a network is disclosed. In one particular exemplary embodiment, the technique may be realized as a method for processing data in a network having a plurality of network stations. The method comprises receiving a first representation of data at a first of the plurality of network stations, processing the first representation so as to generate a second representation of the data, and transmitting the second representation from the first network station to a second of the plurality of network stations for storage therein, wherein the second representation is stored at an address within the second network station. The method also comprises receiving the address at the first network station, and transmitting the address from the first network station to a third of the plurality of network stations for storage therein.

Technique for processing data in a network

According to the present invention, a technique for locating an item of interest within a stored representation of data is disclosed. The item of interest is preferably located within a particular one of a plurality of stored representations of data in a network having a plurality of network stations. In one embodiment, the technique is realized by first searching a plurality of stored annotations corresponding to different items within a plurality of stored representations of data to locate an annotation of interest corresponding to the item of interest, wherein the annotation of interest has an associated search identifier. A search request is then transmitted, from a first of the plurality of network stations to a second of the plurality of network stations, for the search identifier and an associated address identifier corresponding to a location of the particular one of the plurality of stored representations of data within the plurality of stored representations of data. The address identifier is then received at the first network station.

Technique for locating an item of interest within a stored representation of data

The present invention discloses an apparatus and method for maintaining the coherence of data within a shared memory network including a plurality of nodes. The system utilizes processors monitoring the occurrence of particular processing events within a local memory storage area. Upon the detection of events indicating the change of status of a particular group of data, a comparison is made between a modified copy of the group of data and a clean copy of the group of data to detect any modifications made to the group of data. These modifications are entered into the clean copy of the group of data and processing continues.

Apparatus and method for maintaining data coherence within a cluster of symmetric multiprocessors

A method and apparatus for providing additional memory storage within a local node associated with shared memory system is disclosed. A processor associated with a local node of the shared memory system initially requests a fetch operation to a local memory associated with the processor of a first group of data from the home node location of the first group of data. The processor determines whether sufficient local memory exists for receiving the requested first group of data, and if not, selects a second group of data presently located within the local memory for removal in such a manner that no data will be lost due to the removal of the second group of data from the local memory. The selected second group of data is removed from the local memory and any directory information relating to said second group of data updated to reflect any new location information. The first group of data may then be fetched to the local memory.

Protocol for software distributed shared memory with memory scaling

A technique for indexing data in a network having a plurality of network stations is disclosed. In one embodiment, the technique is realized by receiving a data identifier at a first of the plurality of network stations from a second of the plurality of network stations. The data identifier is then stored at the first network station. The first network station then receives an annotation from the second network station, wherein the annotation is associated with the data identifier. The annotation is then stored at the first network station in association with the data identifier.

Technique for indexing data in a network

A method for storing data information in a network having a plurality of network stations includes receiving, at a first of the plurality of network stations from a second of the plurality of network stations, an address identifier corresponding to a location of a representation of data at a third of the plurality of network stations. The address identifier is then stored in association with a data identifier.

Technique for storing data information within a network

In a computer system, a memory is allocated to a plurality of ports. The ports are arranged in a spatial ordering. A plurality of various sized data items are temporally ordered in each of the plurality of ports. Each data item includes a time-stamp to indicate the temporal ordering of the plurality of data items. The plurality of data items are atomically accessed by a plurality of threads using space and time coordinates. The space and time coordinates uniquely identify each of the plurality of data items.

Growing community of inventors

Belmont, MA, United States of America

Leonidas Kontothanassis