Consider the given code below and the clock cycles are given. Identify all the stalls that are produced when one single code iteration is being executed. Show the overall number of cycles per iteration. Schedule the loop instructions in order to reduce the number of stalls. (Hint: Loop scheduling Reordering instructions can reduce the number of stalls) Unroll the loop in the following way: each unrolled iteration processes four array positions. Unrolled loop Unrolling the loop with a factor of four obtains loop : lw $ f0 , 22( $t0 ) lw $ f2 , 32( $t1 ) add.d $ f4 , $ f0 , $ f 2 mul.d $ f4 , $ f4 , $ f 6 sw $ f4 , ( $t2 ) addi $t0 , $t0 , 8 addi $t1 , $t1 , 8 subi $t3 , $t3 , 1 bnez $t3 , loop Lw and store—takes 2 clock cycles add.d takes 4 clock cycles mul.d takes 6 clock cycles addi and subi takes 0 clock cycles bnez takes 1 clock cycles
Consider the given code below and the clock cycles are given. Identify all the stalls that are produced when one single code iteration is being executed. Show the overall number of cycles per iteration. Schedule the loop instructions in order to reduce the number of stalls. (Hint: Loop scheduling Reordering instructions can reduce the number of stalls) Unroll the loop in the following way: each unrolled iteration processes four array positions. Unrolled loop Unrolling the loop with a factor of four obtains loop : lw $ f0 , 22( $t0 ) lw $ f2 , 32( $t1 ) add.d $ f4 , $ f0 , $ f 2 mul.d $ f4 , $ f4 , $ f 6 sw $ f4 , ( $t2 ) addi $t0 , $t0 , 8 addi $t1 , $t1 , 8 subi $t3 , $t3 , 1 bnez $t3 , loop Lw and store—takes 2 clock cycles add.d takes 4 clock cycles mul.d takes 6 clock cycles addi and subi takes 0 clock cycles bnez takes 1 clock cycles
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Consider the given code below and the clock cycles are given.
- Identify all the stalls that are produced when one single code iteration is being executed. Show the overall number of cycles per iteration.
- Schedule the loop instructions in order to reduce the number of stalls. (Hint: Loop scheduling Reordering instructions can reduce the number of stalls)
- Unroll the loop in the following way: each unrolled iteration processes four array positions. Unrolled loop Unrolling the loop with a factor of four obtains
loop :
lw $ f0 , 22( $t0 )
lw $ f2 , 32( $t1 )
add.d $ f4 , $ f0 , $ f 2
mul.d $ f4 , $ f4 , $ f 6
sw $ f4 , ( $t2 )
addi $t0 , $t0 , 8
addi $t1 , $t1 , 8
subi $t3 , $t3 , 1
bnez $t3 , loop
Lw and store—takes 2 clock cycles add.d takes 4 clock cycles mul.d takes 6 clock cycles addi and subi takes 0 clock cycles bnez takes 1 clock cycles |
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY