The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000. There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable. Algorithm Sum = 0 For i in range (0, n); Sum += i; Print (“sum =, sum) How many memory accesses and clocks are required by this algorithm?
The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000. There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable. Algorithm Sum = 0 For i in range (0, n); Sum += i; Print (“sum =, sum) How many memory accesses and clocks are required by this algorithm?
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
The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000.
There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable.
Sum = 0
For i in range (0, n);
Sum += i;
Print (“sum =, sum)
How many memory accesses and clocks are required by this algorithm?
Expert Solution
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 3 steps
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