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

Explain the form of the create view command, We define a view in SQL throug...

We define a view in SQL through using the create view command. To describe a view, we must provide the view a name and must state the query in which computers the view. The form of

Candidate keys, Super keys of a relation can have extra attributes. Candida...

Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even

State the process of rearranging classes and operations, State the process ...

State the process of Rearranging Classes and Operations The various, yet similar operation of different classes can be slightly modified thus that they can be covered by a sin

What are audit trails, What are audit trails? An audit trail is a log o...

What are audit trails? An audit trail is a log of all alters to the database along with information like which user performed the change and when the alter was performed.

Define page, Define page. The database is partitioned into some number ...

Define page. The database is partitioned into some number of fixed-length blocks, which are referred to as pages.

Define the term- having clause and a where clause, What is the difference ...

What is the difference between a HAVING CLAUSE and a WHERE CLAUSE? HAVING CLAUSE - HAVING CLAUSE is used only with SELECT statement. - It is normally used in a GROUP BY

Explain the term - adjustment of inheritance, Explain the term - Adjustment...

Explain the term - Adjustment of inheritance The inheritance can be enlarged as object design progresses by changing class structure. The designer should do: i) Adjust or r

Entity-relationship diagram, 1. Item based services will be charged fixed p...

1. Item based services will be charged fixed prices, and time-based will be charged variably depending on time. Such as per hour. Item-based: Fixed, pedicure, waxing, threading, fa

What is called as recursive partitioning, What is called as recursive parti...

What is called as recursive partitioning? The system repeats the splitting of the input unless each partition of the build input fits in the memory. Such partitioning is known

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