Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Computer System Design assignment
C++ Python
tree: d101cae07a

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
matrix
.gitignore
Access.cpp
Access.h
Block.cpp
Block.h
Cache.cpp
Cache.h
INPUT
Makefile
Memory.cpp
Memory.h
README.md
Report.txt
Set.cpp
Set.h
cases.py
main.cpp

README.md

Implementation of cache-unaware, cache-aware, and cache-oblivious matrix multiplication algorithms

The project consists of two parts:

  • Building a cache simulator
    • Design a cache simulator where user can specify the cache parameters such as cache size, associativity, block size. The cache simulator uses the LRU replacement policy. The simulator need not store the actual data, but it keeps track of data references. It has to give the statistics such as overall accesses, compulsory misses, capacity misses, conflict misses, and hit rate.
  • Implementing various matrix multiplication algorithms
    • By assuming the elements of a matrix are stored in row-major order, design and implement cache-unaware, cache-aware, and cache-oblivious matrix multiplication algorithms and report the cache statistics using the above simulator.
Something went wrong with that request. Please try again.