Gershon Living Kedem

6434662, Aug 13, 2002

Nov 2, 1999

09/432138

Spencer Greene - Palo Alto CA
Gershon Kedem - Chapel Hill NC

Juniper Networks, Inc. - Sunnyvale CA

G06F 1200

711108, 711216

A system and method form searching an associative memory using input key values and first and second hashing sections. Key values (Kn) can be hashed in the first hashing section ( ) to generate first output values H (Kn) that access a first store ( ). The first store or memory portion ( ) can include âleafâ pointer entries ( - ) and âchunk pointerâ entries ( - ). A leaf pointer entry ( - ) points at data associated with an applied key value. A chunk pointer entry ( - ) includes pointer data. If a chunk pointer entry ( - ) is accessed, the key value (Kn) is hashed in the second hashing section ( ) to generate second output values H (Kn) that access a second store or memory portion ( ). Second hashing section ( ) hashes key values (Kn) according to selection data SEL stored in a chunk pointer entry ( - ). The system may also include a first memory portion accessed according to address values from the first hashing section and a second memory portion accessed according to address values that include outputs from the second hash section and a chunk base address value.

57784361, Jul 7, 1998

Nov 25, 1997

8/978320

Gershon Kedem - Chapel Hill NC
Thomas Alexander - Durham NC

Duke University - Durham NC

G06F 1212

711137

Predictive cache memory systems and methods are responsive to cache misses to prefetch a data block from main memory based upon the data block which last followed the memory address which caused the cache miss. In response to an access request to main memory for a first main memory data block, which is caused by a primary cache miss, a second main memory data block is identified which was accessed following a previous access request to the main memory for the first main memory data block. Once identified, the second memory data block is stored in a predictive cache if the second main memory data block is not already stored in the predictive cache. Thus, if the next main memory request is for the second main memory block, as was earlier predicted, the second main memory block is already in the predictive cache and may be accessed rapidly. The identification of data blocks for prefetching may be provided by a prediction table which stores therein identifications of a plurality of succeeding main memory data blocks, each of which was accessed following an access request to a corresponding one of a plurality of preceding main memory data blocks. The Prediction Table is updated if predictions are incorrect.

61346438, Oct 17, 2000

Nov 26, 1997

8/979575

Gershon Kedem - Chapel Hill NC
Ronny Ronen - Haifa, IL
Adi Yoaz - Talmy-Menache, IL

Intel Corporation - Santa Clara CA

G06F 1208

711213

A microprocessor includes an execution engine, a prediction table cache, and a prefetch controller. The execution engine is adapted to issue a memory request. The memory request includes an identifier corresponding to a row location in an external main memory. The prediction table cache is adapted to store a plurality of entries defining an access history of previously encountered memory requests. The prediction table cache is indexed by the identifier. The prefetch controller is adapted to receive the memory request and generate at least one prefetch candidate based on the memory request and the access history. A method for prefetching data in a microprocessor includes receiving a memory request. The memory request includes an identifier corresponding to a row location in an external main memory. The memory request is compared to an access history of previously encountered memory requests.

46494987, Mar 10, 1987

May 8, 1984

6/608295

Gershon Kedem - Rochester NY
John L. Ellis - Rush NY

The University of Rochester - Rochester NY

G09G 106
G06F 1562

364518

A computer system is introduced for curve-solid classification (raycasting) of objects in constructive solid geometry (CSG) modeling to produce image representations of two- or three-dimensional objects. The system carries out curve-solid classifications in parallel and at much higher speed than a general purpose computer. It uses primitive classification processors which compute all of the (curve-line or ray) primitive (basic solid bodies: block, cylinder, etc. ) intersections in parallel, combine processors which are connected into a binary tree that duplicates the binary tree defining the CSG solid and computes the set operations (union, intersection and difference), and a host computer.

57028680, Dec 30, 1997

May 8, 1995

8/437222

Mark D. Kellam - Chapel Hill NC
Gershon Kedem - Chapel Hill NC

Astarix Inc.

G03F 720

430312

A photoresist (18) is exposed through a design-independent high resolution reticle (20), producing a high resolution image of exposed resist (18A). Photoresist (18) is exposed for the second time through a design-specific low-resolution reticle (24), exposing selected portions (18D) of previously unexposed resist. The remaining portions (18B) of previously unexposed resist form a design-dependent high resolution image. After development of photoresist (18), its unexposed portions (18B) are removed, producing openings (26) in photoresist (18), that can be transferred to underlying material (36), for example by etching openings in that underlying material (36), thereby transferring the design-dependent high-resolution image to it. Since the design-independent high resolution reticle (20) can be prefabricated ahead of time and used to produce many designs with different functions, the above double-exposure method is suitable for fabricating design-specific high resolution features, e. g. , contacts (vias) between conducting layers, within time and at the approximate cost required to fabricate and process a low resolution image.

50439880, Aug 27, 1991

Aug 25, 1989

7/398772

Franc Brglez - Cary NC
Gershon Kedem - Chapel Hill NC
Clay S. Gloster - Raleigh NC

MCNC - Research Triangle Park NC
Northern Telecom Limited - Montreal

G01R 3128

371 27

A high precision weighted random pattern generation system generates any desired probability of individual bits within a weighted random bit pattern. The system includes a circular memory having a series of weighting factors stored therein, with each weighting factor representing the desired probability of a bit in the weighted random pattern being binary ONE. The random bits from a random number generator and a weighting factor are combined to form a single weighted random bit. The random bits and weighting factor are combined in a series of interconnected multiplexor gates. Each multiplexor gate has two data inputs, one being a bit from the weighting factor, the other being the output of the preceding multiplexor gate. The random number bit controls the output of the multiplexor. For example, when the control input (random bit) is high, the multiplexor output is the weighting factor bit.