Given C code: for (j=2;j<=1000;j++) D[j] = D[j−1]+D[j−2]; Corresponding MIPS code: addiu $2, 7992 addiu $1, $0, 16 loop: l.d $f0, -16($s1) l.d $f2, -8($s1) add.d $f4, $f0, $f2 s.d $f4, 0($s1) addiu $s1,$s1,8 bne $s1,$s2,loop The above instructions have the following latencies in cycles: add.d l.d s.d addiu 4 6 1 2

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 2

Question

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Answer 6

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Answer 7

Chapter 6, Problem 6.4.2E

Program Plan Intro

Given C code:

for (j=2;j<=1000;j++)

D[j] = D[j−1]+D[j−2];

Corresponding MIPS code:

addiu $2, 7992

addiu $1, $0, 16

loop: l.d $f0, -16($s1)

l.d $f2, -8($s1)

add.d $f4, $f0, $f2

s.d $f4, 0($s1)

addiu $s1,$s1,8

bne $s1,$s2,loop

The above instructions have the following latencies in cycles:

add.d l.d s.d addiu
4 6 1 2

Answer 8

Expert Solution & Answer

Answer 9

Expert Solution & Answer

Answer 10

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 11

Ch. 6 - Prob. 6.1.1E Ch. 6 - Prob. 6.1.2E Ch. 6 - Prob. 6.1.3E Ch. 6 - Prob. 6.1.4E Ch. 6 - Prob. 6.2.1E Ch. 6 - Prob. 6.2.2E Ch. 6 - Prob. 6.2.3E Ch. 6 - Prob. 6.2.4E Ch. 6 - Prob. 6.3.1E Ch. 6 - Prob. 6.3.2E

add.d	l.d	s.d	addiu
4	6	1	2

Want to see the full answer?

Chapter 6 Solutions