Estimate the transaction states, Database Management System

Suppose an instruction takes 1 nanosecond to execute (on average), a page fault takes 20 microseconds of processor time, and it takes 300 microseconds of disk time to read or write a single page. Suppose that on average, 1/2 of the pages are modified. What is the average number of instructions between page faults that would cause the disk to be busy doing page transfers all the time?

 

Posted Date: 3/18/2013 6:16:07 AM | Location : United States







Related Discussions:- Estimate the transaction states, Assignment Help, Ask Question on Estimate the transaction states, Get Answer, Expert's Help, Estimate the transaction states Discussions

Write discussion on Estimate the transaction states
Your posts are moderated
Related Questions
Describe Parameteric end users? Parametric end users might be given update access, but are commonly not permitted to change the structure of data.

Give the Introduction of OBJECT DESIGN Strategies which are selected during system design are carried out in object-oriented design. In this procedure, objects which are identi

Project Description: I would like to get a database of a website which has clients email name and phone number. If you are able to get information from a website, by entering

How many types of Views are there? There are Four types of views:- Database View Help View Projection View Maintenance View

average response time?

Why does a DBMS query language is designed? A DBMS query language is designed to support end users who use English-like commands. support in the development of complex applicat

Which data type can store unstructured data? Raw data type can store unstructured data.

What is authorization graph? Passing of authorization from single user to another can be shown by an authorization graph.

A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded where poss

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th