Implement a cache simulator, Database Management System

Assignment Help:

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.


Related Discussions:- Implement a cache simulator

What is a select operation, What is a SELECT operation? The select oper...

What is a SELECT operation? The select operation selects tuples that please a given predicate. We use the lowercase letter σ to denote selection.

Explain concurrency problems, Question: a) There are three concurrency...

Question: a) There are three concurrency problems, i.e. three types of potential mistake which could occur if concurrency control is not properly enforced in the database syst

State the definition of association, State the definition of association ...

State the definition of association An association is a structural relationship which specifies that objects of one thing are connected with objects of another. In UML, asso

Order by clause-data manipulation language, Order by clause By usin...

Order by clause By using this rows can be sorted It is used in the last portion of select statement By default it gets ascending order DESC: is used

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

Dirty reads-problems of concurrent transactions, Dirty Reads: T10 reads a ...

Dirty Reads: T10 reads a value which is updated by T9. This update has not been committed and T9 aborts. T9 T10 Value of x old value = 200

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