Table 1.1: Execution times Benchmark Processor X Y 1 20 10 40 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.
Table 1.1: Execution times Benchmark Processor X Y 1 20 10 40 40 80 20 Table 1.1 shows the execution times, in seconds, for two different benchmark programs on three machines. i. Compute the arithmetic mean value for each system using X as the reference machine and then using Y as the reference machine. Argue that intuitively, the three machines have roughly equivalent performance and that the arithmetic mean gives misleading results. ii. Compute the geometric mean value for each system, using X as the reference machine and then using Y as the reference machine. Argue that the results are more realistic than with the arithmetic mean.
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
Related questions
Question

Transcribed Image Text:Question 3
Table 1.1: Execution times
Benchmark
Processor
X
Y
1
20
10
40
2
40
80
20
Table 1.1 shows the execution times, in seconds, for two different benchmark programs on
three machines.
i.
Compute the arithmetic mean value for each system using X as the reference machine
and then using Y as the reference machine. Argue that intuitively, the three machines
have roughly equivalent performance and that the arithmetic mean gives misleading
results.
ii. Compute the geometric mean value for each system, using X as the reference machine
and then using Y as the reference machine. Argue that the results are more realistic
than with the arithmetic mean.
Question 4
i.
Consider an L1 cache with an access time of 1 ns and a hit ratio of Suppose that we
can change the cache design (size of cache, cache organization) such that we increase
H to 0.97, but increase access time to 1.5 ns. What conditions must be met for this
change to result in improved performance?
ii.
Explain why this result makes intuitive sense.
1
Question 5
i. List some reasons why it is worthwhile to study assembly language programming.
ii. Section 15.4 includes a C program that calculates the greatest common divisor of two
integers. Describe the algorithm in words and show how the program does implement
the Euclid algorithm approach to calculating the greatest common divisor.

Transcribed Image Text:Question 1
You are to write an IAS program to compute the results of the following equation.
Y =
Assume that the computation does not result in an arithmetic overflow and that X, Y, and N
are positive integers with N2 1. Note: The IAS did not have assembly language, only
machine language.
N(N + 1)
Sum(Y) =
i.
Use the equation
2
when writing the IAS program.
ii.
Do it the "hard way," without using the equation from part (i).
Question 2
a. On the IAS, what would the machine code instruction look like to load the contents of
memory address 2 to the accumulator?
b. How many trips to memory does the CPU need to make to complete this instruction
during the instruction cycle?
Question 3
Table 1.1: Execution times
Benchmark
Processor
X
Y
1
20
10
40
2
40
80
20
Table 1.1 shows the execution times, in seconds, for two different benchmark programs on
three machines.
i.
Compute the arithmetic mean value for each system using X as the reference machine
and then using Y as the reference machine. Argue that intuitively, the three machines
have roughly equivalent performance and that the arithmetic mean gives misleading
results.
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!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images

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.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education