That means: take the distance (in cylinders) that you move and multiply it by 6ms. You state that the seek time is 6ms per cylinder. How do you calculate total seek time in disk scheduling?Ģ Answers. The center of the disk is the location having the smallest average distance to all other tracks. Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. Yes, disk scheduling other than FCFS scheduling can be useful in a single-user environment. In SSTF (Shortest Seek Time First), execution of requests having the shortest seek time takes place first.Īlso, is disk scheduling other than FCFS scheduling? In FCFS, the requests are addressed in the sequence they come in the disk queue. Subsequently, question is, which disk scheduling algorithm is best? Various Disk Scheduling Algorithms | Operating System Then the direction of the head is reversed and the process continues as head continuously scan back and forth to access the disk. In SCAN disk scheduling algorithm, head starts from one end of the disk and moves towards the other end, servicing requests in between one by one and reach the other end. Beside this, what is Scan Disk scheduling?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |