For this part, there are four problems. You must show your work to get credit. P

Question

For this part, there are four problems. You must show your work to get credit. Problems 1.13.1 and 1.13.3 from textbook (skip 1.13.2) Problem 1.15 from textbook. It was not clear to me what the question wanted, so here is a sample calculation for 2 processors: finish filling in the table for 4, 8, 16, 32, 64 and 128 processors. You are given an eight-bit, unsigned binary value of 01010101. You need to extend it to 16 bits. What is the corresponding binary value in 16-bit? What is its hexadecimal value? You are given an eight-bit binary value of 11111110. What is its value in the following representations: hexadecimal decimal (assuming the binary value is interpreted as unsigned) decimal (assuming the binary value is interpreted as signed 2's complement) base 5 (assuming the binary value is interpreted as unsigned) If the value is assumed to be signed 2's complement, and is converted to 32 bits, what is its binary value after conversion? What is its hexadecimal value? In class and in the Simple Machine handout, the instructions for Simple Machine were detailed, as well as the specification for our register transfer language (rtl), Parts of the algorithm necessary for simulating (or microprogramming) the operation of our Simple Machine using rtl was also provide. In this assignment, you will finish this algorithm by adding the clauses necessary for each of the Simple Machine's instructions. We have already written rtl for the JEQ, LOAD, and SUB instructions in class and exercises, so you get those ones for free. You should refer to the Simple Machine Datapaths handout for details on which registers can be transferred to which other registers and in what directions (although you should only have to use this for checking your work). Also remember that each instruction cycle is limited to a single instruction memory cycle and a single data memory cycle. Hand in a listing of your pseudocode using rtl for each instruction, with sufficient documentation using standard C or C++-style comments) to indicate which instructions are which. Place the code to process the instructions in the instructions' numeric order so that it is easy to follow.(i.e., the code for

Explanation / Answer

1.not clear

2.

3.01010101

after extending we have

binary value

00000000 01010101

hexadecimal value

0x0055

4.11111110

4.1 hexadecimal

take 4bit a time from right ad add additional 0 to the left if does not count to 4

1111=f,1110=e

0xfe

decimal for the unsigned

11111110

leftmost digit is not taken as sign bit

254

decimal for the signed

leftmost digit is taken as sign bit

11111110

-2

(254)10

base 5 will be

(2004)5

4.211111110

after extension we have

we extend the sign bit

binary

11111111111111111111111111111110

hexadecimal

-0x7e

4.3 question not complete

p(number of processors) execution time per processor speedup % of ideal speedup 4 100/4+4=29 100/29=3.44 3.44/4=86.1% 8 100/8+4=16.5 100/16.5=6.06 6.06/8=75.78% 16 100/16+4=10.25 100/10.25=9.75 9.75/16=61% 32 100/32+4=7.125 100/7.125=14.03 14,.03/32=43.8% 64 100/64+4=5.5625 100/5.5625=17.977 17.977/64=28.08% 128 100/128+4=4.78 100/4.78=20.93 20.93/128=16.6%

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.