International Business Machines Corporation

Yissum Research Development Company of the Hebrew University of Jerusalem Ltd.

Marvell International Limited

University of California

Danny Dolev

Hovey Ramond Strong, Jr

Tal Anker

Yaron Weinsberg

Rudiger Karl Reischuk

Shimrit Tzur-David

Julian Satran

Hovey Raymond Strong

Cynthia Dwork

Alain Charles Azagury

John Michael Marberg

James Gregory Ranweiler

Shay Horovitz

Danny Bickson

R Udiger Reischuk

Ori Shental

German Goft

An apparatus having a content-addressable memory (CAM) that stores a plurality of entries comprising portions of a plurality of patterns; a memory that stores a shift value corresponding to each of the entries; and a controller that generates a first key based on a received string, applies the first key to the CAM to select an entry of the CAM, retrieves the shift value from the memory corresponding to the selected entry, in response to the shift value being equal to a predetermined value, identifies an initial match, and in response to the initial match corresponding to a first pattern of the plurality of patterns that is larger than the entries of the CAM, applies adjacent keys based on the received string to the CAM, and declares a complete match when each of the corresponding shift values from the memory is equal to the predetermined value.

High performance pattern matching

Methods and systems for processing an input. An input vector y is received that represents a noisy observation of Ax, where A is a data matrix and x is a data vector of unknown variables. Data vector x is recovered from the received input vector y via an iterative method. The recovering comprises determining an inference of a vector of marginal means over a graph G, where the graph G is of a joint Gaussian probability density function p(x) associated with noise in the received input vector y.

Method and system for linear processing of an input using Gaussian belief propagation

The present invention provides a method and an apparatus for managing communications arriving from or to a node connected to a specified portion of a network. Some embodiments relate to an apparatus for managing communications arriving from or to a node connected to a specified portion of a network, including an external link identifier, a pool of addresses and an address replacement module. The external link identifier is configured to identify a message which is configured to enable requested content to be exchanged between the node and at least one other node which is external to the specified portion of the network. The pool of addresses is adapted to implement content insensitive criteria for determining which addresses to include in the pool. The address replacement module is adapted to implement a content insensitive replacement policy for determining whether an address included in the identified message should be replaced.

Method and apparatus for managing communications

Apparatus having corresponding methods and computer programs, to detect a pattern in a string, comprises a memory circuit to store W-character segments of the pattern, where each segment comprises a fragment of the pattern; a key circuit to generate W-character keys each including a fragment of the string; a comparison circuit to compare the keys and the segments; where, when a segment matches a key, the comparison circuit indicates an initial match between the pattern and the string; and where, when one of the segments matches only a L-character fragment of one of the keys, wherein L&#x3c;W, the key circuit generates a new key including the L-character fragment and a K-character fragment of the string including K=W&#x2212;L consecutive characters from the string that are adjacent to the L matching characters in the string.

High-performance pattern matching

In a resilient database system which includes a journaled database which is implemented at one or more locations within a distributed data processing system, multiple diverse consistency levels are specified which each detail a level of consistency to be maintained between a primary database and a replica database. A user is then permitted to select a particular level of consistency for each replica database. Thereafter, each update to a record within the primary database is utilized to initiate an update to the corresponding record within each replica database in a manner which is consistent with the selected level of consistency for that replica database. In this manner, a replica database which is fully consistent with the primary database may be provided for seamless switchover in the event of a primary database failure, while a second replica database may be provided to respond to queries by applications which do not require fully consistent data, greatly enhancing the efficiency of access to that database.

Method and system for selectable consistency level maintenance in a

A computer program product, such as a floppy disk with pre-recorded software, is provided. The computer program product is for use with a computer or processing system which is to function as a node within a network. Synchronization of a local time maintained at the node with a reference time is facilitated through execution of the prerecorded software by the node. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference. This synchronization method provides a well-defined upper bound of synchronization error, and allows the node to synchronize its internal time based only on information contained in the received messages and the internally generated local time stamp marks. No 'round trip' or handshaking messages are necessary to define the needed temporal relationships between the times according to the first and second scales. Thus, it is not necessary that the reference time source know the identity of the node which is synchronizing itself. The node also maintains a global precision value, which estimates its time synchronization error, by resetting the value when the node is synchronized, and updating the value as the node operates. Responsive to the global precision exceeding various theresholds, the node requests resynchronization or sends synchronization messages based on its internal time.

Computer program product for use with a network node for performing

A network node, such as a computer or processing system, is provided, for use within a network, the node including program code for synchronizing a local time maintained at the node with a reference time. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference. This synchronization method provides a well-defined upper bound of synchronization error, and allows the node to synchronize its internal time based only on information contained in the received messages and the internally generated local time stamp marks. No 'round trip' or handshaking messages are necessary to define the needed temporal relationships between the times according to the first and second scales. Thus, it is not necessary that the reference time source know the identity of the node which is synchronizing itself. The node also maintains a global precision value, which estimates its time synchronization error, by resetting the value when the node is synchronized, and updating the value as the node operates. Responsive to the global precision exceeding various thresholds, the node requests resynchronization or sends synchronization messages based on its internal time.

Processing system for use as a network node for performing anonymous

A method is provided for synchronizing a local time maintained at a node within a network architecture with a reference time. Bursts of synchronization messages containing reference time stamps are transmitted over a network or communication link according to a predetermined protocol. A node to be synchronized receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained, and the protocol defines temporal relationships between certain ones of the times. In accordance with the predetermined protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference between the first time and the related time. This synchronization method provides a well-defined upper bound of synchronization error, and allows the nodes receiving the messages to synchronize their internal times based only on information contained in the received messages and their internally, generated local time stamp marks. Therefore, no 'round trip' or handshaking messages are necessary to define the needed temporal relationships between the times according to the first and second scales. Thus, it is not necessary that the reference time source know the identities of the nodes which synchronize themselves based on the messages. The node also maintains a global precision value, which estimates its time synchronization error, by resetting the value when the node is synchronized, and updating the value as the node operates. Responsive to the global precision exceeding various thresholds, the node requests resynchronization or sends synchronization messages based on its internal time.

Anonymous time synchronization method

An apparatus and method for secure and private communications in a triple-connected processor network. Communication of a message over at least three data paths is achieved by transmitting the message in coded form over the data paths, determining whether the message is correctly received, and if the message is not correctly received, identifying a non-faulty data path, testing remaining data paths to identify a faulty data path, and transmitting the message in coded form over remaining non-faulty data paths.

Growing community of inventors

Jerusalem, Israel

Danny Dolev