Basic HTML version of Foils prepared 20 February 00

Foil 46 Sequential Memory Structure

From Introduction to Computational Science CPS615 Computational Science Class -- Spring Semester 2000. by Geoffrey C. Fox
1 Data locality implies CPU finds information it needs in cache which stores most recently accessed information
2 This means one reuses a given memory reference in many nearby computations e.g.
3 A1 = B*C
4 A2 = B*D + B*B
5 .... Reuses B
6 L3 Cache
7 Main
8 Memory
9 Disk
10 Increasing Memory
11 Capacity Decreasing
12 Memory Speed (factor of 100 difference between processor
13 and main memory
14 speed)
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Thu Mar 16 2000