Suppose the read/write head of a disk is sitting at track 8. Requests to accessthe following tracks have arrived: 3, 6, 4, 7, 10. Assuming the Shortest SeekTime First (SSTF) scheduling algorithm is used, determine the order thatrequests are serviced.3, 6, 4, 7, 1010, 7, 6, 4, 310, 3, 4, 6, 77, 6, 4, 3, 10

Here in this question we have given 8 request to be serviced. Currently head pointer is at 8.using…

uppose the read/write head of a disk is sitting at track 8. Requests to access he following tracks have arrived: 3, 6, 4, 7, 10. Assuming the Shortest Seek ime First (SSTF) scheduling algorithm is used, determine the order that equests are serviced. O 3, 6, 4, 7, 10 10, 7, 6, 4, 3 O 10, 3, 4, 6, 7 O 7, 6, 4, 3, 10

uppose the read/write head of a disk is sitting at track 8. Requests to access he following tracks have arrived: 3, 6, 4, 7, 10. Assuming the Shortest Seek ime First (SSTF) scheduling algorithm is used, determine the order that equests are serviced. O 3, 6, 4, 7, 10 10, 7, 6, 4, 3 O 10, 3, 4, 6, 7 O 7, 6, 4, 3, 10

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

Which fields inside an entry in a log file will be made available to be processed by the log processing function that has been specified? The following piece of code causes an average of how many cache misses per entry, assuming that cache blocks are 64 bytes in size and that no prefetching is performed.
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.
A post calculation strategy for a factory indicates a disk with 200 blocks. Assuming, that the file control block contains the information given below. Perform an allocation for the specified files using contagious, linked and indexed allocation methods. (Note: Assume the end block, Index block wherever required)
A company has a calculation strategy where the number of file systems needed indicates a disk with 1000 blocks. There are in total five files. Assume the end block, index block wherever required. Also, considering that the file control block contains the information in the order of Using contiguous, linked and indexed allocation methods compute the allocated files.
Suppose following sequence of disk track requests: 27, 129, 110, 186, 147, 41,10, 64, 120. Assume the disk head is initially positioned over track 100 and is moving in the direction of decreasing track number.a. Compare the disk scheduling algorithms with respect to the next accessed track and number of traversed tracks for FIFO, SSTF, SCAN and C-SCAN.b. What is the average seek length time for each of the algorithms? PLEASE DO FOR FIFO, SSTF, SCAN and C-SCAN. NOT FOR C-LOOK. The previous answer you gave me was for C-LOOK. Thanks.
Using the following Disk Scheduling algorithm, calculate the total number of head movements to serve the working queue given below: a)First come, first serve (FCFC)b)Shortest seek time first (SSTF)c)SCAN Work Queue: 22, 88, 131, 41, 189.There are 200 cylinders numbered from 0 - 199.The disk head stars at number 100.
Please give me correct solution.
Hand written solution plz
Suppose that the head of a disk drive is currently at track 9, that the disk has 32 tracks per surface, and the disk-queue contains the following sequence of access requests: Request 1 2 3 4 5 67 8 Track 18 22 14 26 10 30 7 5 For each of the following disk scheduling algorithms, find the total distance (in tracks) that the disk head moves. Please make your answer boldface. FCFS: A- I U X2 x2 G 曲 !