Given the following disk access schedule in terms of the cylinder number compute the seek-distance by using SSTF (shortest seek-time first), and the C-SCAN algorithms. Assume that there are 100 cylinders in total; the current position of the head is 80; the current head movement is downwards (higher to lower cylinder number) Access String: 65, 78, 50, 15, 65, 95, 20, 85

Given the following disk access schedule in terms of the cylinder number compute the seek-distance by using SSTF (shortest seek-time first), and the C-SCAN algorithms. Assume that there are 100 cylinders in total; the current position of the head is 80; the current head movement is downwards (higher to lower cylinder number) Access String: 65, 78, 50, 15, 65, 95, 20, 85

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

Similar questions

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to non-uniform distribution of requests arm starting and stopping inertia higher capacity of tracks on the periphery of the platter use of unfair arm scheduling policies
Consider the Blocks (0-3) from top level of Disks (0-3) in RAID 4 architectureas follows:Block-0: 0011, Block-1:1001, Block-2: 1100, Block-3:0101 Compute the parity strip Parity (0-3) from the given blocks. If Block-2lost from Disk-2, how we can recover it using the Parity (0-3)?
Q. 1 How long does it take to load a 64-KB program from a disk whose average seek time is 5 msec, whose rotation time is 5 msec, and whose tracks hold 1 MB(a) for a 2-KB page size?(b) for a 4-KB page size?The pages are spread randomly around the disk and the number of cylinders is so large that the chance of two pages being on the same cylinder is negligible.
Suppose we have a disk with an average seek time of 10ms, average rotational delay of 5ms, anda transfer time of 1ms for a 4K page. Assume that the cost of reading/writing a page is the sumof those values (i.e., 16ms) unless a sequence of pages is read/written. In this case, the cost is theaverage seek time plus the average rotational delay (to find the first page) plus 1ms per page (totransfer data). You are given 320 buffer pages and asked to sort a file with 10^7 pages. Make theassumptions used in Section 13.3 of the textbook. Find the cost of the following operations:A) Do 319-way merges on 319 input buffers of 1 page each, and 1 output buffer page.B) Do 256-way merges on 256 input buffers of 1 page each, and output buffer of 64 pages.C) Do 16-way merges on 16 input buffers of 16 pages each, and output buffer of 64 pages.
#There is sequence of disk track requests:75 62 99 144 50 162 110 26 198. #Assume that the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number. Question: For FIFO/SSTF/SCAN/C-SCAN 1.What is the tracking order? 2What is Average Track Length?
It is given that on a system, on average, an instruction executes in 1 nano second. Suppose that it takes 20 micro seconds of processor time for page fault. While, it takes 300 micro seconds of disk time for reading and writing a single page. Suppose that on average 1/3 of the pages that need to be paged out 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?
Calculate the number of disk tracks traversed using the SSTF algorithms for the series of disk track service requests given as 54,36,21,74,46,35,26,67. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered)tracks. Draw the graph of the movement. Assume that the disk has 100 tracks from 0 to 99.
Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the rotational latency? c. What is the transfer time for a sector? d. What is the total average time to satisfy a request?
Consider a disk queue with requests for I/O to blocks on Cylinders: 98 183 37 122 14 124 65 67 Consider SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk is initially 53. Select one: a.245 b.240 c.236 d.224
Hi, please solve it correctly ,else i will downvote Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in right direction. Find the number of head movements in cylinders using FCFS scheduling. Subject code - rcs509
Defintion of rotational lag and disk bandwidth is necessary.
Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the read write head is initially at track 53, what is the total distance that the disk are moves to satisfy all the pending request for C-SCAN?