Question 02: The following table shows the execution times, in seconds, for five different benchmark programs on three machines. Processor Benchmark R M Z E 417 244 134 F 83 70 70 H 66 153 135 I K 39,449 35,527 66,000 772 368 369 a. Compute the speed metric for each processor for each benchmark, normalized to machine R. That is, the ratio values for R are all 1.0. Other ratios are calculated using Equation (A) with R treated as the reference system. Then compute the arithmetic mean value for each system. b. Repeat part (a) using M as the reference machine. c. Which machine is the slowest based on each of the preceding two calculations? d. Repeat the calculations of parts (a) and (b) using the geometric mean. Which machine is the slowest based on the two calculations? Related Information for Solving Question 2: The speed metric measures the ability of a computer to complete a single task. SPEC (Standard Performance Evaluation Corporation) defines a base runtime for each benchmark program using a reference machine. Results for a system under test are reported as the ratio of the reference run time to the system run time. The ratio is calculated as follows: ri = Trefi Tsuti (A) where Tref¡ is the execution time of benchmark program i on the reference system and Tsut, is the execution time of benchmark program i on the system under test.
Question 02: The following table shows the execution times, in seconds, for five different benchmark programs on three machines. Processor Benchmark R M Z E 417 244 134 F 83 70 70 H 66 153 135 I K 39,449 35,527 66,000 772 368 369 a. Compute the speed metric for each processor for each benchmark, normalized to machine R. That is, the ratio values for R are all 1.0. Other ratios are calculated using Equation (A) with R treated as the reference system. Then compute the arithmetic mean value for each system. b. Repeat part (a) using M as the reference machine. c. Which machine is the slowest based on each of the preceding two calculations? d. Repeat the calculations of parts (a) and (b) using the geometric mean. Which machine is the slowest based on the two calculations? Related Information for Solving Question 2: The speed metric measures the ability of a computer to complete a single task. SPEC (Standard Performance Evaluation Corporation) defines a base runtime for each benchmark program using a reference machine. Results for a system under test are reported as the ratio of the reference run time to the system run time. The ratio is calculated as follows: ri = Trefi Tsuti (A) where Tref¡ is the execution time of benchmark program i on the reference system and Tsut, is the execution time of benchmark program i on the system under test.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Question 02: The following table shows the execution times, in seconds, for five different benchmark
programs on three machines.
Processor
Benchmark
R
M
Z
E
417
244
134
F
83
70
70
H
66
153
135
I
K
39,449
35,527
66,000
772
368
369
a. Compute the speed metric for each processor for each benchmark, normalized to machine R.
That is, the ratio values for R are all 1.0. Other ratios are calculated using Equation (A) with R
treated as the reference system. Then compute the arithmetic mean value for each system.
b. Repeat part (a) using M as the reference machine.
c. Which machine is the slowest based on each of the preceding two calculations?
d. Repeat the calculations of parts (a) and (b) using the geometric mean. Which machine is the
slowest based on the two calculations?
Related Information for Solving Question 2:
The speed metric measures the ability of a computer to complete a single task. SPEC (Standard
Performance Evaluation Corporation) defines a base runtime for each benchmark program using a
reference machine. Results for a system under test are reported as the ratio of the reference run time to
the system run time. The ratio is calculated as follows:
ri =
Trefi
Tsuti
(A)
where Tref¡ is the execution time of benchmark program i on the reference system and Tsut, is the
execution time of benchmark program i on the system under test.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F14cab4c0-d6b1-4f29-9154-304aae3f4ecf%2Fb476ad0c-5a3b-4d30-8e26-a7412f43f504%2Fxte4x1e_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Question 02: The following table shows the execution times, in seconds, for five different benchmark
programs on three machines.
Processor
Benchmark
R
M
Z
E
417
244
134
F
83
70
70
H
66
153
135
I
K
39,449
35,527
66,000
772
368
369
a. Compute the speed metric for each processor for each benchmark, normalized to machine R.
That is, the ratio values for R are all 1.0. Other ratios are calculated using Equation (A) with R
treated as the reference system. Then compute the arithmetic mean value for each system.
b. Repeat part (a) using M as the reference machine.
c. Which machine is the slowest based on each of the preceding two calculations?
d. Repeat the calculations of parts (a) and (b) using the geometric mean. Which machine is the
slowest based on the two calculations?
Related Information for Solving Question 2:
The speed metric measures the ability of a computer to complete a single task. SPEC (Standard
Performance Evaluation Corporation) defines a base runtime for each benchmark program using a
reference machine. Results for a system under test are reported as the ratio of the reference run time to
the system run time. The ratio is calculated as follows:
ri =
Trefi
Tsuti
(A)
where Tref¡ is the execution time of benchmark program i on the reference system and Tsut, is the
execution time of benchmark program i on the system under test.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY