A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program?

A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Related questions

Q: Consider the following sequence of instructions: add $t0, $t1, $t2 sub $t3, $t0, $t3 Iw $t5, 0($t0)…

A: Q1. Dependancies and hazards

Q: Consider the following set of processes, with the length of the CPU burst given in seconds:…

A: Scheduling of processes is done to finish the work on time. Arrival Time is the time when the…

Q: Consider a group of CPU-time sharing processes P1 , P2, ... Pn with CPU burst times of 1,2,...,n…

A: If there are n process with CPU burst times 1,2,3,.................,n That means the first process…

Q: owing set of processes, the length of the CPU burst time given in milliseconds:

A: Solution - In the given questions, we have to select the correct answer.

Q: Consider the following sequence of instructions: Iw $t1, 4($t2) add $t3, $t1, $t2 add $t3, $t4, $t5…

A: Initial order of sequence of instruction lw $tl, 4($t2) --------> Write on $tl register…

Q: Consider a computer system with the following allocation status for four non-sharable resources, A,…

A: Let's calculate the need of each process. Need = maximum - allocation The need matrix A B C D…

Q: Assume the following distribution of instructions for a given program: Arithmetic Store Load Branch…

A: Given: Goal:

Q: On a single CPU system, we have 2 processes running concurrently, with the same I/0 percentage in…

A: Answer :l

Q: 5 CFG to PDA Conversion Using the technique that was covered in class, convert the following CFG to…

A: Follow this step to convert CFG to PDA 1.First push $ 2. Then put all rules of CFG on q1 3. Put…

Q: Consider two machine states show beloW. State acc pc ir m (base,bound) pm S1 a Cu (d,e) pm1[1] =…

A: Given : Given the instruction i. The task is to find the type of instruction.

Q: 6. Consider two processors with the processor speeds, CPI, and runtimes given in tab 6. Calculate…

A: Here data are given in comparison with one another it means we should try to equate both processor…

Q: Consider the following set of processes, with the length of the CPU burst given in milliseconds:…

A: SRTF SRTF is the preemptive method of shortest job first scheduling. The process execution are…

Q: Consider a computer system with the following allocation status for four non-sharable resources, A,…

A: For the above given question all the statements are Correct except option(5) Available vector…

Q: Consider the following set of processes, with the length of the CPU bursts given in milliseconds.…

A: (a) i. Gantt chart for FCFS ii. Gantt chart for Non pre-emptive priority iii. Gantt chart for SJF

Q: Given an instruction sequence with instructions in classes A, B, and C as the table below (same as…

A: According to the given data : When the instruction class A is chosen, then its CPI after improving…

Q: Consider the following set of processes, with the length of the CPU-burst time given in…

A: The Answer is

Q: Given the following information: • For Computer 1, the number of CPU clock cycles is 500. • For…

A: Given information, CPU A = 1/5 CPU B CPU 1, total clock cycle required = 500 CPU 2, total clock…

Q: Using SJN, calculate the start time and finish time for each of these seven jobs that arrive one CPU…

A: The shortest job first (SJF) or shortest job next (SJN) is a non-preemptive algorithm. It selects…

Q: Consider two different instruction sets, Il and 12. Il has 3 classes of instructions, A1, B1 and Cl…

A: The Answer is in Below Steps

Q: onsider a multilevel computer in which levels are vertically stacked, with the lowest level being…

A: Answer :

Q: Consider a group of 5 benchmarks. With an old generation of CPU in the 90s, the execution times of…

A: Speed Up=n= execution time of B/ execution time of A n1=5/10=1/2 n2= 2/16=1/8 n3= 2/4 = 1/2 n4 =…

Q: Given is a set of jobs to be scheduled for execution on a uniprocessor system. Job Arrival Time…

A: Introduction : Given ,6 processes are given here with their corresponding priority , AT ,…

Q: • Explain what happens as the following sequences of instructions are executed: MOV DL,05H MOV…

A: Ans:) In the following program some sets of instructions are given, most of the instructions include…

Q: This question pertains to the AMAT of two systems. Suppose that we want a time improvement of n=1.05…

A: Required time is n=1.05. (Time old / time new) old miss rate = 0.25 Now we need to find the new…

Q: V. Round Robin and SJF comparison Process Arrival Time CPU Burst Time P1 9. P2 4 4 P3 6. 1 P4 8 6.…

A: Given: We need to calculate the Average waiting time and turn around time of the given process .…

Q: consider the following set of processes , with the length of the CPU burst given in milliseconds:…

A: Scheduling is the process in the Operating System by which the processes are selected that will be…

Q: 4. A system holds memory as shown in the figure below. (units in bytes) H P2 P3 150 50 100 P4 200 75…

A: First Fit It is appropriate to distribute the first requesting process to free or a whole large…

Q: r the following set of processes, the length of the CPU burst time given in milliseconds: Process…

A: It is defined as a instance of a program running in a computer. It is close in meaning to task , a…

Q: 32. Consider the following set of processes, with the length of the CPU-burst time given in…

A: The Answer is

Q: please answer b Consider the following set of processes, with the length of the CPU burst given in…

A: The Answer is in below Steps

Q: On a single CPU system, we have 2 processes running concurrently, with the same I/0 percentage =…

A: According to the information given:- We have to find the CPU utilization.

Q: Consider the following set of processes, with the length of the CPU burst given in milliseconds:…

A: As per our guidelines we are supposed to answer only one question. Kindly repost other questions as…

Q: Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival…

A: Gantt chart for FCFS scheduling: Job Arrival Time Size (msec) Priority Turn around time…

Q: Computer 1 (C1), with a clock rate of 3 GHz, runs a program in 40 seconds. Computer 2 (C2), with a…

A: Please refer below for your reference:

Q: a CPI of 1.5. If the processor executes a program in 10 seconds, what is the number of clock cycles…

A: Given- 2 GHz clock rate CPI =1.5 Program Execution time -10 s

Q: Consider the following snapshot of a system: Allocation Max Available Process АВСD ABCD АВСD 2001…

A: the solution is an given below :

Q: For the assembly language program and memory map given below, Assembly LOADI RO, 3 LOADI R1, 3 1 0…

Q: 5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP…

A: Solution: Given, Total time = 400s FP (Floating point) = 80s L/S (Load / Store) = 40s Branch B = 40s

Q: Suppose a program takes 2 billion instructions to execute on a processor running at 2.5 GHz. Suppose…

A: DATA GIVEN:- Instruction that needs to be executed = 2*109 instructions Processor speed = 2.5 GHz…

Q: For what range of values of the fraction f A of executed instructions of type A would the program…

A: Consider a system with only two types of machine language instructions A and B, with CPI A = 4 and…

Q: There are two computers, each one has CPU A and CPU B respectively, which are running the same…

A: Answer: Given computer1 number of CPU clock cycle is 500 for computer 2 instruction count 300 and…

Q: Process Burst Time Arrival Time P1 12 P2 11 P3 13 10 P4 15 P5 14 20 P6 10 25 P7 8 30 P8 17 35 P9 18…

A: Given: We have to apply shortest job first the following scheduling algorithm and create the Gantt…

Q: Givena CPU Scheduler has 3 CPUS running using FCFS according to the following table: Process Burst…

A: Deadlock time (integer) = 3 At this time, which process number is waiting for R1? Process (integer)…

Q: Consider following assembly-language program: 11: Iw R1, 45(R2) 12: add R7, R1, R5 13: sub R8, R1,…

A: the solution is an given below :

Q: Consider the following set of processes, with arrival times and the length of the CPU burst time…

A: In the given table there are 5 process which have some arrival time and burst time. Arrival time…

Q: The following table shows the execution time for three computers A, B, C that run three programs. A…

A: Please upvote. I am providing you the correct answer below.

Q: This is an OpenMP question. 1. #pragma omp parallel 2. { 3. 4. for (i = 1 ; i < M; i += 2 ) 5.…

A: Answer: I have given answered in the handwritten format in brief explanation.

Q: Consider following scenario for a program running on two computers A and B. Computer A Execution…

A: I have given an answer in step 2.

Q: 1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program…

Q: Explain what happens as the following sequences of instructions are executed : MOV DL,05H MOV…

A: MOV AX, 0H MOV DS, AX MOV ES, AX MOV AL, 05 MOV DI, 0A000H MOV CX, 0FH CLD AGAIN: STOSB LOOP…

Concept explainers

Recurrence relation

A recurrence relation or recursive relation is an equation that represents a function in terms of the values of its smaller inputs. Every recurrence relation T(n) is a recursive function of integer n and consists of a base case and a recursive case.

Question

Give downvote if plagiarized or from internet

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider a machine with three instruction classes and CPI measurements as follows: Instruction class CPI of the instruction class A 2 B 5 C 7 Suppose that we measured the code for a given program in two different compilers and obtained the following data: Code sequence Instruction counts (in millions) A B C 1 15 5 3 2 25 2 2 Assume that the machine’s clock rate is 500 MHz. Which code sequence will execute faster according to MIPS? How much according to execution time of each code sequence?
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%?
Two algorithms A and B report time complexities expressed by the functions n2and 2n , respectively. They are to be executed on a machine M that consumes 10–6 s to execute an instruction. What is the time taken by the algorithms to complete their execution on machine A for an input size of 50? If another machine N that is 10 times faster than machine M is provided for the execution, what is the largest input size that can be handled by the two algorithms on machine N? What are yourobservations?
Consider 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?
dont copy from internet if existing solution will downvote (a) A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program? (b) For a particular program as run on a particular system, the CPU execution time is 1 second, the CPI is 4, and 750 million instructions were executed. What is the clock rate as measured in GHz?
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. Wehave a particular program we wish to run. When compiled for computer A, thisprogram has exactly 100,000 instructions. How many instructions would theprogram need to have when compiled for Computer B, in order for the twocomputers to have exactly the same execution time for this program?
Assume that we compile a program with two different compilers for the same ISA, then run the two executables on the same machine M. Version A has a dynamic instruction count of 2.0 x 109 and an execution time of 4 seconds, while version B has a dynamic instruction count of 2.5 x 109 and an execution time of 6 seconds. (a). Find the CPIs for the two executables (Version A and Version B) respectively given that machine M has a frequency of 2GHz (i.e. 2x109 Hz). (b). We further run the two executables on two different processors of the same ISA. Suppose the execution times on the two processors are the same. Using the CPIs from (a), compare the clock of the processor running Version A against the clock of the processor running Version B. Which clock is faster? By how much?
Suppose that the execution time of a given program on a single processor is 9.5 ms. If you run this program on a system having 18 independent processors, you observe an overall speedup of 1.1. Using Amdahl’s Law, what must have been the fraction of the program that could be executed in parallel? (Express the answer in decimal form, i.e., if 50% of the program can be enhanced, enter 0.5. Round to three decimal places)
Consider the following set of processes A, B, C, D with the following CPU burst time and I/O. Find the average waiting time with RR of quantum 10ms and context switch time=2ms. What is the average waiting time? Write the waiting time for processes A,B,C,D.
The following table shows the number of instructions for a program with two sequences:Arith Store Load Branch Totala. 650 100 600 50 1400b. 750 250 500 500 2000Assuming that arith instructions take 1 cycle, load and store 5cycles, and branches 2 cycles, and the clock rate is 2 GHz processor.a. Which one is faster?b. Find the CPI for the sequence.b. If the number of load instructions can be reduced by one half,what is the speedup?
Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program executes the following assembly instructions:lw $s1, 0($gp)addi $s1, $s1, 25sw $s1, 0($gp)lw $s2, 12($gp)add $s2, $s2, $s1sw $s2, 8($gp)sw $s2, 12($gp) What are the memory addresses of variables x, y[0], and y[1]? What are the values of variables x, y[0], y[1], and y[2] at the endof the program?
14. Au A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program? A program is run on a system with two types of machine language instructions: type A instructions each require 3 clock cycles, while type B instructions each require 1 clock cycle. If 100 million type A instructions and 400 million type B instructions are executed, what is the CPI for this program?.