cache is negligible. Available cache sis enThe smallest cache size required to ensmaverage read latency of less than 6 msin multiples of 10 MB.80706050302010o 10 20 30 40 30 0Cache s MB)The smallest cache size required la cms isMB. 17. A file system uses an in-memory cache tocache disk blocks. The miss rate of the cacheis shown in the figure. The latency to read ablock from the cache is 1 ms and to read ablock from the disk is 10 ms. Assume that thecost of checking whether a block exists in the

Answered: Image /qna-images/answer/92db0538-c23a-4721-a9ca-76660f0b12ac.jpg

7 A file system uses an in-memory cache to cache disk blocks The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. Assume that the cost of checking whether a block exists in the

7 A file system uses an in-memory cache to cache disk blocks The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. Assume that the cost of checking whether a block exists in the

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: We have a magnetic hard drive. The arm is at cylinder 25. Disk requests come in to the disk driver…

A: I have Answered all the 3 parts. I have given order then we will use it to see how much seek time is…

Q: n a 16 GB hard disk drive (HDD), each cluster consists of 32 sectors and each sector has a fixed…

A: To calculate the size of the slack space, we first need to determine how many clusters the file will…

Q: A cache hit is when the desired data is already located in the cache RAM. O True False

A: There is a significant gap between processor speed and cache speed. to reduce this gap Cache Memory…

Q: The disk has 200 tracks numbered from 0-199. The head pointer is currently positioned at 112 moving…

A: Here in this question we have given some disk request and we have asked to find total head movement…

Q: What is the biggest size we can have for a file with SFS? (b)Provide data block numbers in sequence…

A: SFS ( Answering only for the first part) The Smart File System (SFS) is a journaling filesystem…

Q: Question#4: Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in…

A: answer is

Q: Memory and Blocks When you access memory, you pull K bytes (i.e., the block size) into the cache.…

A: Option e. 0xa2 corresponds to the 10th byte. Option f. 0xc4 corresponds to the 11th byte.

Q: (c) Consider a cache with 3 slots and the following stream of requests: A,B,C,B,C,D,C,A,D,B Assume…

A: Answer: We need write the how the Least Recently Used Algorithms works. So we will see in the more…

Q: When a request's size is more than the capacity of the cache, the central processing unit moves the…

A: When the size of a request exceeds the cache's capacity, the data must be moved to main memory,…

Q: To access data in a hard disk, it requires the time to move the head to A. TASK: the desired track…

A: Data :- 5400 RPM 3 ms avg. Seek time 100 MB/ s transfer rate = 100000 kb/s 0.2 ms controller…

Q: A word-addressable RAM unit has 16 address bits. How many bytes is the RAM unit able to store? Note:…

A: RAM unit has 16 address bits so the memory address space is 216. Total addressable memory space is…

Concept explainers

Types of database architectures

A Database Architecture represents the Database Management System’s (DBMS) design (schema). The DBMS architecture makes it easy to understand the components involved in the database system and their relations. The DBMS architecture may vary based on the system on which it runs. Some systems contain both client and server machines whereas some run only on a server machine. Based on the architecture, the system can be classified as centralized, decentralized, or hierarchical.

Question

cache is negligible. Available cache sis en
The smallest cache size required to ensm
average read latency of less than 6 ms
in multiples of 10 MB.
80
70
60
50
30
20
10
o 10 20 30 40 30 0
Cache s MB)
The smallest cache size required la c
ms is
MB.

17. A file system uses an in-memory cache to
cache disk blocks. The miss rate of the cache
is shown in the figure. The latency to read a
block from the cache is 1 ms and to read a
block from the disk is 10 ms. Assume that the
cost of checking whether a block exists in the

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Buffers are used to cut down on the time it takes to access different levels of the memory hierarchy. List any possible buffers between the L1 and L2 caches, as well as between the L2 cache and the RAM, for the given configuration.
Disk Scheduling Problem: The disk has 200 tracks numbered from 0-199. The head pointer is currently positioned at 112 moving towards track 199. Given the following work queue: 100, 23, 89, 132, 42, and 187, schedule the requests using FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK by determining the total head movements for each.
Assume that disk reads are managed using a buffer pool. The buffer pool contains five buffers and each buffer stores one block of data. Disk accesses are by block ID. Assume the following series of disk accesses takes place: Using the First-in, first-out (FIFO) buffer pool replacement strategy and the table below, show the contents of the buffer pool at the end of the series of inputs (you only need to show the contents of the very last column in the table below). Assume that the buffer pool is initially empty.
List the two main principles used in the design of memory hierarchies and explain them briefly. Briefly describe the read algorithm for reading data from a cache.
There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you divide tracks into half as many blocks, then you double the read time for a block.…
Computer Architecture (5) A computer system has an MM consisting of 8 M Blocks. It also has a 2 K Blocks cache.The block size is eight words.Determine the number of bits in each field of the address in each of the following mapping organizations: -Direct mapping: -Associative mapping: -Set-associative mapping with a set size of eight blocks:
There are many parameters that could be used to describe disk performance; among them are: number of bits per track disk capacity (in bits) number of disk surfaces rotational speed rotational latency transfer rate tracks per surface sectors per track blocks per track sectors per block seek time speed of disk arm block-read time number of blocks Some of these parameters are independent, and others are (approximately) linearly related. That is, doubling one doubles the other. Decide which of these parameters are linearly related. Then, select from the list below, the relationship that is true, to within a close approximation. Note: none of the statements may be true exactly, but one will always be much closer to the truth than the other three. Also note: you should assume all dimensions and parameters of the disk are unchanged except for the ones mentioned. a) If you double the number of sectors per block, then you double the number of blocks on the disk. b)…
Operating Systems Problem Two (15 points) Paged page table A paged virtual memory has the following characteristics: The virtual address size is 32 bits. The page size is 1024 words. Each word is 1 integer. Each page table entry needs 4 integers. a) Determine the size of the page table, PT. b) The PT is too large and must be divided into a hierarchy of pages of size 1024 integers. Determine the number of levels in the hierarchy such that no PT exceeds the page size. c) Determine the size of the highest level PT in the hierarchy