#include

#include

#include

const int dimension $=256$;

struct timeval tv;

double timestamp$()$

$\{$

double t;

gettimeofday$($&tv$,$ NULL$)$;

t $=$ tv$.$tv$\_$sec $+($tv$.$tv$\_$usec$/1000000\mathrm{.}0)$;

return t;

$\}$

int main$($int argc, char $*$argv$[])$

$\{$

int i$,$ j$,$ k;

double $*$A$,*$B$,*$C$,$ start, end;

A $=($double$*)$malloc$($dimension$*$dimension$*$sizeof$($double$))$;

B $=($double$*)$malloc$($dimension$*$dimension$*$sizeof$($double$))$;

C $=($double$*)$malloc$($dimension$*$dimension$*$sizeof$($double$))$;

srand$(292)$;

for$($i $=0$; i $<$ dimension; i$++)$

for$($j $=0$; j $<$ dimension; j$++)$

$\{$

A$[$dimension$*$i$+$j$]=($rand$()/($RAND$\_$MAX $+1\mathrm{.}0))$;

B$[$dimension$*$i$+$j$]=($rand$()/($RAND$\_$MAX $+1\mathrm{.}0))$;

C$[$dimension$*$i$+$j$]=0\mathrm{.}0$;

$\}$

start $=$ timestamp$()$;

$//$ijk form

for$($i $=0$; i $<$ dimension; i$++)$

for$($j $=0$; j $<$ dimension; j$++)$

for$($k $=0$; k $<$ dimension; k$++)$

C$[$dimension$*$i$+$j$]+=$ A$[$dimension$*$i$+$k$]*$ B$[$dimension$*$k$+$j$]$;

end $=$ timestamp$()$;

printf$("$

secs:$\%$f

$",$ end$-$start$)$;

free$($A$)$;

free$($B$)$;

free$($C$)$;

return $0$;

$\}$ L$1$: $320$ kb$,$ theoretically calculate the cache hit and miss rates at the L$1$ level.