Requirements for cache simulator, Computer Engineering

Assignment Help:

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!!!}


Related Discussions:- Requirements for cache simulator

Assembly Language program, How to get an output: Please enter a number betw...

How to get an output: Please enter a number between 0 and 6 (Enter to stop): 2 The Day of Week is Tuesday Please enter a number between 0 and 6 (Enter to stop): 9 Input Invalid Ple

Define the uniform memory access model (uma), Normal 0 false ...

Normal 0 false false false EN-US X-NONE X-NONE

Explain services of application layer., Explain services of Application Lay...

Explain services of Application Layer. Application Layer: As the highest layer within the OSI reference model, the application layer gives services to the users of OSI env

Embedded systems and the system in which rtos is running, Explain What is t...

Explain What is the difference among embedded systems and the system in which RTOS is running? Ans) Embedded system can have RTOS and cannot have also. It depends on the requi

What is non-repudiation, What is non-repudiation? Non Repudiation: Assu...

What is non-repudiation? Non Repudiation: Assurance that the sender is given with proof of delivery and that the recipient is provided with proof of the sender's identity so th

Prove the equations using the boolean algebraic theorems, Prove the equatio...

Prove the equations A + A‾ .B + A.B‾ = A + B using the Boolean algebraic theorems ? Ans. The equation is A + A‾.B + A.B‾ = A + B L.H.S. = A + A‾ .B + A.B‾ = (A + A.B‾) + A‾.B

What is an "on request field" statement, What is an "on request Field" stat...

What is an "on request Field" statement? ON REQUEST The ABAP/4 Module is known as only if the user has entered the value in the field value as the last screen display .Th

Why generalization is very strong, Even while Generalization satisfies Stru...

Even while Generalization satisfies Structural, Interface, Behaviour properties. It is mathematically very strong, as it is Antisymmetric and Transitive. Antisymmetric: employe

Program which take input two images by homography, The goal of this questio...

The goal of this question is to create a program that takes as input two images that are related by a homography, and which "warps" the second image (piscine2.bmp) to align with th

Interfacing subroutines with parameter passing, Interfacing Subroutines wit...

Interfacing Subroutines with Parameter Passing Let's now write a C program which calls the assembly program for parameter passing. Let's extend the previous two programs such t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd