Instruction-level Parallelism | Computation Structures | Electrical Engineering and Computer Science | MIT OpenCourseWare

Loop unrolling and SW pipeliningConsider a basic in-order pipeline with bypassing (one instruction in each pipeline stage in any cycle). The pipeline has been extended to handle FP add. Assume the following delaysbetween dependent instructions: * Load feeding any instruction: 3 stall cycles * FP ALU feeding any instruction (except stores): 5 stall cycles * FP ALU feeding store: 4 stall cycles * Int add feeding a branch: 2 stall cycles * Int add feeding any other instruct

Back to Basics: Loop vs Line Power