Implement a cache simulator, Database Management System

You are required to program (in a high level language such as C, C++, Java) and implement a cache simulator which will have the following inputs and outputs:-

INPUTS OUTPUTS

2293_Implement a cache simulator.png

Memory trace <=> smalltex.din (during code development microtex.din - see later) and each address is the current address, in RAM, of a Byte required by the CPU.

Cache size <=> size of cache in bytes

Block size <=> size of blocks in bytes

Degree of associativity <=> direct (1-way), 2-way, 4-way, 8-way, and fully associative

Replacement policy <=> Random and LRU are to be implemented.

Total miss rate = compulsory + capacity + conflict miss rates.

* The memory trace file (smalltex.din) is located at
/home/csiii/csiiilib/arc/smalltex.din or
/home/3rd/csiiilib/arc/smalltex.din
Copy this file to your arc directory where you will be running your assignment from.

Posted Date: 3/14/2013 1:45:40 AM | Location : United States







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

Write discussion on Implement a cache simulator
Your posts are moderated
Related Questions
Data Handling and Research Methods: The dataset encompassing 130 participants contains several variables measuring detrimental health related behaviours referring to the use o

Although how will the system recover The selection of REDO or UNDO for a transaction for the recovery is completed on the basis of the state of the transactions. This state is


Explain the disadvantages of file oriented approach? In the oriented approach Applications are designed in isolation. Design of application is optimized for one application. In


Hashed File Organisation Hashing is the most common form of purely random access to a database or file. It is also used to access columns that do not have an index as an optimi

In this assignment, you will create a program that works with multiple tables. In this assignment, you will work with the factory and sales tables. 1. Create a new project nam

Compare the Nested-loop join and block-nested loop join Ans: Nested  loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r   where b

Define average latency time. The average latency time of the disk is one-half the time for a full rotation of the disk.

Enumerate or state the steps in creating a relevant database of a shop.