onsider a multilevel computer in which levels are vertically stacked, with the lowest level being level 1. Each level has instructions that are m times as powerful as those of the level below it; that is, one level r instruction can do the work of m instructions at level r-1. However, n instructions at level r-1 are required to interpret each instruction at level r. Given this, answer the following questions: If a level 1 program requires k seconds to run, how long would the equivalent program take to run at levels 2, 3 and 4. Express your answer in terms of n, m, and r. What is the performance implication for the program if n > m? Conversely, what is the implication if m > n? Which case do you think more likely? Why?

onsider a multilevel computer in which levels are vertically stacked, with the lowest level being level 1. Each level has instructions that are m times as powerful as those of the level below it; that is, one level r instruction can do the work of m instructions at level r-1. However, n instructions at level r-1 are required to interpret each instruction at level r. Given this, answer the following questions: If a level 1 program requires k seconds to run, how long would the equivalent program take to run at levels 2, 3 and 4. Express your answer in terms of n, m, and r. What is the performance implication for the program if n > m? Conversely, what is the implication if m > n? Which case do you think more likely? Why?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 26VE: _____ is a CPU design technique in which instruction execution is divided into multiple stages and...

See similar textbooks

Similar questions

Suppose a program segment consists of a purely sequential part which takes 100 cycles to execute, and an iterated loop which takes 400 cycles per iteration. Assume that the loop is dependent on the sequential part, i.e., both parts cannot run in parallel. Also assume that the loop iterations are independent, and cannot be further parallelized. If the loop is to be executed 100 times, what is the maximum speedup possible using an infinite number of processors (as many processors as you could possibly need) compared to a single processor?
Suppose we have two implementations:Machine A has a clock cycle time of 10 ns. and a CPI of 2.0. Machine B has aclock cycle time of 20 ns. and a CPI of 1.2. Which machine is faster for thisprogram, and how much in percentage? Consider that the total instruction in the program is 1x10^9 or about 1,000,000,000 set of instructions since the cycle time is running in nanoseconds.
In this classification, each instruction is executed uşing its own input data, independently of how other instructions get their data. We are using a(n): A Multiple Instruction Multiple Data. B Multiple Instruction Multiple Data. C Single Instruction Single Data. D Single Instruction Multiple Data
Consider a hypothetical computer having instruction length 32 bit and Byte addressable memory. You need to run a program P having 10 Q.4 CO4 instructions 11,12,13...10. All the instructions are stored in consecutive memory locations started from 1000. To run an instruction li, you have to complete four operations: Fetch, Decode, Execute, and Store. The content of Program Counter will be after the completion of fetch operation of instruction 12. There are no jump or branch instruction in program P
Write a program to execute the instruction ldaa #$50 1000 times. This is how we can make a delay. If the execution time of the instruction ldaa #$50 is 1ms, then executing the instruction for 1000 times will make a delay for 1 sec. Example: turn a LED on, then execute the delay to wait 1 sec to keep the LED on for 1 sec, then turn it off.
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10⁹ instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. How many times that computer is faster than another?
A processor executes a program in 10 seconds with an average CPI and IC of 2 and 20*109 respectively. We are trying to reduce the time by 20% but this leads to an increase of 50% in the CPI. What clock rate should we have to get this time reduction?
Consider a system in which Data and Code are distinct. When necessary, the CPU acquires instructions or data using two base-limit register pairs. Data and instructions should be kept separate. By default, this pair is read-only, allowing several users to share the programme. This method should be compared to others.
Consider a computer running a program that requires 250 seconds, where 70 seconds is spent executing FP instructions, 55 seconds for INT operations, 85 seconds for load/save operations, and 40 seconds for branch instructions. By how much is the time for INT operations reduced if the total time is reduced by 20%?
The CPU design team is designing an instruction set with three classes of instructions. Parameters are given in the following table. Consider a program with 65% ALU instructions, 25% memory access instructions, and 10% control instructions. What is the average CPI for this CPU? Clock Rate 4GHz CPI for ALU Inst. 6 CPI for Memory Inst. 8 CPI for Control Inst. 2
Consider two computers, P1 and P2, of the same instruction set (ISA). We have a program of 7.5x10° instructions and we want to run this program on P1 and P2. The P1 computer is a 5 GHz machine with CPI of 0.8. The P2 computer is a 6 GHz machine with CPI of 1.2. What is the CPU time of P1 computer to run this program?