5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3, 39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF C. SCAN d. LOOK

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3, 39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF C. SCAN d. LOOK

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: The equivalent resistance Reg of four resistors R₁, R2, R3 and R4 connected in series is given as…

A: Code: ch=input('Enter the type of connection(1 for series and 2 for parallel): ');if(ch==1 || ch==2)…

Q: The history of OSes for computers is summarized here. Usage your preferred operating system to…

A: A computer's operating system (OS) manages and coordinates activities and shares resources. The OS…

Q: Consider the process track request are 98, 183, 37, 122, 14, 124, 14, 124, 65, 67 and the initial…

A: To calculate the total number of seeks for the C-Look algorithm, you can follow these steps:…

Q: Suppose that unfolded boxes are stacked, on top of one another, on a storage rack of height 2m. If…

A: Logic used:- Number of boxes= height/ thickness of Each box

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving…

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: Disk I/O: Consider a magnetic disk with N cylinders rotating at a speed of R revolutions per minute.…

A: Actually, OS is an system software which manages computer hardware and software.

Q: we apply the conditional function on E, F, and G buffers. if the leftmost hexadecimal digits of…

A: Step 1 The answer is given in the below step

Q: a disk drive can complete an average of request in 10 minutes, the time to complete a request is…

A: Service Time Service Time is just the amount of time the system needs to process a request for…

Q: Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

A: Operating systems use a disk scheduling algorithm to schedule I/O requests that arrive at the disk.…

Q: Suppose a processor sends 40 disk I/Os per second, these requests are exponentially distributed, and…

A: Answer is given below

Q: Stopping these operations in a deadlock will result in:

A: A deadlock occurs when two computer programs that share the same resource effectively prohibit each…

Q: The umber of 1's in the binary representation 4096-15 256+5*16+3) is

A: The answer for the number of 1's in binary representation is

Q: code

A: Given:- An assembly code is given in above question Need to run the given code and mention the…

Q: Suppose you are asked to design a rotating disk where the number of bits per track is constant. You…

A: Consider the information given:

Q: Consider a magnetic disk with 1000 cylinders rotating at a speed of 7200 revolutions per minute. The…

A: Given:- Total number of cylinders =1000 Number of Revolutions per minute = 7200 Sector size =1024…

Q: Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By…

A: The program in question uses CPU, disk, and network resources to iteratively go through a series of…

Q: A Magnetic surface has 64 tracks (To to T63), One track has 256 sectors (So to S255). One sector…

Q: head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of…

A: Here in this question we have given a disk with 400 cylinder and we have also given some request to…

Q: A disk drive has 24 cylinders (0-23). Initially, the head points to cylinder 8 (moving towards cy…

A: Here in this question we have given 24 disk cylinder.currently head pointer is at 8.we have to…

Q: operations in a deadlock w

A: Deadlock is a situation that can occur in computer systems when two or more processes are unable to…

Q: s initiall s are n ovemer

Q: a. Prove that count[j] equals the number of times j appears in data[1::i], for every j from 1 up to…

A: In this question we have to

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: The answer is given in the below step

Q: Consider a single-platter disk with the following parameters: rotation speed:7200 rpm; number of…

A: Given data in the question: Rotation speed = 7200 rpm the number of tracks on the one side of the…

Q: D, what quests ne cylin

Q: Consider a single-platter disk with the following parameters: rotation speed:7200 rpm; number of…

A: Given Data : - Rotation Speed = 7200 rpm No. of tracks on one side of platter = 30000 No. of…

Q: Let T (n) be the number of moves in our solution to the n-disc. •move the top n −1 discs from the…

A: This is how you use an intermediate peg to move n discs from the source peg to the destination turn…

Q: Reduce the machine using Ginsburg /Huffmann method .Hint: Tables/input fields that are not required…

A: Here the Mealey machine is given and we need to reduce it using Huffman method. The set of input…

Q: For Heap File with a page directory, assume that a page can contain up to 100 directory entries and…

A: Given Statement: In this question firstly we will find out what is already given in our question.…

Q: Different algorithms are used for scheduling the disk head so that seek time may be reduced.…

A: Shortest Seek Time First : In this disk scheduling algorithm, it starts from the head position to…

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

A: In computer systems with magnetic hard drives, efficient disk scheduling algorithms are crucial to…

Concept explainers

Hash Table

A hash table also called a hash map, is a data structure that maps key-value pairs. The hash table can be used in complex systems to provide fast access and compact storage. A hash table is a structure that stores data in an abstract data type kind of associative array. It keeps data in an array format, with a distinct index value for every data value. If the index of the required data is known, then the data can be accessed very easily.

Question

100%

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request
at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made
with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,
39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what
is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also
calculate the total seek time needed to
these requests, for each of the following disk-sc
ling
algorithms? Explain with the help of a diagram in each case. [2X4]
a. FCFS
b. SSTF
c. SCAN
d. LOOK

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

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 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

In the desert there is a jail. After rebellion the single guard has been immobilized. He watched helplessly how prisoners left one by one with different speed in different directions. Later he free himself and took a motobike with extra seat. Now he can follow footprints and pick up one prisoner at a time and bring them back to jail. Each prisoner moves with constant individual speed v_i and left the jail at time t_i. In which order the guard should bring the prisoners back in order to minimize the time?
The outer track 0 of a hard disk has a diameter of 8cm, the innermost track 36113 has a diameter of 4cm. For simplicity, let's assume that the head is moving at a constant speed of 2m/s. The hard disk rotates at 7200 rpm, the reading time of the sectors is negligible. How long does it take to change lanes from lane 0 to lane 36113? Enter the answer in milliseconds without decimal places.
algorithm is used, which partitions are NOT ( Iく。 OOKB. (O0 K B. SO 0 F.1S 250 K3. where KB re1ers to These partitions eed 1いU to to be allotted Processes of sizes 357 KB. 210 KB. 468 KD and 491 KB in that order. If the best allotted to any process?
Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The queue of pending requests, in FIFO order, is: 2,069; 1,212; 2,296; 2,800; 544; 1,618; 356; 1,523; 4,965; 3,681 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a. FCFS b. SCAN c. C-SCAN d. LOOK e. C-LOOK
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.
9. Learn to compute a shared K session key in the Diffie-Hellman algorithm if easy-to-calculate initial parameters are given.
8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of the disk-scheduling algorithms given below, show (by plotting in the graphs below) the current position of head based on the disk arm movement to satisfy the above requests, and count the total distance (in cylinders) of the disk arm movement. a. First Come First Served (FCFS) 0 40 100 130 150 Total distance (disk arm movement) = b. Shortest Seek Time First (SSTF) 0 40 100 130 150 Total distance (disk arm movement) = c. LOOK - in the direction of increasing track number 0 40 100 130 150 Total distance (disk arm movement) = 280 280 280 350 350 350 399 399 399 d. Based on questions a-c, specify the best algorithm for the given case above. Also explain TWO (2) reasons why the disk scheduling algorithm important in disk management.
Calculate the number of disk tracks traversed using the FCFS 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.
Disk requests are received by a disk drive for cylinder 20, 25, 45, 5, 10, 17, 60, 70, 35, 90. Currently head is at cylinder 50. A seek takes 2 msec per cylinder moved. How much seek time is required for a shortest seek time first algorithm?
thdfhdhfh
Suppose we have four machines that are using the Berkeley algorithm for clock synchronization. The time daemon is running on machine MO. The other machines are named M1, M2, and M3. The time readings on the four machines are as follows wenty-four hour clocks are usedt. MO 09:10 M1: 08:30 M2 10:10 M3: 07:14 In the third step of the algorithm, what are the values that the time daemon sends to each machine? Assume that the time values are expressed in minutes. Below, these values are presented in a vector value sent to MO, value sent to MI, value sent to M2. value sent to M3I none of these O84, 44, 96, 321 O(24, 16, -84, 92) O192. 84, 16. -24 O-32, 76, 40
If you have the following primitive flow table, after the merging step the merging flow table comprises ........... states only. Next State (X1 X2) Outputs Present State 00 01 11 10 Z1 Z2 a @ 6 C O O - 6 a 6 d O O C a e O O - d @ O 1 e 6 1 O 4 5 2 O OLL Ⓒ C C