Each Simulation Assumes the Cache is initially Empty.
The cache definition is stated as 4 positive intergers that describes the cache
- W is the number of bits in one word. This number will be a multiple of 8.
- C is the number of data bytes in the cache. This number will be a power of 2. (In C, we do not count the space needed to store tags, just the space needed to store data.)
- B is the number of bytes in one cache block. This number will be a divisor of C.
- k is the number of lines in a block. This number will be a divisor of B.
Input the cache description as well as the cache and click Simulate
The output will be a String containing the letter C, M or both.
For each memory access in the input, the page will print a 'C' if it is served by the cache, and print 'M' if it is served by the memory.
Follow this layout in order for the simulator to work.
Only enter Positive Integers
Ensure to leave a new line after each cache.
Ensure to leave a space between each cache definition.
- W = 32
- C = 1024
- B = 64
- k = 4