1. The execution times for three systems running five benchmarks are shown in the table below. Compare the relative performance of each of these systems (i.e., A to B, B to C, and A to C) using the arithmetic and geometric means. Are there any surprises? Explain System A System B System C Program Execution Execution Execution time time time 45 120 70 200 280 340 250 150 250 400 380 500 800 1100 600 V W X > Z

1. The execution times for three systems running five benchmarks are shown in the table below. Compare the relative performance of each of these systems (i.e., A to B, B to C, and A to C) using the arithmetic and geometric means. Are there any surprises? Explain System A System B System C Program Execution Execution Execution time time time 45 120 70 200 280 340 250 150 250 400 380 500 800 1100 600 V W X > Z

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: 1. Calculate E,D,P for Semi-detached software project using Basic cocomo Model where kloc is 2,ab=…

A: The basic cocomo model is used to calculate the value of Effort, Deployment time & Productivity…

Q: a)If the weights of applications bzip2, mcf, hmmer, and sjeng are 0.25, 0.15, 0.2, and 0.4,…

A: Arithmetic Mean The quantity generated by adding together two or more numbers or variables and…

Q: Ques 4: Consider the design of a pipelined microarchitecture with 12 stages. How many total clock…

A: In computer architecture and instruction execution, pipelining is a technique that allows many…

Q: Assuming the clock periods for two pipelined machines are as follows: Machine 1 without forwarding:…

A: Given, Clock period for Machine 1 without forwarding =300 ps Clock period for Machine 2 without…

Q: (d) What is the overall system throughput in processes done per second? (e) What is the average…

A: >The process which arrives first will be executed first completely.>it is non-pre emptive…

Q: 2) System X executes a program in 17 seconds, System Y executes the same program in 32 seconds: A)…

A: Please give positive ratings for my efforts. Thanks. ANSWER A) The speedup of system X over…

Q: The execution times for three systems running five benchmarks are shown in the following table.…

A: Verification of the ratio being consistent when compared with the other system: System performance…

Q: Compute speed metric for each processor for each benchmark normalized to processor 3. Then compute…

A: Speed metric For benchmark A speed metric = 350/ 350…

Q: 3. Solve the following assembly line problem. Show your work. What is the minimum time? entry 8 5 6…

A: A production method called assembly line balancing sets an anticipated pace of production to…

Q: Compare compilers A and B for a program, where compiler A results in a dynamic instruction count of…

A: Cycles Per Instruction is what CPI stands for. It is a statistic used in computer design to…

Q: A processor takes 100ns and 100pJ for each instruction. The processor can be infinitely pipelined…

A: When designing a processor, various factors such as latency, throughput, and energy consumption are…

Q: A MISD machine is modelled after a systolic array, a kind of array. A systolic array is a collection…

A: Introduction: A systolic array is a network of densely connected data processing units (DPUs)…

Q: Suppose that the following clock cycles per instruction, and frequencies of usage by a particular…

A: 1) CPI is Cycles per instructions 2) CPI can be calculated as sum of product of instruction clock…

Q: A processor with a clock cycle time of 0.5 nanoseconds has a CPI of 4 for a particular program. What…

A: The answer is..

Q: Question 25 Given a processor (P3) with a 4 GHz clock rate and a CPI of 2.2 that executes…

A: To solve this problem, follow these steps:1. Understand the original parameters:Clock rate (f1) = 4…

Concept explainers

Embedded Software Development

Using specific programming languages (like C and C++) to write code for a specific hardware device in which it runs is called embedded software development. It makes the device smart by performing actions based on user's input which improves the user experience. They are designed to perform function-specific tasks rather than doing multiple tasks like computers. The embedded system is incredibly intuitive. An embedded software system could be a system developed and organized on any device, apart from an old-fashioned computer. It is the brain of a specific device; however, it is a solely useless tool and simple to elucidate what software system is embedded.

Question

1. The execution times for three systems running five benchmarks are shown in the table below.
Compare the relative performance of each of these systems (i.e., A to B, B to C, and A to C)
using the arithmetic and geometric means. Are there any surprises? Explain
System A System B System C
Program Execution Execution Execution
time
time
time
45
120
70
200
280
340
250
150
250
400
380
500
800
1100
600
V
W
X
у
N

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Arithmetic mean

VIEW

Step 2: Geometric mean

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 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

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. Lawrence’s computer with a clock rate of 3.32 Ghz and a CPI of 1.2.
1. We wish to compare the performance of two different machines: M1 and M2. The following measurements have been made on these machines: Program Time on M1 Time on M2 1 10 seconds 5 seconds 2 3 seconds 4 seconds Which machine is faster for each program, and by how much? 2. For M1 and M2 of problem 1, the following additional measurements are made:. Find the instruction execution rate (instructions per second) for each machine when running program 1. Program Instructions executed on M1 Instructions executed on M2 1 200 x 106 160 x 106 3. For M1 and M2 of problem 1, if the clock rates are 200 MHz and 300 MHz, respectively, find the CPI for program 1 on both machines using the data provided in problems 1 and 2. 4. You are going to enhance a machine, and there are two possible improvements: either make multiply instructions run four times faster than before or make memory access instructions run two times faster than before. You…
Suppose we had a processor design with 5 stages where each stage takes the following amount of time: IF: 400 ps ID: 200 ps EX: 300 ps MEM: 500 ps WB: 200 psQ1: If you choose a pipelined design, what is the CPI? Assume that we have enough instructions such that the brief ramp up period at the beginning and the ramp down period at the end with less than 100% utilization does not matter. Q2: If you choose a pipelined design, what is the average execution time per instruction in picoseconds?
Suppose that we have the table below that includes four processes with their Arrival times and Burst times, and a Round Robin of time quantum 1 millisecond to be used for CPU scheduling. Answer the following questions: Process Arrival CPU-burst ID time time P1 0 1 P2 3 3 P3 2 4 P4 4 3 Completion Time Response Turn Around Time Time Waiting Time a. Draw the Gantt chart. b. Complete the above table. c. Calculate the average waiting time.
Question 9: Consider the timing diagram of Figure 1. Assume that there is only a five-stage pipeline (fetch, read, encode, execute, and write). Redraw the diagram to show how many time units are now needed for ten instructions. Time 1 | 2 | 3 | 4 | 5 10 11 12 13 14 Instruction 1 DI co FO EI wo FI Instruction 2 FI DI co| Fo EI wo Instruction 3 FI DI co Fo EI wo DI co FO EI Instruction 4 FI wo DI co FO EI DI co FO Instruction 5 FI wo Instruction 6 FI EI wo Instruction 7 FI DI |co FO EI wo Instruction 8 FI| DI co FO wo EI Instruction 9 FI DI co| FO EI wO Figure 1: Timing Diagram for Instruction Pipeline Operation
Explain what you mean by "pipelining" in the context of improving processor speed, and then determine how many cycles it will take to run five instructions assuming each part of the machine requires one cycle. First, we'll look at the situation a) without pipelining and b) with pipelining. There are four ways to do this: a, b, c, and d, all of which include pipelining.