9. Explain the SCAN disk scheduling algorithm. Explain why it is sometimes called the Elevator Algorithm.
SCAN Disk Scheduling Algorithm:-
The disk arm moves into a specific direction till the end, processing all the requests coming in its path,and if it reaches the end in one direction then it turns back and moves in the reverse direction processing the requests coming in its path.
Example:-
2 Example:-
Advantages:-
It is easy to understand and implement.
It does not lead into starvation.
Disadvantages:-
It causes the head to move upto the end of the disk even if there are no requests to be processed.
WHY SCAN ALGORITHM IS CALLED ELEVATOR ALGORITHM:-
It is similar to the work of the elevator like the elavator moves in any one of the direction and process the people in that way.
9. Explain the SCAN disk scheduling algorithm. Explain why it is sometimes called the Elevator Algorithm.
Write a java program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN Your program will service a disk with 5000 cylinders numbered 0 to 4999. The program will generate a random series of 1,000 cylinder requests and service them according to each of nth algorithms listed above. The program will be passed the initial position of the disk head and report the total amount of head movement required by the algorithm.
Write a program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN Your program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement and total number of change of direction required by each algorithm under each of the following cases: a)The program will generate a random...
<Operating System> 1. Which scheduling objectives from module(CPU Scheduling) would also apply to disk scheduling? 2. Which disk scheduling algorithm is the most suitable for solid-state drives? Why?
Use any language Task two Write a program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN e.LOOK f. C-LOOK Your program will service a disk with 500 cylinders numbered 0 to 499. The program will generate a random series of 20 cylinder requests and service them according to each of the algorithms listed above. The proram will be passed the initial position of the disk head (as a parameter on the command line) and...
I/O Scheduling Algorithms a) For each of the following scheduling algorithms, give a 1-2 sentence description of how it works. The description should be precise enough to distinguish each algorithm from the others. Algorithms: FCFS, SSTF, SCAN, C-SCAN, C-LOOK. (1 point) b) Given a hard disk with 200 cylinders and a queue with jobs having the following cylinder requests: 80, 190, 70, 130, 30, draw a diagram of the movements of the head for each of the algorithms listed in...
Buffers are sometimes called “chemical sponges”. Explain why? Explain why some solutions have buffering capacity and others do not. The lungs and kidneys contribute to pH regulation. Why do you think these are important, when buffer systems minimize pH fluctuations in body fluids?
Explain why the blood is sometimes called the second line of defense against infection. Include the various blood components and how they perform this function.
Briefly explain how the Shortest Remaining Time scheduling algorithm differs from Shortest Job Next.
Explain the reticulocyte production index and why it is why it is sometimes necessary to use rather than the raw retic count.
14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard. 14. (10 points) Using a binary search tree algorithm, draw and explain the tree that describes the following sentence. Discrete math is fun but sometimes hard.