3. The following table shows the execution times, in seconds, for three differentbenchmark programs (A, B and C) on three machines (P, Q and R).BenchmarkABCExecution Time (in seconds)MachineQ5MachineP1027535631503110MachineR32103610(a) Compute the speed metric for each machine for each benchmarknormalized to machine P (i.e., P is considered the reference system).(b) Which machine is the fastest based on the preceding calculations?

Dear Student, The answer to your question is given below -

3. The following table shows the execution times, in seconds, for three different benchmark programs (A, B and C) on three machines (P, Q and R). Benchmark A B C Execution Time (in seconds) Machine Machine P 10 275 3563 Q 5 150 3110 Machine R 3 210 3610 (a) Compute the speed metric for each machine for each benchmark normalized to machine P (i.e., P is considered the reference system). (b) Which machine is the fastest based on the preceding calculations?

3. The following table shows the execution times, in seconds, for three different benchmark programs (A, B and C) on three machines (P, Q and R). Benchmark A B C Execution Time (in seconds) Machine Machine P 10 275 3563 Q 5 150 3110 Machine R 3 210 3610 (a) Compute the speed metric for each machine for each benchmark normalized to machine P (i.e., P is considered the reference system). (b) Which machine is the fastest based on the preceding calculations?

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: please help with parts a and b with steps/explanation!

A: Process :Process P1 must complete before P2, P3, and P5P2 must complete before P3 and P4P3 must…

Q: Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this…

A: Answer is given below

Q: Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a…

A: Hello student Greetings In the context of task scheduling, the problem involves scheduling a set…

Q: Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS…

A: Let I represent an execution of init(s), W of wait(s), and S of signal(s). Then, for example, IWWS…

Q: In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 =…

A: According to the information given:- We have to follow the instruction to perform above task.

Q: you noticed that the time required for vector-vector addition did not continue to decrease beyond…

A: The reason behind this is the limited or finite resources that a computer has which eventually…

Q: For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround…

A: All the process arrive at same time in the sequence P1->P2->P3->P4. The time quantum time…

Q: Given the following descriptions of FSA, please answer the following questions. Q = {90, 91, 92, 93}…

A: Here in this question we have given a transition function of a FSA.and we have asked to draw a…

Q: here are two compilers C1 and C2, from different companies. These two are used to create executables…

A: Given :- operating at 15MHZ instruction size of C1 = 150 and C2 = 171…

Q: 16MB RAM sel Id cir Text Memory PC Value to Register A Bus B Bus C Bus 1 Rs, Rn 2 MUX Rs *3 MUX Rn…

A: MSCPU The MSCPU, which implements the flexible operand, or Operand2, of the ARM CPU, is represented…

Q: P2 P3 CPU CPU 2s 4s In the above figure, assume P1, P2, and P3 arrive in order and at almost the…

A: We are given three processes P1, P2 and P3. They need CPU time of 3s, 4s and 2s respectively. Also…

Q: 1. In this part you are asked to recognize what a given segment of machine code does, by translating…

A: The instructions are given in the upper table we just have to write ehat each address means and what…

Q: 5-Consider a computer running a program that requires 400 s, with 80 s spent executing FP…

A: I solved only one question according to Bartleby policy.

Q: Q2/ Consider three different processors P1, P2, and P3 with the clock rates and CPIs given in the…

A: Processor P1:Processor P2:Processor P3:Processor P2 has the lowest number of cycles, so it's the…

Q: translate code in assembly language

A: push rbp mov rbp, rsp mov DWORD PTR [rbp-4], 0 jmp .L2.L5:…

Concept explainers

Computer Fundamentals

The computer is termed computation. For calculating or computing something the device that has been used is known as the computer. Or we can say that for performing a fast arithmetic operation the device that has been used is a computer. Storing, processing, and retrieving are the main features of a computer. 

Question

3. The following table shows the execution times, in seconds, for three different
benchmark programs (A, B and C) on three machines (P, Q and R).
Benchmark
A
B
C
Execution Time (in seconds)
Machine
Q
5
Machine
P
10
275
3563
150
3110
Machine
R
3
210
3610
(a) Compute the speed metric for each machine for each benchmark
normalized to machine P (i.e., P is considered the reference system).
(b) Which machine is the fastest based on the preceding calculations?

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1 Explanation

VIEW

Step 2 Answer

VIEW

Step by step

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

Compare compilers A and B for a program, where compiler A results in a dynamic instruction count of 6.9x10^9 and an execution time of 5 seconds, and compiler B results in a dynamic instruction count of 5.1x10^9 and an execution time of 4 seconds. a. Find the average CPI for each program, given a processor clock cycle time of 2 ns. b. If the compiled programs run on two different processors with the same execution times, what is the relative speed of the processor clocks?
10. 10. Amdahl's Law is as applicable to software as it is to hardware. An oft-cited programming truism states that a program spends 90% of its time executing 10% of its code. Thus, tuning a small amount of program code can often have an enormous effect on the overall performance of a software product. Determine the overall system speedup if: 1. a) 90% of a program is made to run 10 times as fast (900% faster). 2. b) 80% of a program is made to run 20% faster.
Creat sequence diagram for 1101 create a) State diagram. b) current state-future state tables. c) table of entries of the F.F d) K maps 5
Q3: Suppose there is a processing unit composed by CPU and I/O component. For a specific task, CPU takes 5 second to finish the execution and I/O takes 2 second to process. The communication time between CPU and I/O can be elimiate under this circumstance. Execution Time 7 second 5second 2 second CPU time I/O time If CPU time decreases by 25% per year for 3 years and I/O time decreases by 20% per year 1) How many times faster is this program after 3 years? 2) What percentage of new time is I/O? and what percentage of new time is CPU?
Trace the execution of the following "Super Simple CPU" program and for a) each step record the values of the Accumulator, Mem[10] (memory location 10), Mem[11], and Mem[12]. The values before the execution starts are shown. LOD 11 XXX ТОР JZR JNG SUB 10 STO 11 YYY JMP TOP XXX LDI 1 STO 12 STP LDI 0 YYY STO 12 STP Mem[10] Mem[11] Mem[12] Accumulator 12 24 15
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:The Ricart& Argwala mutual exclusion algorithm: (a) Does not depend on time stamps in messages while Lamport's does. (b) Cannot handle the case where two or more processes request the same resource at the same time. (c) Does not require a process to send messages to the entire group while Lamport's does. (d) Requires fewer messages than Lamport's algorithm.