ECE353Lab1CacheSimulation.pptVIP

ECE 353Lab 1: Cache Simulation Purpose Introduce C programming by means of a simple example Reinforce your knowledge of set associative caches C Many of the constructs are very similar to those found in Java In many other respects, C is more primitive: Not object-oriented Lacks inbuilt garbage collection, some checks (e.g. array bounds) C carries out implicit type conversions when appropriate Some C Constructs Relational, logical , =, , =, ==, != , ||, ! Arithmetic +, -, *, /, % C Constructs (contd.) Some control constructs: while( ) { }; if ( ) { }; for (i=0; i100; i++) { }; Data Types int char float double long short Arrays x[1000] is a linear array of 1000 elements Y[100][100] is a two-dimensional 100x100 array Variable names (like other things in C) are type-sensitive: Y is not the same as y. Example Pointers A pointer is a variable which contains the address of some other variable. int *i is the declaration of an integer whose address is stored in i. int j is the declaration of another integer; its address is obtained by using the address operator, . That is, the location of j is given by j. Opening Files: Example Cache Simulation Parameters: Cache size, in bytes Block or line size Set associativity, i.e., number of lines per set Hit rate is the fraction of memory accesses that can be served by the cache Cache Simulation (contd.) Given the following: Cache parameters Memory access trace Obtain: Cache hit rate Set Associative Organization Typical Performance  Use split caches because there is more spatial locality in code: Simulation Maintain the cache directory (as an array) and LRU status of the lines within each set When an access is made, update LRU status. If a hit, record it as such If a miss, update the contents of the directory * #include stdio.h #include math.h #define SIZE 100 main(){ int iter; int a[SIZE], b[SIZE], c[SIZE]; for (iter=0; iterSIZE; iter++){ c[iter] = iter*3; b[iter] = i