A heuristic algorithm which identifies loads guaranteed to hit the processor cache which further provides a "minimal" set of prefetches which are scheduled/inserted during compilation of a program is disclosed. The heuristic algorithm of the present invention utilizes the concept of a "cache line" (i.e., the data chunks received during memory operations) in conjunction with the concept of "related" memory operations for determining which prefetches are unnecessary for related memory operations; thus, generating a minimal number of prefetches for related memory operations.

 
Web www.patentalert.com

< Method and apparatus for reducing the overhead of virtual method invocations

< Receiving apparatus that receives and accumulates broadcast contents and makes contents available according to user requests

> Excessive spin detection and avoidance for systems using a least recently used page replacement algorithm

> Method and apparatus for instruction sampling for performance monitoring and debug

~ 00074