Repeat Problem 6.34D for a cache with a total size of 128 data bytes. dst array src array Col. 0 Col. 1 Col. 2 Col. 3 Col. 0 Col. 1 Col. 2 Col. 3 Row Row Row Row 1 1 Row Row 2 2 Row Row 3 • sizeof (int) = 4. Consider the following matrix transpose routine: The src array starts at address 0 and the dst array starts at address 64 (decimal). • There is a single L1 data cache that is direct-mapped, write- through, write-allocate, with a block size of 16 bytes. 1 typedef int array[4] [4]; • The cache has a total size of 32 data bytes, and the cache is 2 initially empty. 3 void transpose2 (array dst, array src) • Accesses to the src and dst arrays are the only sources of read 4 { and write misses, respectively. 5 int i, j: A. For each row and col, indicate whether the access to src[row][col] and dst [row][col] is a hit (h) or a miss (m). For example, reading src[0] [0] is a miss and writing dst[0] [0] is also a miss. 7 for (i = 0; i < 4; i++) { 8. for (j = 0; j < 4; j++) { dst [j] [i] = src[i][j]; 9 10 dst array sre array 11 Col. 0 Col. 1 Col. 2 Col. 3 Col. 0 Col. 1 Col. 2 Col. 3 12 Row m Row Row Row Assume this code runs on a machine with the following properties: 1 1 Row Row 2 Row Row 3 3

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

Find the attached problem, for a cache with a total size of 128 data
bytes.

Repeat Problem 6.34D for a cache with a total size of 128 data
bytes.
dst array
src array
Col. 0
Col. 1
Col. 2
Col. 3
Col. 0 Col. 1
Col. 2
Col. 3
Row
Row
Row
Row
1
1
Row
Row
2
2
Row
Row
3
Transcribed Image Text:Repeat Problem 6.34D for a cache with a total size of 128 data bytes. dst array src array Col. 0 Col. 1 Col. 2 Col. 3 Col. 0 Col. 1 Col. 2 Col. 3 Row Row Row Row 1 1 Row Row 2 2 Row Row 3
• sizeof (int) = 4.
Consider the following matrix transpose routine:
The src array starts at address 0 and the dst array starts at
address 64 (decimal).
• There is a single L1 data cache that is direct-mapped, write-
through, write-allocate, with a block size of 16 bytes.
1
typedef int array[4] [4];
• The cache has a total size of 32 data bytes, and the cache is
2
initially empty.
3
void transpose2 (array dst, array src)
• Accesses to the src and dst arrays are the only sources of read
4
{
and write misses, respectively.
5
int i, j:
A. For each row and col, indicate whether the access to
src[row][col] and dst [row][col] is a hit (h) or a miss (m).
For example, reading src[0] [0] is a miss and writing dst[0]
[0] is also a miss.
7
for (i = 0; i < 4; i++) {
8.
for (j = 0; j < 4; j++) {
dst [j] [i] = src[i][j];
9
10
dst array
sre array
11
Col. 0
Col. 1
Col. 2
Col. 3
Col. 0
Col. 1
Col. 2
Col. 3
12
Row
m
Row
Row
Row
Assume this code runs on a machine with the following properties:
1
1
Row
Row
2
Row
Row
3
3
Transcribed Image Text:• sizeof (int) = 4. Consider the following matrix transpose routine: The src array starts at address 0 and the dst array starts at address 64 (decimal). • There is a single L1 data cache that is direct-mapped, write- through, write-allocate, with a block size of 16 bytes. 1 typedef int array[4] [4]; • The cache has a total size of 32 data bytes, and the cache is 2 initially empty. 3 void transpose2 (array dst, array src) • Accesses to the src and dst arrays are the only sources of read 4 { and write misses, respectively. 5 int i, j: A. For each row and col, indicate whether the access to src[row][col] and dst [row][col] is a hit (h) or a miss (m). For example, reading src[0] [0] is a miss and writing dst[0] [0] is also a miss. 7 for (i = 0; i < 4; i++) { 8. for (j = 0; j < 4; j++) { dst [j] [i] = src[i][j]; 9 10 dst array sre array 11 Col. 0 Col. 1 Col. 2 Col. 3 Col. 0 Col. 1 Col. 2 Col. 3 12 Row m Row Row Row Assume this code runs on a machine with the following properties: 1 1 Row Row 2 Row Row 3 3
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Properties of Different Architectures
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.
Similar questions
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