<P> One variation of this method ensures all requests are serviced in only one direction , that is , once the head has arrived at the outer edge of the disk , it returns to the beginning and services the new requests in this one direction only ( or vice versa ) . This is known as the `` Circular Elevator Algorithm '' or C - SCAN . Although the time of the return seek is wasted , this results in more equal performance for all head positions , as the expected distance from the head is always half the maximum distance , unlike in the standard elevator algorithm where cylinders in the middle will be serviced as much as twice as often as the innermost or outermost cylinders . </P>
<P> One variation of this method ensures all requests are serviced in only one direction , that is , once the head has arrived at the outer edge of the disk , it returns to the beginning and services the new requests in this one direction only ( or vice versa ) . This is known as the `` Circular Elevator Algorithm '' or C - SCAN . Although the time of the return seek is wasted , this results in more equal performance for all head positions , as the expected distance from the head is always half the maximum distance , unlike in the standard elevator algorithm where cylinders in the middle will be serviced as much as twice as often as the innermost or outermost cylinders . </P>
4 . what does c stand for in case of disk scheduling algorithms
4 . what does c stand for in case of disk scheduling algorithms
Circular Elevator Algorithm
Circular Elevator Algorithm