100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Exam (elaborations) ENGR 325 ENGR 325 HOMEWORK #7 KEY FALL 2015 $10.49   Add to cart

Exam (elaborations)

Exam (elaborations) ENGR 325 ENGR 325 HOMEWORK #7 KEY FALL 2015

 0 view  0 purchase
  • Course
  • Institution

ENGR 325 HOMEWORK #7 KEY FALL 2015 1. (5) In this exercise we look at memory locality properties of matrix computation. The following code is written in C, where elements within the same row are stored contiguously. Assume each word is a 32-bit integer. (P&H 5.1, §5.1) for (I=0; I<8; I++)...

[Show more]

Preview 2 out of 7  pages

  • April 30, 2022
  • 7
  • 2021/2022
  • Exam (elaborations)
  • Questions & answers
avatar-seller
Your text here

Page |1


ENGR 325

HOMEWORK #7 KEY

FALL 2015



1. (5) In this exercise we look at memory locality properties of matrix computation. The following code
is written in C, where elements within the same row are stored contiguously. Assume each word is
a 32-bit integer. (P&H 5.1, §5.1)
for (I=0; I<8; I++)
for (J=0; J<8000; J++)
A[I][J]=B[I][0]+A[J][I];




m
a. How many 32-bit integers can be stored in a 16-byte cache block?




er as
b. References to which variables exhibit temporal locality?




co
eH w
c. References to which variables exhibit spatial locality?




o.
Locality is affected by both the reference order and data layout. The same computation can also be
rs e
written below in Matlab, which differs from C by storing matrix elements within the same column
ou urc
contiguously in memory.
for I=1:8
o

for J=1:8000
aC s


A(I,J)=B(I,0)+A(J,I);
vi y re


end
end
d. How many 16-byte cache blocks are needed to store all 32-bit matrix elements being
ed d




referenced?
ar stu




e. References to which variables exhibit temporal locality?
f. References to which variables exhibit spatial locality?
sh is




SOLUTION:
Th




a. Each 32-bit integer requires 4 bytes to store, therefore FOUR 32-bit integers can be stored in the
16-byte block.
b. Consider the access sequence:
A[0][0] = B[0][0] + A[0][0]
A[1][0] = B[0][0] + A[0][1]
A[2][0] = B[0][0] + A[0][2]

A[7999][0] = B[0][0] + A[0][7999]
A[0][1] = B[1][0] + A[1][0]

⇒ Variables I, J, and B[I][0] exhibit temporal locality.



This study source was downloaded by 100000841990434 from CourseHero.com on 04-30-2022 15:06:17 GMT -05:00
https://www.coursehero.com/file/13091124/homework-7-key/


https://www.coursehero.com/file/23339404/homework-7-key/

, Page |2


c. Variables A[I][J] and B[I][0] exhibit spatial locality.
d. Consider the access sequence:
A(1,1) = B(1,0) + A(1,1)
A(1,2) = B(1,0) + A(2,1)
A(1,3) = B(1,0) + A(3,1)

A(1,8000) = B(1,0) + A(8000,1)
A(2,1) = B(2,0) + A(1,2)
A(2,2) = B(2,0) + A(2,2)

A(2,8000) = B(2,0) + B(8000,2)

A(8,1) = B(8,0) + A(1,8)
A(8,2) = B(8,0) + A(2,8)





m
er as
A(8,8000) = B(8,0) + A(8000,8)




co
eH w
Matrix A begins as an 8-row by 8000-column matrix and is transformed into an 8000-row by 8-




o.
column matrix. So for the A matrices:
rs e
Elements = 8 x 8000 = 64,000
ou urc
Total elements in the beginning and ending matrix: 64000 x 2 = 128,000
Matrix elements per cache block: 4, as per 5.1.1.
o

Total cache blocks: 128,000 ÷ 4 = 32,000
aC s
vi y re


Note, however, that the “upper left” eight by eight elements overlap, so cache is not needed
for those. Therefore we can subtract 8 x 8 ÷ 4 = 16 cache blocks.
For the B matrix:
ed d




Elements = 8 x 1 = 8
ar stu




Matrix Elements per cache block: 4, as above
Total cache blocks: 8 ÷ 4 = 2
Total 16-byte cache blocks = 32000 – 16 + 2 ⇒ 31,986 cache blocks are required.
sh is




e. As in 5.1.2, variables I, J, and B(I,0) exhibit temporal locality.
Th




f. Unlike in C, in MATLAB matrix elements in the same column are stored contiguously. Therefore
the variables A(J,I) and B(I,0) exhibit spatial locality.
2. (10) Caches are important to providing a high-performance memory hierarchy to processors. Below
is a list of 32-bit memory address references, given as word addresses:
3, 180, 43, 2, 191, 88, 190, 14, 181, 44, 186, 253 (P&H 5.2, §5.3)
a. For each of these references, identify the binary address, the tag, and the index given a direct-
mapped cache with 16 one-word blocks. Also list if each reference is a hit or a miss, assuming
the cache is initially empty.




This study source was downloaded by 100000841990434 from CourseHero.com on 04-30-2022 15:06:17 GMT -05:00
https://www.coursehero.com/file/13091124/homework-7-key/


https://www.coursehero.com/file/23339404/homework-7-key/

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller ElonMusk. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $10.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

72349 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$10.49
  • (0)
  Add to cart