| S. Carr and K. Kennedy. Improving the ratio of memory operations to oating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994. |
....They considered the balance between FPU throughput and load store bandwidth in single loop nests. For loops with too much memory operations, Callahan, Carr and Kennedy developed a compiler strategy that bring program balance closer to machine balance by reducing the number of memory operations [2, 4]. McCalpin observed that memory bandwidth is an important factor in determining program performance [9] To consider all levels of memory hierarchy, Ding and Kennedy changed a balance from a ratio to a tuple that include load store, cache and memory bandwidth along with FPU throughput [6] Their ....
S. Carr and K. Kennedy. Improving the ratio of memory operations to oating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
No context found.
S. Carr and K. Kennedy. Improving the ratio of memory operations to oating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
....provide strong motivation for developing compiler support to make this transformation more widely accessible to application programmers. A number of code transformations have been proposed for improving locality in programs, including blocking, loop fusion, loop interchange, and loop reversal [11, 30, 29, 17, 4, 18, 8, 25]. The recursion transformation (as used here) is essentially a form of blocking, with two key di erences. First, it combines the e ect of blocking at multiple di erent levels into a single transformation. Second, the recursion transformation uni es both blocking and loop fusion when applied to ....
S. Carr and K. Kennedy. Improving the ratio of memory operations to oating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
No context found.
S. Carr and K. Kennedy. Improving the ratio of memory operations to oatingpoint operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
No context found.
S. Carr and K. Kennedy. Improving the ratio of memory operations to oating-point operations in loops. ACM Transactions on Programming Languages and Systems, 16(6):1768-1810, 1994.
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