Intel Corporation

Chameleon Systems, Inc.

Bradley L Taylor

A packed radix data system is described, the packed radix data system including packed nodes which include a base pointer and an existence field, the existence field having a number of bits which indicate the existence or non-existence of a possible child node. By counting the number of bits to the left of an indexed bit in the existence field, an offset value is determined. The offset value is combined with the base pointer value to determine the child node address.

Packed radix search tree implementation

A memory access system is described in which local memory units on a reconfigurable chip can be used in conjunction with the system memory. Data path units on the reconfigurable chip can cause data to be swapped in and out of the local memory units as a result of calculations within the reconfigurable fabric. Alternately, a cache-like system can be used so that the data can be read into the local memory unit from the system memory units automatically.

Growing community of inventors

Oakland, CA, United States of America

Bradley L Taylor