Requirements for your cache simulator, Database Management System

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)

Posted Date: 3/14/2013 1:47:21 AM | Location : United States







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

Write discussion on Requirements for your cache simulator
Your posts are moderated
Related Questions
What is a Linked Server? Linked Servers is a method in SQL Server by which we can add other SQL Server to a Group and query both the SQL Server dbs using T-SQL Statements. With

Question: The following relational database schema corresponds to a part of a database used by the Registry Department of a university. DEPARTMENT (d#, d-name, head-of-dept)

Which language has presently become the defacto standard for interfacing application programs along with relational database system? The language which has recently become the

Developer is required to do a task including: - Database Normalization - Database Analysis - ERM Diagram Details can be provided and then you can change your bid accord

Write short notes on domain relational calculus   The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole


Data independence seems that "the application is independent of the access strategy and storage structure of data". In other words, the ability to change the schema definition in o

What are the reasons for having variable length records? What are the various ways to store variable length records? Variable-length records arise in a database in various wa

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

With the linear commit protocol, sites are connected in a chain, and the subtransaction at the left-hand end of the chain initiates the protocol. Propose a crash recovery protocol