lab3-handout/trans.c /* * trans.c - Matrix transpose B = A^T * * Each transpose function must have a prototype of the form: * void trans(int M, int N, int A[N][M], int B[M][N]); * * A transpose...

screenshots and videos/1.png
screenshots and videos/video1.mp4
screenshots and videos/2.png
screenshots and videos/3.png
screenshots and videos/4.png
screenshots and videos/5.png
screenshots and videos/6.png
screenshots and videos/video2.mp4
vincent-handin.tar
csim.c
// Name: Vincent Caliendo
#include "lab3.h"
#include
#include
#include
#include
//64 bit variable type we will use to hold memory addresses
typedef unsigned long long int memAddress;
//struct used to store and group all the needed parameters of the cache together
struct Parameters {
int s;         //number of set index bits (the number of sets is 2^s)
int S;         //total number of sets (calculated from 2^s)
int E;         //number of lines per set (associativity)
int b;         //number of block bits (the block size is 2^b)
int B;         //block size (calculated from 2^b)
int hits;     //Number of hits
int misses;     //Number of misses
int evicts;     //Number of evictions
int verbose;     //verbosity flag
};
//lines that will be stored in sets
struct setLine{
int uses;
int valid;
unsigned long long tag;
char *block;
};
//a set is made up of lines
struct cacheSet{
struct setLine *lines;
};
//a cache is made up of sets which contain lines
struct Cache{
struct cacheSet *sets;
};
struct Cache build(long long totalSets, int totalLines, int blockSize){
struct Cache newCache;
struct cacheSet set;
struct setLine line;
//allocate memory for the new cache based off of how many total sets it will have
newCache.sets = (struct cacheSet*) malloc(sizeof(struct cacheSet)* totalSets);
for (int i = 0; i < totalSets; i++){
//allocate memory for each line in each set of the new cache
set.lines = (struct setLine*) malloc (sizeof(struct setLine) * totalLines);
//assigns the newly created sets to the cache
newCache.sets[i] = set;
//sets the value of every field in each line to 0 and then assigns them to the sets within the cache
for (int j = 0; j < totalLines; j ++){
line.uses = 0;
line.valid = 0;
line.tag = 0;
set.lines[j] = line;
}
}
return newCache;
}
void printUsage(){
printf("Usafe: /csim-ref [-hv] -s -E -b -t \n");
printf("-h: Optional help flag that prints usage info\n");
printf("-v: Optional verbose flag that displays trace info\n");
printf("-s : Number of set index bits (the number of sets is 2^s)\n");
printf("-E : Associativity (number of lines per set)\n");
printf("-b : Number of block bits (the block size is 2^b)\n");
printf("-t : Name of the valgrind trace to replay\n");
}
//returns the line number of the least recently used line (meaning that it meets the requirements for eviction)
int findLRU(struct cacheSet set, struct Parameters param){
int totalLines = param.E;
int minUses = set.lines[0].uses;
int LRU = 0;
//loop through every line in the set, saving the line number of the line with the least uses
//and its number of uses for comparison with the rest of the set, replacing it if another line
//is found with less uses
for(int i = 0; i < totalLines; i++){
if(set.lines[i].uses < minUses){
LRU = i;
minUses = set.lines[i].uses;
}
}
return LRU;
}
//returns the line number of the most recently used line (meaning that it belongs in the cache)
int findMRU(struct cacheSet set, struct Parameters param){
int totalLines = param.E;
int maxUses = set.lines[0].uses;
int MRU = 0;
//loop through every line in the set, saving the line number of the line with the most uses
//and its number of uses for comparison with the rest of the set, replacing it if another line
//is found with more uses
for(int i = 0; i < totalLines; i++){
if(set.lines[i].uses > maxUses){
MRU = i;
maxUses = set.lines[i].uses;
}
}
return MRU;
}
//Determines if there is a hit
int checkHit(struct setLine line, memAddress address){
return line.tag == address && line.valid;
}
//Determines if a given set is full
int isSetFull(struct cacheSet set, struct Parameters param){
int totalLines = param.E;
for(int i=0;i //if we find an empty line then the set is not full, so return 1
if(set.lines[i].valid == 0){
return 1;
}
}
//no empty lines so the set is full
return 0;
}
//checks whether any lines in a given set are empty and returns the number of
//the empty line if one exists, if there are none then return 0 because therefore the set is full
int anyEmptyLines(struct cacheSet set, struct Parameters param){
int totalLines = param.E;
struct setLine line;
for (int i = 0; i < totalLines; i++){
line = set.lines[i];
//if a line is not valid return its line number
if(line.valid == 0){
return i;
}
}
return 0;
}
struct Parameters Simulation(struct Cache aCache, struct Parameters param, memAddress address){
//calculate the size of the tag by subtracting the
//sum of the number of block bits and the number of sets in the cache from 64
int tagSize = 64-(param.b + param.s);
//calculate the address tag by shifting the address to the right by the sum of the sets and block bits
memAddress addressTag = address >> (param.s +...