Patents by Inventor Danny Dolev
Danny Dolev 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: 8301604Abstract: 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.Type: GrantFiled: December 13, 2010Date of Patent: October 30, 2012Assignees: Marvell International Ltd., Yissum Research Development Company of The Hebrew University of JerusalemInventors: Tal Anker, Yaron Weinsberg, Shimrit Tzur-David, Danny Dolev
-
Patent number: 8139656Abstract: 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.Type: GrantFiled: September 25, 2008Date of Patent: March 20, 2012Assignee: The Regents of the University of CaliforniaInventors: Ori Shental, Danny Dolev, Danny Bickson
-
Patent number: 8103749Abstract: 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.Type: GrantFiled: January 5, 2006Date of Patent: January 24, 2012Assignee: Yissum Research Development Company of the Hebrew University of JerusalemInventors: Danny Dolev, Shay Horovitz
-
Patent number: 7853578Abstract: 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<W, the key circuit generates a new key including the L-character fragment and a K-character fragment of the string including K=W?L consecutive characters from the string that are adjacent to the L matching characters in the string.Type: GrantFiled: November 30, 2006Date of Patent: December 14, 2010Assignees: Marvell International Ltd., Yissum Research Development Company of The Hebrew University of JerusalemInventors: Tal Anker, Yaron Weinsberg, Shimrit Tzur-David, Danny Dolev
-
Publication number: 20100074342Abstract: 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.Type: ApplicationFiled: September 25, 2008Publication date: March 25, 2010Inventors: Ori Shental, Danny Dolev, Danny Bickson
-
Publication number: 20080282246Abstract: A method of scheduling tasks for execution in a computer system includes determining a dynamic worst case execution time for a non-periodic task. The dynamic worst case execution time is based on an actual execution path of the non-periodic task. An available time period is also determined, wherein the available time period is an amount of time available for execution of the non-periodic task. The non-periodic task is scheduled for execution if the dynamic worst case execution time is less than the available time period.Type: ApplicationFiled: May 7, 2007Publication date: November 13, 2008Inventors: Danny Dolev, Tal Anker, Yaron Weinsberg
-
Publication number: 20080028055Abstract: 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, the apparatus comprising. Some embodiments of the present invention 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.Type: ApplicationFiled: January 5, 2006Publication date: January 31, 2008Inventors: Danny Dolev, Shay Horovitz
-
Patent number: 5796999Abstract: 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.Type: GrantFiled: April 15, 1994Date of Patent: August 18, 1998Assignee: International Business Machines CorporationInventors: Alain Charles Azagury, Danny Dolev, German Goft, John Michael Marberg, James Gregory Ranweiler, Julian Satran
-
Patent number: 5784421Abstract: 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.Type: GrantFiled: January 24, 1996Date of Patent: July 21, 1998Assignee: International Business Machines CorporationInventors: Danny Dolev, Rudiger Karl Reischuk, Hovey Raymond Strong
-
Patent number: 5550873Abstract: 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.Type: GrantFiled: February 1, 1995Date of Patent: August 27, 1996Assignee: International Business Machines CorporationInventors: Danny Dolev, R udiger K. Reischuk, Hovey R. Strong
-
Patent number: 5428645Abstract: 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.Type: GrantFiled: November 3, 1992Date of Patent: June 27, 1995Assignee: International Business Machines CorporationInventors: Danny Dolev, Rudiger K. Reischuk, Hovey R. Strong
-
Patent number: 5161186Abstract: 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.Type: GrantFiled: September 6, 1991Date of Patent: November 3, 1992Assignee: International Business Machines CorporationInventors: Danny Dolev, Cynthia Dwork
-
Patent number: 5029159Abstract: In a token ring transmission system, token loss causes selection of a leader terminal, which issues a new token. The leader terminal is chosen by selecting and storing a leadership selection reference value and then generating a succession of terminal identification signals and transferring them on the token ring transmission system. Each terminal receives the succession of signals and iteratively compares the terminal identification signals sequentially with the leadership reference signal. Each time a terminal identification signal exceeds the magnitude of the leadership reference signal, the leadership reference value is replaced with the value of the terminal identification signal. The first terminal detecting equality of a terminal identification signal with its leadership selection reference signal assumes leadership and issues a token.Type: GrantFiled: July 18, 1989Date of Patent: July 2, 1991Assignee: International Business Machines CorporationInventor: Danny Dolev
-
Patent number: 4569015Abstract: An originating processor broadcasts a value in a message with its unforgeable signature to all n active processors, including itself. Receiving processors in the network pass such a message on with their own unforgeable signatures to all active processors, including themselves. If the number of signatures and phases is the same at each processor after the first two successive passings, then agreement as to the value with no fault is indicated, otherwise if after two passings, (t+1) signatures have been collected, then these are signed and sent in the third passing, and in any case, each processor continues the steps of repeatedly sending messages when received, and appending its signature until t+2 passings have occurred. At that time, a processor will agree to the value if at least (t+1) signatures append the message, otherwise a default value is adopted, t (n/2) being a reliability measure.Type: GrantFiled: April 13, 1983Date of Patent: February 4, 1986Assignee: International Business Machines CorporationInventors: Danny Dolev, Hovey R. Strong