Your favorite computer program (after being converted to MIPS assembly code, then to machine code) results in 2.5e8 instructions. Consider the three different CPUs and their clock rates and CPIs and determine how much time it would take each of them to execute this program. Your computer with a clock rate of (use task manager on your computer, find the clock rate of your computer and write it here: _____) and a CPI of 1.2

Your favorite computer program (after being converted to MIPS assembly code, then to machine code) results in 2.5e8 instructions. Consider the three different CPUs and their clock rates and CPIs and determine how much time it would take each of them to execute this program. Your computer with a clock rate of (use task manager on your computer, find the clock rate of your computer and write it here: _____) and a CPI of 1.2

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter12: Event-driven Gui Programming, Multithreading, And Animation

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Here are some registers and storage locations during the run of a program.For this example, all numbers are hex.eax contains 300ebx contains 3000The doubleword at memory location 300 contains 500The doubleword at memory location 10 contains 70 What is in eax after the command addl $10, %eax executes? a. 310 b. 510 c. 370
The Basic Computer stored a program in their memory unit as shown below. Fill Out the following table with the content of the registers (AC, PC, IR) after each instruction is executed. Note: all numbers are in the hexadecimal. 000 CLA 001 Add 016 AC PC 010 Bun 014 21 013 Halt 014 And 017 015 Bun 013 016 A001 017 DFFF
Q: Suppose you have a machine which executes a program that consists of 50% (in terms of execution time) floating point multiply, 20% floating point divide, and the remaining 30% are from other instructions. (a) Management wants the machine to run 1.4 times faster. You can make the divide run at most 3 times faster and the multiply run at most 8 times faster. Can you meet the management’s goal by making only one improvement, and which one? (Show the calculations you did to answer this question.) (b) If you make both the multiply and divide improvements, what is the speed (performance) of the improved machine relative to the original machine? (Show the calculations you did to answer this question.)
418. Computations are performed with little I/O operations in job type of a. CPU bound b. Unit bound c. I/O bound d. Batch bound
Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mb
CODE IN MACHINE LANGUAGE USING LC-3 Write an assembly program to set R0=1 if there's a 5 in one of ten memory locations, starting at x3100. At the beginning of the program, set R0 = 0. If no 5 is found, it should leave R0 set to 0. Please submit your assembly program below. I will run it with my data. If a 5 is found, output the following message to the console. "A 5 was found at x31xx." 31xx is the hex address of the 5. Here is the test data I used to generate the screen print below. It is not the test data I will use to grade your project. .ORIG x3100.FILL #10.FILL #20.FILL #30.FILL #40.FILL #50.FILL #5.FILL #70.FILL #5.FILL #90.FILL #100.END
Given the following: Logical Memory size of 1000 Physical Memory size of 2000 Page (and frame) size of 100 Block A contains data for a program Select Block A’s size and its starting point in both memories. Then write the page table for Block A based on your selections. See below for the layout of both memories and an example of Block A of size 200. Logical Memory Physical Memory location/ page location/frame 0 to 99/ 0 0 to 99/ 0 100 to 199 /1 Block A 100 to 199/ 1 200 to 299/ 2 Block A 200 to 299/ 2 300 to 399/ 3 300 to 399/ 3 400 to 499/ 4 400 to 499/ 4 500 to 599/ 5 500 to 599/ 5 600 to 699/ 6 600 to 699/ 6 700 to 799/ 7 700 to 799/ 7 800 to 899/ 8 800 to 899/ 8 900 to 999/ 9 900 to 999/ 9 1000 to 1099/ 10 1100 to 1199/ 11 1200 to 1299/ 12 1300 to 1399/ 13 Block A 1400 to 1499/ 14 Block…
Use 8086 assembly language by using the EMU8086 - assembler and microprocessor emulator solve the problems: Task 03 Write a program that takes an input (not from user) to check whether a year is leap year or not and print "Leap Day" Task 04 Write a program that takes all 3 sides of a triangle and prints whether the triangle is equilateral, isosceles or neither.
The following byte sequence is the machine code of a program function compiled with the Y86- 64 instruction set. The memory address of the first byte is 0x300. Note that the byte sequence is written in hex-decimal form, i.e., each number/letter is one hex-decimal number representing 4 binary bits, and two numbers/letters represent one byte. 630030F3020000000000000030F11E000000000000007023030000000 00000601061316211761F0300000000000090- Please write out the assembly instructions (in Y86-64 instruction set) corresponding to the machine codes given by the above bytes sequence, and explain what this program function is computing. The machine has a little-endian byte ordering.
For this homework assignment you are not allowed to use::MOVSB, MOVSW, MOVSD, CMPSB,CMPSW,CMPD,SCASB, SCASW, SCASD,STOSB, STOSW, STOSD, LODSB, LODSW, and LODSD. It is required that for each question write only one procedure that does the requested job. Only write the assembly part and avoid using directives. DO NOT USE IRVINE'S LIBRARY.Write an assembly for: Do not change the order of the relational expressions.You are not allowed to use: .continue, .ELSE, .ELSEIF, .IF, .REPEAT, .UNTIL, .WHILEDo not change the order of the relational expressions.int a = 12, b =7;if ((a<= 4 || a>=12) && (b>=5 && a<=14)) { b =a - 4; a = b - 2;}else { a = b-2; b = b-5;}
For this homework assignment you are not allowed to use::MOVSB, MOVSW, MOVSD, CMPSB,CMPSW,CMPD,SCASB, SCASW, SCASD,STOSB, STOSW, STOSD, LODSB, LODSW, and LODSD. It is required that for each question write only one procedure that does the requested job. Only write the assembly part and avoid using directives. DO NOT USE IRVINE'S LIBRARY. Write a general-purpose program (only assembly code and no procedure call) that inserts a source string to the beginning of a target string. Sufficient space must exist in the target string to accommodate the new characters. Here is a sample call:.datatargetStr BYTE "Stanford",30 DUP(0)sourceStr BYTE "Kamran ",0.code
For this homework assignment you are not allowed to use::MOVSB, MOVSW, MOVSD, CMPSB,CMPSW,CMPD,SCASB, SCASW, SCASD,STOSB, STOSW, STOSD, LODSB, LODSW, and LODSD. It is required that for each question write only one procedure that does the requested job. Only write the assembly part and avoid using directives. DO NOT USE IRVINE'S LIBRARY.Write Assembly code (only assembly code and no procedure call) that performs decryption (recovers the original string) of an encrypted string. The encryption is performed by rotating each plaintext byte a varying number of positions in different directions. For example, in the following array that represents the encryption key, a negative value indicates a rotation to the left and a positive value indicates a rotation to the right. The integer in each position indicates the magnitude of the rotation: key BYTE -4, 4, -1, 0, 3, -5, 2, -4Encryption algorithm rotates each plaintext byte by the amount indicated by its matching key array value. Then, align…