This preview shows page 1. Sign up to view the full content.
Unformatted text preview: miting factor. 232
%edx.3 CHAPTER 5. OPTIMIZING PROGRAM PERFORMANCE 6 7 8 %ecx.3 9 10 11 12 13 14 15 16 17 18
%ecx.8 %ecx.6 %ecx.4 load
t.4 incl
%ecx.i +1 cmpl cc.4 %edx.4 incl load
t.5 %ecx.i +1 cmpl cc.5 %edx.5 addl jl i=3 Iteration 4 addl
%ecx.5 load
t.6 incl %edx.6 jl i=4 addl cmpl jl
cc.6 cc.6 load
t.7 Iteration 5 incl cmpl jl
cc.7 %edx.7 i=5 addl Iteration 6 load
t.8 incl
%ecx.i +1 cmpl cc.8 %edx.8 C ycl e
%ecx.7 i=6 addl jl Iteration 7 i=7 Iteration 8 Figure 5.18: Scheduling of Operations for Integer Addition with Actual Resource Constraints. The limitation to two integer units constrains performance to a CPE of 2.0. the program order for the operations, that is, the order in which the operations would be performed if we executed the machinelevel program in strict sequence. We then give priority to the operations according to their program order. In this example, we would defer the incl operation, since any operation of iteration 3 is later in program order than those of iterations 1 and...
View
Full
Document
This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.
 Spring '10
 Schultz
 The American

Click to edit the document details