dont use aia)A benchmark program takes 80 seconds to finish on a machine, with floating point arithmetic representing 70% of the time. The hardware engineering team plans to optimize floating point arithmetic of the machine by a factor of 3. What is the expected overall improvement of speed? (b) It turns out that the hardware team is only able to optimize the floating-point arithmetic by a factor of 2. To remedy the shortfall, the software team now wants to adjust the proportion of floating-point arithmetic in the program so as to still achieve the performance improvement claimed in (a) above. What is the needed final proportion of floating-point arithmetic in the benchmark program?

dont use aia)A benchmark program takes 80 seconds to finish on a machine, with floating point arithmetic representing 70% of the time. The hardware engineering team plans to optimize floating point arithmetic of the machine by a factor of 3. What is the expected overall improvement of speed? (b) It turns out that the hardware team is only able to optimize the floating-point arithmetic by a factor of 2. To remedy the shortfall, the software team now wants to adjust the proportion of floating-point arithmetic in the program so as to still achieve the performance improvement claimed in (a) above. What is the needed final proportion of floating-point arithmetic in the benchmark program?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter3: Assignment, Formatting, And Interactive Input

Section: Chapter Questions

Problem 9PP: (Electrical eng.) a. Write, compile, and run a C++ program that calculates and displays the value of...

See similar textbooks

Similar questions

Question 6 You ran a benchmark program on a machine with a 200 MHz clock. For unoptimized code it executes 250000 instructions in 5.0 ms (milliseconds). For optimized code it executes 80000 instructions in 1.2 ms. Use calculator, paper, and pencil to do the needed calculations and write down the final value with two decimal places (X.XX) in the corresponding blank. • The CPI of the unoptimized code is Blank 1 • The CPI of the optimized code is Blank 2 Blank 1 Blank 2
branch instructions -> machine language translationThe following programme gives an example of how to calculate the branch offsets in a programme once the process for computing the branch offsets for the branch instructions has been described. Because the final two bits of the address will be dropped in this case, the branch offsets may be calculated by simply adding or subtracting line numbers. In contrast to "the $pc contains the address of line," which would be erroneous, the text will thus read "the $pc points to line," which is accurate.
Please refer to this textbook: “A. Silberschatz, P. B. Galvin and G. Gagne, “Operating System Principles,”7th Edition, John Wiley & Sons Inc., 2006.” And answer the following questions: Question:24 Has the Banker's algorithm for deadlock detection been widely used on general-purpose operating systems such as Windows or Linux? If yes, give an example showing how it is used on general-purpose operating systems. If not, explain why it is not widely in use.
Pag (A) a dedicated accumulator. All instructions and operands are stored in memory, and are of the same size, consisting of opcode and memory address. If no operand is needed, memory address is 0. The machines instructions are fetched from memory, the opcode is decoded, and then the instruction is executed. Assume that we have a computer with 200 opcodes and a memory address of 10 bits. It This computer has a dedicated accumulator AC, program counter PC, memory address register MA memory buffer register MBR, an instruction register IR, and an arithmetic logic unit. 1. What is the size of opcode in bits? bits 2. What will be the largest number of words in the memory (write in decimal)? words 3. What is the size of the memory word in bits? bits 4. What are the sizes of the following registers in bits? MAR: PC: AC: MBR:
Discussion: Write an assembly language program to perform the following arithmetic operations: Y = 5/C*A Where Y is a M.L. specified by SI and (A = 14H, B = 05H, C = 04H , SI = 2000H). %3D
Computer Science The computer science department would like to create an analog clock with the numbers for the hours shown in binary. Due to space concerns, each hour should show the same number of digits with preceding zeros. What is the max number of digits per hour that they would need to show all the binary numbers on the clock? How did you come up with the solution?
Instruction: Follow the process (steps) below. Provide answer with solution. (Step 1): *refer to the photo below* (Step 2): The location of computer terminals are represented by the following capital letters and their respective distances to their adjacent terminal is shown in the table below: Adjacent Computers Distance (in meters) A&B 7 A&E 5 B&C 6 B&F 5 C&G 5 C&D 8 D&H 6 E&B 9 E&F 8 E&I 3 F&G 4 F&M 8 G&M 9 G&H 10 H&K 2 H&J 5 I&L 3 I&M 11 J&M 9 J&K 7 K&T 8 L&N 4 L&M 10 M&Q 5 M&R 7 M&S 10 N&O 6 N&Q 12 Q&R 7 R&S 8 S&T 10 Determine the minimum length of cable wire required in the construction of the network in their office. How much will it cost the cable required if 1…
Assume: CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write) Problem size: N = 1,000,000 (1 million) There is no cost associated with the loop index variable: do not count any arithmetic instructions for initializing or incrementing the loop index value, do not count any memory accesses for accessing and using the loop index variable in your computation of a sum. Assume the loop index variable is "free of charge" There is no memory cost of accessing and updating your accumulator variable (e.g., sum += ...), but there is an arithmetic operation involved in updating the accumulator variable. Questions: 1. For algorithm #1 shown below (direct sum): • How many arithmetic instructions are required by this algorithm? • How many memory accesses are required by this algorithm? • How many clocks are required by this algorithm? • What is the CPI (cycles per instruction) required by this algorithm? •…
Write the CPU performance equation.
ASSEMBLY PROGRAMMING Course Title: Computer Organization and ArchitectureObjectives: To develop an assembly program that applies the knowledge of input character and output character functions, as well as arithmetic and bit manipulation instructions.Topics Covered: Input Character (AH=1, INT 21h), Output Character (AH=2, INT 21h)Arithmetic instructions, Bit manipulations. SEE ATTACHED PHOTO FOR THE FINAL OUTPUT
PLEASE SOLUTION WITH EXPLAIN Q4) If the CPU clock frequency is 100MHz, calculate the time taken to execute the program.
10. The number of clockcycles that take to wait until the length of the instruction is known in order to start decoding is a) 0 b) 1 c) 2 d) 3