| D. Callahan, K. Kennedy and A. Porterfield Software Prefetching in Proc. of IV-ASPLOS, pp.40.52, April 1991 |
....due to true dependences with previous memory operations. The alternative of scheduling all loads using the cache miss latency requires considerable instruction level parallelism and increases register pressure ( 1] Software prefetching is an effective technique to tolerate memory latency ([4]) Software prefetching can be performed through two alternative schemes: binding and nonbinding prefetching. The first alternative, also known as early scheduling of memory operations, moves memory instructions away from those instructions that depend on them. The second alternative introduces in ....
....to minimize the execution time of a software pipelined loop. Finally, we show that schemes based on binding prefetch are more effective than those based on nonbinding prefetch for software pipelined schedules. The use of binding and nonbinding prefetching has been previously studied in [12] 1] and [4][8] 13] 17] 3] respectively among others. However, to our knowledge there is no previous work analyzing the interactions of these prefetching schemes with software pipelining techniques. The selective scheduling ( 1] schedules some operations with cache hit latency and others with cache miss ....
D. Callahan, K. Kennedy and A. Porterfield Software Prefetching in Proc. of IV-ASPLOS, pp.40.52, April 1991
....code. It is obvious that when larger loop nests are optimized, even more hard to read code is produced. This is where the CVT can help to get a feeling of what is happening with the data locality after nonsingular loop transformations are applied. 4. 5 Software Prefetching Software prefetching [7] is a technique to reduce the number of compulsory misses in cache. This subject is interesting for two reasons : ffl It is one of the few software optimizations for dealing with compulsory misses (normally it is done in hardware, through larger cache lines or hardware prefetching) ffl It shows ....
D. Callahan, K. Kennedy and A. Porterfield Software Prefetching , 1991
....classic load instruction plus one prefetch instruction for each data to be fetched in advance. Consequently, program size is larger, the processor instruction set must be modified and processor cycles are lost in executing such instructions. A solution to that problem proposed by Callahan and al. [2] is to replace nops with prefetch instructions or dedicate one instruction thread of superscalar processors to this task. Data traffic A consequence of software prefetching is heavy data traffic (memory requests are nearly doubled) A solution proposed by Veidenbaum and al. 6] is to group ....
Callahan, Kennedy, Porterfield: Software Prefetching, Proc. of ASPLOS'91, pp. 40-52.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC