Automatic program restructuring to reduce average cache miss...

Electrical computers and digital processing systems: memory – Address formation – Slip control – misaligning – boundary alignment

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S005000, C711S118000, C711S170000, C711S173000

Reexamination Certificate

active

06907509

ABSTRACT:
A method, a computer or computer program product for automatically restructuring a program having arrays in inner loops to reduce an average penalty incurred for bursty cache miss patterns by spreading out the cache misses. The method may be used separately or in conjunction with methods for reducing the number of cache misses. The method determines a padding required for each array according to a proportion of the cache line size, to offset the starting points of the arrays relative to the start of a cache line memory access address for each array. Preferably, the starting points of the arrays that induce bursty cache misses are padded so that they are uniformly spaced from one another.

REFERENCES:
patent: 5590309 (1996-12-01), Chencinski et al.
patent: 5854934 (1998-12-01), Hsu et al.
patent: 5903917 (1999-05-01), Douceur et al.
patent: 5943691 (1999-08-01), Wallace et al.
patent: 6041393 (2000-03-01), Hsu
patent: 782078 (1997-07-01), None

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

Automatic program restructuring to reduce average cache miss... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Automatic program restructuring to reduce average cache miss..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic program restructuring to reduce average cache miss... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3476523

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