Method and apparatus for prefetching recursive data structures

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S204000, C711S213000, C712S207000, C707S793000

Reexamination Certificate

active

06848029

ABSTRACT:
Computer systems are typically designed with multiple levels of memory hierarchy. Prefetching has been employed to overcome the latency of fetching data or instructions from or to memory. Prefetching works well for data structures with regular memory access patterns, but less so for data structures such as trees, hash tables, and other structures in which the datum that will be used is not known a priori. The present invention significantly increases the cache hit rates of many important data structure traversals, and thereby the potential throughput of the computer system and application in which it is employed. The invention is applicable to those data structure accesses in which the traversal path is dynamically determined. The invention does this by aggregating traversal requests and then pipelining the traversal of aggregated requests on the data structure. Once enough traversal requests have been accumulated so that most of the memory latency can be hidden by prefetching the accumulated requests, the data structure is traversed by performing software pipelining on some or all of the accumulated requests. As requests are completed and retired from the set of requests that are being traversed, additional accumulated requests are added to that set. This process is repeated until either an upper threshold of processed requests or a lower threshold of residual accumulated requests has been reached. At that point, the traversal results may be processed.

REFERENCES:
patent: 5704053 (1997-12-01), Santhanam
patent: 6295594 (2001-09-01), Meier

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for prefetching recursive data structures does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for prefetching recursive data structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for prefetching recursive data structures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3432759

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.