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.)

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.)

Name: Q: Suppose you have a machine which executes a program that consists o
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 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

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 10RQ: How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency...

See similar textbooks

Similar questions

How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency when executing a conditional BRANCH instruction? What techniques can be used to make pipelining more efficient when executing conditional BRANCH instructions?
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Assume you have a computer that runs a programme that is 50% floating point multiply, 20% floating point division, and the other 30% is made up of other instructions. a. Management desires that the machine run four times faster. You can speed up the division by no more than three times and the multiply by no more than eight times. Can you accomplish management's target with just one enhancement, and if so, which one? b. What is the speed of the new machine in comparison to the original machine if you enhance both multiply and divide?
(Amdahl’s law question) Suppose you have a machine which executes a programconsisting of 50% floating point multiply, 20% floating point divide, and the remaining 30% are fromother instructions.(a) Management wants the machine to run 4 times faster. You can make the divide run at most 3 timesfaster and the multiply run at most 8 times faster. Can you meet management’s goal by making onlyone improvement, and which one?
DO YOU BELIEVE IT IS TRUE OR FALSE?The benefit of zero-address instruction computers is that their programs are short; the downside is that the instructions need a significant number of bits, resulting in extensive programs.
01 : (a) Write an assembly language program for the Intel 8086 microprocessor that adds two 16-bit words in the memory locations called ADD1 and ADD2, respectively, and stores the result in a memory location SUM? In the assembly language program, make sure to properly define the different segments using the appropriate assembler directives. (b) Draw a diagram showing the data arrangement in memory for the multiply program you wrote in section (a)?
Imagine we have a small computer which contains a simplified version of a CPU and RAM. The CPU can execute a single program that is stored in the RAM, and while running the program it can access 3 memory locations: its internal register AL, and two RAM locations that we'll call address 1 and address 2. Since this is a simplified computer it is able to skip some of the steps to access memory that are in our textbook, but accessing RAM still takes longer than accessing AL. The only values this computer is capable of storing in memory are unsigned bytes (8 bit binary numbers), and when it starts running a program all 3 of its memory locations initially contain the value 00000000. Here is a list of all of the instructions our imaginary computer can perform: Write [number] to AL This instruction takes the operand [number], which must be an 8-bit binary number, and puts it into AL. This overwrites whatever was in AL previously. It takes 3 cycles to complete: 1 cycle each to fetch, decode,…
How may empty calculation cycles be avoided when a computer processor is processing a big number of instructions? This is a common problem in situations when a computer is doing a lot of calculations. Justify their actions and the consequences that have resulted from them.
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
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)
Assume that the program counter (PC) is set to 0x00000000. Describe how each of the instructions below could be used to set the next value of PC to 0x0FFFFFFC: j beq, jr, jal, bne Please do not just define what each instruction does and please do not give a random example thanks
Q1: Suppose the hypothetical processor has two I/O instructions: (3+3+3)0011=Load AC from I/O0111=Store AC to I/OIn this case, the 12-bit address identifies a particular external device. Show the program execution using figure for the following program:a) Load AC from device 6b) Add contents of memory location 880c) Store AC to device 7 (Note: Question is to be solved similar to the pictures attached with minimum explaination of a line or two with the steps and SHOULD include the memory location 880 as stated in the question)