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

HYRISE, how to implement hyrise in C plus plus

how to implement hyrise in C plus plus

Draw and explain the three level architecture of database, Draw and explain...

Draw and explain the three level architecture of the database system? A DBMS gives three levels of data is said to follow three-level architecture. The trget of the three-schem

Define 1 nf normal form, 1 NF Normal Form The domain of attribute must...

1 NF Normal Form The domain of attribute must add only atomic (simple, indivisible) values First normal form (Minimal Form or 1NF) is a normal form need in database normalizat

Traffic data management, This report identifies and outlines my CIS 499 pro...

This report identifies and outlines my CIS 499 project named Traffic Data Management  Systems (TDMS) .   My goal is to design a replica of all traffic issues to be implemented i

Physical records, Physical Records These are the records that are store...

Physical Records These are the records that are stored in the secondary storage devices. For the database relation, physical records are the group of fields kept in adjacent me

On laod, how to write a in a text and load it on mysql

how to write a in a text and load it on mysql

Describe the iterative and incremental life cycle, Describe the iterative a...

Describe the iterative and incremental life cycle For an iterative and incremental life cycle, two criteria are process and time. The main components of showing a project devel

User error-database errors, User error :  This contains errors in the progr...

User error :  This contains errors in the program (e.g., Logical errors) with errors made by online users of database.  These types of errors can be avoided by applying some check

What is a hash index, What is a hash index? A hash index organizes the ...

What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.

Explain candidate key, Explain Candidate key? Candidate Key - A candi...

Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.

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