Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Write a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses.   Try to estimate the average time for an array access with a cache miss and one without.  use the following two loops (in the screenshot provided)

Write a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses.   Try to estimate the average time for an array access with a cache miss and one without.  use the following two loops (in the screenshot provided)

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
100%

Write a c++ code that implements a program that compares the running time for two loops which access very different number of array elements but which should have roughly the same number of cache misses.   Try to estimate the average time for an array access with a cache miss and one without. 

use the following two loops (in the screenshot provided)

Simple Demonstration of Cache Effects. - Compare times for these: int [] a = new int [1,000,000); for (i=0; i< a. length; i++) a[i] x= 3; int [] a = new int [1,000,000]; for (i = 0; i < a. length; i+=16] a [²] *= 3; - hoop I does 16 times as much work as hoop 2, but takes almost the same time: Loop जन 1 2 #multiplications 1,000,000 62,500 tidhe 80ms 78 ms Loop 1 Loop 2 - The time depends on the cache misses, not the multiplications (1 cache miss takes much more time than 16 multiplies.
Transcribed Image Text:Simple Demonstration of Cache Effects. - Compare times for these: int [] a = new int [1,000,000); for (i=0; i< a. length; i++) a[i] x= 3; int [] a = new int [1,000,000]; for (i = 0; i < a. length; i+=16] a [²] *= 3; - hoop I does 16 times as much work as hoop 2, but takes almost the same time: Loop जन 1 2 #multiplications 1,000,000 62,500 tidhe 80ms 78 ms Loop 1 Loop 2 - The time depends on the cache misses, not the multiplications (1 cache miss takes much more time than 16 multiplies.
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS