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

Relationship cardinality, Cardinality shows the number of instances of an e...

Cardinality shows the number of instances of an entity associated with another entity participating in a relationship. Depend on the cardinality binary relationship can be further

Ldb hierarchy there should exist one get statement, It is mandatory that fo...

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

Illustrate the fifth normal form, Fifth Normal Form (5NF) These relatio...

Fifth Normal Form (5NF) These relations still have a difficulty. While defining the 4NF we mentioned that all the attributes depend upon each other. Whereas creating the two ta

What is an index as defined in oracle, Normal 0 false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

List and describe the different types of indexes, Question 1 Indexes are o...

Question 1 Indexes are ocasionally defines on a single field of a file called an indexing field. List and describe the different types of indexes Question 2 Consider a book i

Create a data flow diagram, For your chosen project, you need to identify t...

For your chosen project, you need to identify the current problem that you wish your project to solve.  Produce a Problem Statement.  The Problem Statement should explain the purpo

What is recursive closure and operation relational algebra, What is recursi...

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

Define seek time, Define seek time. The time for repositioning the arm ...

Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.

Differentiate between a unique key and a primary key, Differentiate between...

Differentiate between a unique key and a primary key. - By default, clustered index on column are created by primary key while nonclustered index are created by unique key.

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

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