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

Define cascading rollback, Define Cascading rollback The phenomenon whe...

Define Cascading rollback The phenomenon where a single transaction failure leads to a series of transaction rollbacks is known as Cascading rollback.

Whenever the limit clause will be used, Whenever the LIMIT clause will be u...

Whenever the LIMIT clause will be used? LIMIT is used for the following kinds of problems: 1) Answering questions about first or last and largest or smallest 2) Splitting

What is system r, What is System R? What are its two major subsystems? ...

What is System R? What are its two major subsystems? System R was intended and developed over a period of 1974-79 at IBM San Jose Research Center. It is a prototype and its pur

Define the immediate update, Define the Immediate Update The immediate...

Define the Immediate Update The immediate update methods may apply changes to the database on disk before the transaction arrives a successful conclusion. Though, these change

Describe logical data independence, Describe logical data independence ? ...

Describe logical data independence ? Logical Data Independence - It is the capacity to modify the conceptual schema without having to change external schemas or application p

Transactions t1 and t2 are in a deadlock, Evaluate: a.When transactions...

Evaluate: a.When transactions T1 and T2 are in a deadlock, one of the transactions will eventually implement to completion and let the other one continue implementation. b.

Explain clustering file organization, Explain Clustering file organization ...

Explain Clustering file organization (i) Determine if a record of file is physically ordered on a nonkey field - that does not comprise a different value for each record - that

Define shared locks, Define Shared locks? Ans: Shared lock: Throughout ...

Define Shared locks? Ans: Shared lock: Throughout concurrent execution of transactions, earlier than a transaction can access a data item, it has to obtain a lock on it. Now he

Which language has recently become the defacto standard, Which language has...

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

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