Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
3. Assume N = 32 and using a direct mapped cache with parameters (m; S; E; B) = (32; 8; 1; 8). Describe cache hits and misses during the execution of the code. int data[N]; //an array of integers int sum function () { int suml = 0, sum2 = 0, result; int I = 0; for (i = 0; i < N; i++) { suml += data[i]; suml /= N; for (i = 0; i < N; i++) %3D sum2 += data[i] * data[i]; } sum2 /= N; result (sum2 - suml*suml); %3D

3. Assume N = 32 and using a direct mapped cache with parameters (m; S; E; B) = (32; 8; 1; 8). Describe cache hits and misses during the execution of the code. int data[N]; //an array of integers int sum function () { int suml = 0, sum2 = 0, result; int I = 0; for (i = 0; i < N; i++) { suml += data[i]; suml /= N; for (i = 0; i < N; i++) %3D sum2 += data[i] * data[i]; } sum2 /= N; result (sum2 - suml*suml); %3D

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
3. Assume N = 32 and using a direct mapped cache with parameters (m; S; E; B) = (32; 8; 1; 8). Describe cache hits and misses during the execution of the code. int data [N]; //an array of integers int sum function () { int suml int I = 0; 0, sum2 0, result; for (i = 0; i < N; i++) { suml += data [i]; } suml /= N; for (i = 0; i < N; i++) { sum2 += data[i] data[i]; } sum2 /= N; result = (sum2 suml*suml); - return result; }
Transcribed Image Text:3. Assume N = 32 and using a direct mapped cache with parameters (m; S; E; B) = (32; 8; 1; 8). Describe cache hits and misses during the execution of the code. int data [N]; //an array of integers int sum function () { int suml int I = 0; 0, sum2 0, result; for (i = 0; i < N; i++) { suml += data [i]; } suml /= N; for (i = 0; i < N; i++) { sum2 += data[i] data[i]; } sum2 /= N; result = (sum2 suml*suml); - return result; }
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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