Question: For a database application, assume it takes 10 ms to read a block from disk, 1 ms to search for a record in a block

For a database application, assume it takes 10 ms to read a block from disk, 1 ms to search for a record in a block stored in memory, and that there is room in memory for a buffer pool of 5 blocks. Requests come in for records, with the request specifying which block contains the record. If a block is accessed, there is a 10% probability for each of the next ten requests that the request will be to the same block. What will be the expected performance improvement for each of the following modifications to the system?

(a) Get a CPU that is twice as fast.

(b) Get a disk drive that is twice as fast.

(c) Get enough memory to double the buffer pool size.

Write a simulation to analyze this problem.

Step by Step Solution

★★★★★

3.54 Rating (157 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

To analyze the expected performance improvement for each modification we can simulate the system and compare the results Below is a Python simulation ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Practical Introduction To Data Structures Questions!

Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...

Managing Scope Changes Case Study Scope changes on a project can occur regardless of how well the project is planned or executed. Scope changes can be the result of something that was omitted during...

This case was written by Professor Michele Greenwald, Visiting Professor of Marketing at HEC Paris, for use with Advertising and Promotion: An Integrated Marketing Communications Perspective 7th...

Lesson 12 Quiz (Show/Explain all Work) IST 230 Relations on Sets, Databases 1. Let A = {0, 1, 2, 3, 4, 5, 6, 7, 8} and B = {1, 2, 3, 4, 5, 6, 7, 8}. Now let R be a binary relation R from A to B such...

Database Administration CHAPTER OBJECTIVES I Understand the need for and importance of database I ttno'illI the meaning of ACID transaction administralin - Learn the tour 1992 ANSI standard isolation...

A creative engineer suggests structuring the TLB so that not all the bits of the presented address need match to result in a hit. Suggest how this might be achieved, and what might be the costs and...

ttth Suppose that the sequence of bags {Bn | n N} is recursively enumerated by the computable function e(n, x) = fn(x), [7 marks] Hence prove that the set of all recursive bags cannot be recursively...

A Slower File System This project must be implemented in C Objectives There are two objectives to this assignment: To understand how file systems work, specifically the directory hierarchy and...

Objectives There are two objectives to this assignment: To understand how file systems work, specifically the directory hierarchy and storage management. To understand some of the performance issues...

A rock is thrown vertically upward with initial speed vo. Assume a friction force proportional to -v, where u is the velocity of the rock, and neglect the buoyant force exerted by air. Which of the...

An air parcel starting at the surface (0 km) is lifted up a 3 km high mountain over to the surface (0 km) on the other side. The initial temperature is 20C and initially e is 6 mb. How does the...

From a virtue - ethics perspective, why did Eric Butler release Firesheep? To highlight privacy issues with unsecured networks To gain financial profit from selling Firesheep To promote identity...

6 How can the response rates of postal surveys be improved?

What is the sum of all the even numbers from 0 to 2n, for any integer n 1?

Show that the following two statements are equivalent: (a) The running time of algorithm A is always O(f (n)). (b) In the worst case, the running time of algorithm A is O(f (n)).

Order the following functions by asymptotic growth rate.

Which one shows the agency cost based on agency theory? 1.lower earnings figure 2.decrease in stock price 3.Overinvestment of the firm's cash by managers 4.Audit failure by external auditor

Assume a company has two divisions, Division A and Division B. Division A has provided the following information regarding the one product that it manufactures and sells on the outside market:...

Refer to the case and your cost estimate in Module 13, assignment 1. Prepare a budget justification using the format of Box 14.1. Can someone please solved the problem for Module 14 This is an...