Computer Organization and Design MIPS Edition, Fifth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)
Question
Book Icon
Chapter 5, Problem 5.15.1E
Program Plan Intro

Given scenario:

The given performance parameters of virtual machine is as follows:

  • Base CPI =1.5
  • Privileged O/S accesses per 10000 instructions = 120
  • Performance impact to guest O/S= 15 cycles
  • Performance impact to VMM = 175 cycles
  • I/O Access per 10000 instructions = 30
  • I/O access time = 1100 cycles

Expert Solution & Answer
Check Mark

Explanation of Solution

Calculation of CPI:

CPI = Base CPI + (O/S Accesses per 10000 instructions)10000×(Performance impact of Guest OS +Performance impact to Trap to VMM)=1.5+12010000×(15 cycles + 175 cycles)=1.5+12010000×(190)=1.5+0.012×(190)=1.5+2.28=3.78

Calculation of CPI if the VMM performance impact double:

CPI = Base CPI + (O/S Accesses per 10000 instructions)10000×(Performance impact of Guest OS + Double of the Performance impact to Trap to VMM)=1.5+12010000×(15 cycles + 350 cycles)=1.5+12010000×(365)=1.5+0.012×(365)=1.5+4.38=5.88

Calculation of CPI if the VMM performance cut in half:

CPI = Base CPI + (O/S Accesses per 10000 instructions)10000×(Performance impact of Guest OS + Half of the Performance impact to Trap to VMM)=1.5+12010000×(15 cycles + 87.5 cycles)=1.5+12010000×(102.5 )=1.5+0.012×(102.5 )=1.5+1.23=2.73

Longest possible penalty to trap to the VMM:

To obtain a 10% performance degradation, use the following formula:

{1.1× Base CPI + (O/S Accesses per 10000 instructions)10000×(Performance impact of Guest OS )}={(O/S Accesses per 10000 instructions)10000×(Performance impact of Guest OS )+n}1.1×(1.5+12010000×(15 cycles))=(1.5+12010000×((15 cycles)+n))1.1×(1.5+12010000×(15 ))=1.512×((15 cycles)+n)1.1×(1.5+0.18)=1.512×((15 cycles)+n)1.1×1.68=22.68+(1.512n)1.848-22.68=1.512n20.832=1.512nn=13.78Computer Organization and Design MIPS Edition, Fifth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design), Chapter 5, Problem 5.15.1E

Therefore, 13 cycles is the longest possible penalty to trap to the VMM.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
"Please, the answer must be documented from a book, experience, or accurate information without using artificial intelligence." This simple program will count up from zero to 9 and then loop back to the start. Segment pin A Arduino Pin 6 B 5 C 2 D 3 E F G NORIYAH DP 4 7 18 18 NIV 9
Write an Arduino program to flash three LED's connected to pins (7, 9 & 11) respectively as shown in figure below: (Note: T₁-T3-5s & T₂=3s) LED, (pin 7) LED, (pin 9) LED (pin 11) T1 T2 T3'
Write a program that reads a list of integers from input and determines if the list is a palindrome (values are identical from first to last and last to first). The input begins with an integer indicating the length of the list that follows. Assume the list will contain a maximum of 20 integers. Output "yes" if the list is a palindrome and "no" otherwise. The output ends with a newline. Hints:   - use a for loop to populate the array based on the specified size (the first number entered)              - use a for loop to check first value with last value, second value with second from end, etc.              - if the values do not match, set a Boolean variable to flag which statement to output (yes or no)   Ex: If the input is (remember to include spaces between the numbers): 6 1 5 9 9 5 1 the output is: yes Ex: If the input is: 5 1 2 3 4 5 the output is: C++ coding

Chapter 5 Solutions

Computer Organization and Design MIPS Edition, Fifth Edition: The Hardware/Software Interface (The Morgan Kaufmann Series in Computer Architecture and Design)

Ch. 5 - Prob. 5.2.5ECh. 5 - Prob. 5.2.6ECh. 5 - Prob. 5.3.1ECh. 5 - Prob. 5.3.2ECh. 5 - Prob. 5.3.3ECh. 5 - Prob. 5.3.4ECh. 5 - Prob. 5.3.5ECh. 5 - Prob. 5.3.6ECh. 5 - Prob. 5.4.1ECh. 5 - Prob. 5.4.2ECh. 5 - Prob. 5.4.3ECh. 5 - Prob. 5.4.5ECh. 5 - Prob. 5.4.6ECh. 5 - Prob. 5.5.1ECh. 5 - Prob. 5.5.2ECh. 5 - Prob. 5.5.3ECh. 5 - Prob. 5.5.4ECh. 5 - Prob. 5.5.5ECh. 5 - Prob. 5.5.6ECh. 5 - Prob. 5.6.1ECh. 5 - Prob. 5.6.2ECh. 5 - Prob. 5.6.3ECh. 5 - Prob. 5.6.4ECh. 5 - Prob. 5.6.5ECh. 5 - Prob. 5.6.6ECh. 5 - Prob. 5.7.1ECh. 5 - Prob. 5.7.2ECh. 5 - Prob. 5.7.3ECh. 5 - Prob. 5.7.4ECh. 5 - Prob. 5.7.5ECh. 5 - Prob. 5.7.6ECh. 5 - Prob. 5.8.1ECh. 5 - Prob. 5.8.2ECh. 5 - Prob. 5.8.3ECh. 5 - Prob. 5.8.4ECh. 5 - Prob. 5.9.1ECh. 5 - Prob. 5.9.2ECh. 5 - Prob. 5.9.3ECh. 5 - Prob. 5.10.1ECh. 5 - Prob. 5.10.2ECh. 5 - Prob. 5.10.3ECh. 5 - Prob. 5.10.4ECh. 5 - Prob. 5.10.5ECh. 5 - Prob. 5.10.6ECh. 5 - Prob. 5.11.1ECh. 5 - Prob. 5.11.2ECh. 5 - Prob. 5.11.3ECh. 5 - Prob. 5.11.4ECh. 5 - Prob. 5.11.5ECh. 5 - Prob. 5.11.6ECh. 5 - Prob. 5.12.1ECh. 5 - Prob. 5.12.2ECh. 5 - Prob. 5.12.3ECh. 5 - Prob. 5.12.4ECh. 5 - Prob. 5.12.5ECh. 5 - Prob. 5.12.6ECh. 5 - Prob. 5.13.1ECh. 5 - Prob. 5.13.2ECh. 5 - Prob. 5.13.3ECh. 5 - Prob. 5.13.4ECh. 5 - Prob. 5.13.5ECh. 5 - Prob. 5.13.6ECh. 5 - Prob. 5.14.1ECh. 5 - Prob. 5.14.2ECh. 5 - Prob. 5.14.3ECh. 5 - Prob. 5.14.4ECh. 5 - Prob. 5.14.5ECh. 5 - Prob. 5.14.6ECh. 5 - Prob. 5.15.1ECh. 5 - Prob. 5.15.2ECh. 5 - Prob. 5.15.3ECh. 5 - Prob. 5.15.4ECh. 5 - Prob. 5.16.1ECh. 5 - Prob. 5.16.2ECh. 5 - Prob. 5.17.1ECh. 5 - Prob. 5.17.2ECh. 5 - Prob. 5.17.3ECh. 5 - Prob. 5.17.4ECh. 5 - Prob. 5.17.5ECh. 5 - Prob. 5.17.6ECh. 5 - Prob. 5.18.1ECh. 5 - Prob. 5.18.2ECh. 5 - Prob. 5.18.3ECh. 5 - Prob. 5.18.4ECh. 5 - Prob. 5.18.5ECh. 5 - Prob. 5.18.6ECh. 5 - Prob. 5.19.1ECh. 5 - Prob. 5.19.2ECh. 5 - Prob. 5.19.3ECh. 5 - Prob. 5.19.4ECh. 5 - Prob. 5.19.6E
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY