Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

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

I need the answer as soon as possible
Consider a swapping system in which memory consists of the following hole sizes in memory order: 10 MB, 4 MB, 20 MB, 18 MB, 7 MB, 9 MB, 12 MB and 15 MB. Which hole is taken for successive segment requests of (i) 12 MB (ii) 10 MB (iii) 9 MB for first fit? Now repeat the question for best fit and worse fit.
Different algorithms are used for scheduling the disk head so that seek time may be reduced. Calculate a total number of heads movement for the following algorithms for the given numbers of disk cylinders. Shortest Seek Time First (SSTF) b) Circular Look (C-Look) Head Start: 71 Queue: 82 , 153 , 14 , 149 , 6 , 189 , 62 , 99 , 121
Suppose that we want to schedule disk requests on a disk containing 200 cylinders numbered from 0 to 199. The Disk requests to be addressed are 82,170,43,140,24,16,189. And the Read/Write arm is at 48, and it is also given that the disk arm should move "towards the larger value". Q₁- Illustrate on a graph the total read/write head movement for the SCAN Disk scheduling algorithm. Q2- Calculate the total overhead movement (total distance covered by the disk arm).
Disk requests come to disk driver for cylinders 10, 153, 34, 90, 120, 205, 319, 256 and 400 in that order at a time when the disk drive is reading from cylinder 99. The cylinders are numbered from 0 to 499. Compute the total head movement incurred while servicing these requests if the disk arm scheduling algorithm is first-come-first-serve.
Consider a disk subjected to I/O requests arriving (following Poisson distribution) at an average rate of requests/second. Assume that on average, there were 5 requests waiting for service in the queue and that each request waits in the queue for about 10 milliseconds, on average. What is the effective arrival rate for this disk?
I need the answer as soon as possible
There are memory partitions in order of 150 KB, 500 KB, 400 KB, 800 KB and 900 KB. Use first fit, best fit, worst fit and next fit algorithms to allocate processes of parameters 90 KB, 417 KB, 212 KB, and 820 KB. Show the pictorial representation
The Answer to the given question is provided at the end of the question. I need you to show the full solution to get the given answer. Show all steps where necessary. During TLB search, the associative lookup time (ε) is 3ns and hit ratio (α) is 70%. For each time memory access, 80ns is needed. Calculate the effective access time. Answer: 106.1ns
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?