Se está descargando tu SlideShare. ×

# disk scheduling algorithms.pptx

Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Anuncio
Próximo SlideShare
Disk scheduling
Cargando en…3
×

1 de 8 Anuncio

# disk scheduling algorithms.pptx

disk scheduling algorithms

disk scheduling algorithms

Anuncio
Anuncio

Anuncio

### disk scheduling algorithms.pptx

1. 1. DISKSCHEDULINGALGORITHM 2023EV083 ASSIGNMENT SERIES - 71
2. 2. DISKSCHEDULING • As we realize that on a solitary PC we can Perform Numerous Tasks all at once so the executives are likewise fundamental on every one of the Running Cycles that are running on the framework at a time. • With the assistance or Coming of the Multiprogramming we can Execute Many Projects all at once. • So for Controlling and giving the Memory to every one of the Cycles Working Framework utilizes the Idea of Plate Booking.
3. 3. TYPESOF DISKSCHEDULING
4. 4. FCFSALGORITHM • It means 'the early bird gets the worm'. As the name recommends, the solicitation which starts things out will be handled first, etc. • The solicitations coming to the plate are organized in a legitimate succession as they show up. • Since each solicitation is handled in this calculation, there is zero chance of 'starvation'.
5. 5. SSTFALGORITHM • SSTF is a shortened form of Most brief Look for Time First (SSTF) which is a circle booking calculation. • This is finished by choosing the solicitation which has the least look for time from the ongoing head position. • This calculation has less 'look for time' when contrasted with FCFS Calculation.
6. 6. SCANALGORITHM • It is additionally called Lift Calculation. • In this calculation, the circle arm moves into a specific heading till the end, fulfilling every one of the solicitations coming in its path, and then it turns back and moves in the converse course fulfilling demands coming in its way. • After that, it reverses its direction and starts to scan again the requests in its path and serves them.
7. 7. C - SCANALGORITHM • It means "Roundabout Output". • This calculation is practically equivalent to the Output plate calculation however one thing that makes it different is that 'in the wake of arriving at the one end and turning around the head course, it begins to return. • Subsequent to arriving at the finish of the plate it inverts its course and again begins to move to the opposite finish of the circle yet while returning it serves no solicitations.
8. 8. THE END

### Notas del editor

• GREETINGS!!, I’M PUGALENTHI FROM THE CSBS DEPARTMENT, and I'D LIKE TO PRESENT THE TOPIC DISK SCHEDULING ALGORITHM
• As we know that we can perform numerous tasks on a single PC at the same time, the executives are also critical on all of the Executing Cycles that are running on the Framework at the same time.
We can execute multiple projects at the same time with the help of multiprogramming.
So, in order to control and remember each cycle, the Working Framework employs the Plate Booking concept.
This divides the hour of the computer processor into distinct cycles and checks that each of the cycles will work properly.
• Now let’s look at the types of disk scheduling
FCFS FIRST COME FIRST SERVE ALGO
SSTF SHORTEST SEEK TIME FIRST ALGO
SCAN OR ELEVATOR ALGO
CIRCULAR SCAN ALGO
LOOK ALGO
CIRCULAR LOOK ALGO
• 'The early bird gets the worm,' it says.
As the name implies, the initial solicitation will be processed first, and so on.
The solicitations that arrive at the plate are grouped in a logical sequence.
There is no such thing as'starvation' because each request is handled in this computation.
• SSTF is an abbreviation for Most Brief Look for Time First (SSTF), a circle booking calculation.
This is completed by selecting the solicitation with the least look for time from the current head position.
When compared to FCFS Calculation, this calculation has reduced 'look for time'.
• It is also known as Lift Calculation.
In this computation, the circle arm moves in a specified direction until the end, meeting all of the requests that come its way, and then it turns around and proceeds in the opposite direction, fulfilling all of the requests that come its way.
After that, it reverses its trajectory and begins scanning and serving the requests on its path again.
• "Roundabout Output" is what it means.
This calculation is nearly identical to the Output plate calculation, but one difference is that it begins to return after reaching at one end and rotating around the head course.
When it reaches the end of the plate, it reverses its direction and continues to proceed to the opposite end of the circle, but it serves no solicitations on the way back.
• THANK YOU FOR THE OPPORTUNITY.