This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2 3 4 5 6 7 Cycle
%ecx.0 incl load
t.1 %ecx.i +1 cmpl cc.1 %edx.1 incl load
t.2 %ecx.i +1 cmpl cc.2 %edx.2 jl incl load
t.3 %ecx.i +1 cmpl cc.3 %edx.3 addl
%ecx.1 i=0 jl incl load
t.4 %ecx.i +1 cmpl cc.4 %edx.4 Iteration 1 addl
%ecx.2 i=1 jl Iteration 2 addl
%ecx.3 i=2 jl Iteration 3 addl
%ecx.4 i=3 Iteration 4 Figure 5.16: Scheduling of Operations for Integer Addition with Unbounded Resource Constraints. With unbounded resources the processor could achieve a CPE of 1.0. this multiplication before it can begin. In our ﬁgure, the multiplication operations begin on cycles 4, 8, and 12. With each succeeding iteration, a new multiplication begins every fourth cycle. Figure 5.16 shows the ﬁrst four iterations of combine4 for integer addition on a machine with an unbounded number of functional units. With a single-cycle combining operation, the program could achieve a CPE of 1.0. We see that as the iterations progress, the Execution Unit would perform parts of seven operations on each clock cycle. For example, in...
View Full Document
- Spring '10
- The American