Skip to content

Scilab Code solution to Problem 10.11 of Abraham Silberschatz - Operating System Concepts (Book)

License

Notifications You must be signed in to change notification settings

nikita9604/Distance-by-Disk-Scheduling-Algorithms

Repository files navigation

Distance (in cylinders) for Disk Scheduling Algorithms using Scilab

This is the Scilab Code solution to Problem 10.11, Chapter 10 - Mass Storage Structure, Operating System Concepts (Book) by Abraham Silberschatz.

Problem 10.11:

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, 3681

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?

  1. FCFS
  2. SSTF
  3. SCAN
  4. LOOK
  5. C-SCAN
  6. C-LOOK

Solution:

Steps of Code Execution:

  1. Clone / Download this repository
  2. Open Scilab and Run the main file - Ex_10_11.sce

About

Scilab Code solution to Problem 10.11 of Abraham Silberschatz - Operating System Concepts (Book)

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages