CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write)

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
icon
Related questions
Question
Assume:
CPU Clock = 1 GHz
1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.)
1 memory access requires 100 clock cycles (Read or Write)
Problem size: N = 1,000,000 (1 million)
There is no cost associated with the loop index variable: do not count any arithmetic
instructions for initializing or incrementing the loop index value, do not count any memory
accesses for accessing and using the loop index variable in your computation of a sum.
Assume the loop index variable is "free of charge"
There is no memory cost of accessing and updating your accumulator variable (e.g., sum
+= ...), but there is an arithmetic operation involved in updating the accumulator variable.
Questions:
1. For algorithm #1 shown below (direct sum):
• How many arithmetic instructions are required by this algorithm?
• How many memory accesses are required by this algorithm?
• How many clocks are required by this algorithm?
• What is the CPI (cycles per instruction) required by this algorithm?
•
What is the estimated execution time for this algorithm in seconds or fractions of
seconds, not counting the print and any problem setup?
Algorithm #1 - Direct Sum
Objective: compute the sum of integers 0..N-1
sum = 0
for i in range(0,N):
sum += i
print("sum = ", sum)
Transcribed Image Text:Assume: CPU Clock = 1 GHz 1 OP requires 5 clock cycles (arithmetic instruction, conditional, etc.) 1 memory access requires 100 clock cycles (Read or Write) Problem size: N = 1,000,000 (1 million) There is no cost associated with the loop index variable: do not count any arithmetic instructions for initializing or incrementing the loop index value, do not count any memory accesses for accessing and using the loop index variable in your computation of a sum. Assume the loop index variable is "free of charge" There is no memory cost of accessing and updating your accumulator variable (e.g., sum += ...), but there is an arithmetic operation involved in updating the accumulator variable. Questions: 1. For algorithm #1 shown below (direct sum): • How many arithmetic instructions are required by this algorithm? • How many memory accesses are required by this algorithm? • How many clocks are required by this algorithm? • What is the CPI (cycles per instruction) required by this algorithm? • What is the estimated execution time for this algorithm in seconds or fractions of seconds, not counting the print and any problem setup? Algorithm #1 - Direct Sum Objective: compute the sum of integers 0..N-1 sum = 0 for i in range(0,N): sum += i print("sum = ", sum)
Expert Solution
Step 1

Computer Science homework question answer, step 1, image 1

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Fundamentals of Computer System
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education