subject

We will now add support for register-memory ALU operations tothe classic five-stage RISC pipeline. To offset this increase incomplexity, all memory addressing will be restricted to registerindirect (i. e., all addresses are simply a value held in aregister: no offset or displacement may be added to the registervalue). For example, the register-memory instruction ADD R4, R5,(R1) means add the contents of register R5 to the contents of thememory location with address equal to the value in register R1 andput the sum in register R4. Register-register ALU operations areunchanged. Answer the following for the integer RISCpipeline.
a. List a rearranged order of the five traditional stages ofthe RISC pipeline that will support register-memory operationsimplemented exclusively by register indirect addressing.
b. Describe what new forwarding paths are needed for therearranged pipeline by stating the source, destination, andinformation transferred on each needed new path.
c. For the reordered stages of the RISC pipeline, what newdata hazards are created by this addressing mode? Give aninstruction sequence illustrating each new hazard.
d. List all ways that the RISC pipeline with register-memory. ALU operations can have a different instruction count for a givenprogram than the original RISC pipeline. Give a pair of specificinstruction sequences, one for the original pipeline and one forthe rearranged pipeline, to illustrate each way.
e. Assume all instructions take 1 clock cycle per stage. Listall ways that the register-memory RISC can have a different CPI fora given program as compared to the orginal RISC pipeline.

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 22:50
Before you enter an intersection on a green light make sure
Answers: 2
question
Computers and Technology, 22.06.2019 17:40
Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i.e., still have an asterisk in it).
Answers: 1
question
Computers and Technology, 23.06.2019 10:00
Now, open this passage to read about fafsa requirements. describe the information you will need to provide in order to complete a fafsa. list at least three of the required documents you must include.
Answers: 3
question
Computers and Technology, 24.06.2019 00:30
Use the keyword strategy to remember the meaning of the following word. the meaning for the word has been provided. write your keyword and describe the picture you would create in your mind. obfuscate: to make something so confusing that it is difficult to understand.
Answers: 2
You know the right answer?
We will now add support for register-memory ALU operations tothe classic five-stage RISC pipeline. T...
Questions
question
Mathematics, 19.11.2020 22:00
question
Biology, 19.11.2020 22:00
question
Mathematics, 19.11.2020 22:00
question
Business, 19.11.2020 22:00
question
Biology, 19.11.2020 22:00
question
Chemistry, 19.11.2020 22:00