Requirements for cache simulator, Computer Engineering

Using your cache simulator and using smalltex.din as your memory trace determine the total miss rate, compulsory miss rate, capacity miss rate, and conflict miss rate for the following cache configurations by varying the inputs as suggested below. Examine your results/observations in each case and compare them to a run using dineroiv (a commercial cache simulator). This exercise is to validate the operation of your simulator compared to a commercial simulator and to familiarize yourself with the results that occur for each architecture. Comparing your results with dinero validates your cache simulator. Answering the questions below will help you gain a deeper understanding of the function/operation of caches with respect to various trace files and any patterns within trace files.

1. Keeping block size constant (say 64 bytes) compare the different replacement policy's with several cache sizes (say 16, 64, 256, 512KB) and associativity (direct, 2-, 4-, 8-way, fully associative). Note the trends and confirm your observations from your cache simulator with dineroiv

2. Keeping replacement policy constant (for random and then LRU) and block size constant (say 64 bytes) collect total, compulsory, capacity, and conflict miss rates for each of the following cache organizations and compare with the results from dineroiv.:-

3. Cache sizes 4, 16, 64, 128, 256, 512 KB,

4. Degree of associativity 1-way, 2-way, 4-way, 8-way, fully.

5. To ensure that your cache simulator is fully operational you should be able to perform the following:-

a.  Accept any block sizes from 2 bytes to 2048 bytes,

b.  Accept any cache size from 1Kb to 8MB,

c.  Accept either LRU or random replacement policy for each run,

d.  Accept the following degree of associativity, Direct, 2-way, 4-way, 8-way, and fully associative.

6.  Additionally, to help you anaylze the operation of caches with a trace file be prepared to perform the following:-

(a) What is the largest address in smalltex.din?  (Write a small C program to find this value is it will affect your declarations ó int, long long, unsigned,...etc.)

(b) Is there a pattern in the trace file - if so, estimate the occurrences of the pattern and how it will impact (validity, fair test, etc) on the performance of a cache simulator. (Hint. Again a small C program that can find a given  address and outputs the line number for each occurrence)

(c) Also, consider the following: if a trace file was to be constructed simply by generating random numbers between 0 and MAX RAM-mem (say 16MB), would this be a better/best way to test:-

a.  Cache simulator,

b.  A possible real program?   {Remember principle of locality as iy applies to real data!!!}

Posted Date: 2/28/2013 2:57:19 AM | Location : United States







Related Discussions:- Requirements for cache simulator, Assignment Help, Ask Question on Requirements for cache simulator, Get Answer, Expert's Help, Requirements for cache simulator Discussions

Write discussion on Requirements for cache simulator
Your posts are moderated
Related Questions
A data structure in which an element is added and detached only from one end, is known as Stack

Write a decision table that specifies the rules for the game of checkers

When should you stop testing? It is quite complex to determine as many modern software applications are so complex and run in like an interdependent environment that complete t

Class Program { static void Main() { int[] MyPrimeNumbers = {1,2,3,5,7}; // Use the Count() and Sum() Standard Query Operators to // compute the count an whole su

Arithmetic Pipeline The complex arithmetic operations like floating point and multiplication operations use a lot of the time of the ALU. These operations can also be pipelined

State the Protected mode interrupt In protected mode, interrupts have exactly same assignments just like in real mode though the interrupt vector table is different.  Instead

Need of CISC CPU -  computer architecture: Why is Intel spending money and time to manufacture the Pentium II and the Pentium III? The answer of this question is simple, ba

write a program to find the area under the curve y=f(x) between x=a and x=b,integrate y=f(x) between the limits a and b

How many select lines will a 16 to 1 multiplexer will have ?   Ans. For 16 to 1 MUX four select lines will be needed to select 16 (2 4 ) inputs.

LoadRunner script code acquired from recording in the ANSI C language syntax, shown by icons in icon view until you click Script View.