Loop nest optimization: Difference between revisions

Revision as of 23:38, 28 February 2015

Revision as of 16:21, 3 March 2015

Line 32:

There are three problems to solve:

* Floating point additions take some number of cycles to complete. In order to keep an [[adder (electronics)|adder]] with multiple cycle latency busy, the code must update multiple [[Accumulator_Accumulator (computing)|accumulators]] in parallel.

* Machines can typically do just one memory operation per [[multiply–add]], so values loaded must be reused at least twice.