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

Differentiate between logical database design and physical, Differentiate b...

Differentiate between logical database design and physical database design. Show how this separation leads to data independence? Basis Logical Databas

Database, real life situations where database management system are most su...

real life situations where database management system are most suitable

Explain cnt in the respects of qbe, Explain CNT in the respects of QBE ? ...

Explain CNT in the respects of QBE ? CNT: It is one of the aggregation commands given in QBE. It is used to identify number of tuples

State the functional approach of object oriented methods, State the functio...

State the functional approach of object oriented methods Moving from a functional approach to an object oriented one needs a translation of functional model elements into objec

What is nested relational model, What is nested relational model? The n...

What is nested relational model? The nested relational model is an extension of relational model in which domains might be either atomic or relation valued.

Hashing, how to implement mid square hashing?

how to implement mid square hashing?

Define partial key and primary key, Define Partial Key and Primary Key ...

Define Partial Key and Primary Key A partial key, also known as discriminator, is the set of attributes which can uniquely identify weak entities that are related to similar o

What is meant by functional dependencies, What is meant by functional depen...

What is meant by functional dependencies? Consider a relation schema R and α C R and β C R. The functional dependency α ->β  holds on relational schema R if in any legal relati

Describe the candidate key functions, Describe the candidate key functions ...

Describe the candidate key functions ? Candidate Key and Alternate Key: In some instances, an entity will have more than one attribute which can serve as a primary key. Any key

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