Home >Topic List >Disk scheduling algorithm
Disk scheduling algorithm
Disk Scheduling In a multi-programmed computer system, each process may continuously make different requests for read/write operations on the disk. Since sometimes these processes send requests faster than the disk can respond, it is necessary for us to establish a waiting queue for each disk device. PHP Chinese Network brings you disk scheduling algorithm related types and other related tutorials And the article, I hope it will be helpful to everyone.
What are the disk scheduling algorithms?Disk scheduling algorithms include: 1. First come, first served algorithm, which schedules according to the order in which processes request access to the disk; 2. Shortest search time priority algorithm, which selects the track for scheduling processing that is closest to the track where the current head is located, so that Each search time is the shortest; 3. Scanning algorithm; 4. Loop scanning algorithm.
What are the disk scheduling algorithms?Disk scheduling algorithms include: 1. First come, first served algorithm, which schedules according to the order in which processes request access to the disk; 2. Shortest search time priority algorithm, which selects the track for scheduling processing that is closest to the track where the current head is located, so that The search time is the shortest each time; 3. Scanning algorithm, in the current moving direction of the magnetic head, selects the request closest to the track where the current magnetic head is located as the next service object; 4. Cyclic scanning algorithm, based on the scanning algorithm, the magnetic head unit is specified Provide services to the mobile server, and when returning, move directly to the origin quickly without serving any requests.
What are the common disk scheduling algorithms?Common disk scheduling algorithms include first come, first served, shortest seek time first, scan algorithm, loop scan algorithm, simple elevator algorithm and loop LOOK algorithm. Detailed introduction: 1. First come, first served, the advantage is that it is simple to implement, but the disadvantage is that it may cause uneven disk access time, causing some requests to wait for too long; 2. The shortest seek time is given priority, and the advantage is that it can improve the disk access efficiency , but the disadvantage is that starvation problems may occur; 3. Scanning algorithm, the advantage is that it can ensure that every request will be satisfied, but the disadvantage is that the waiting time for intermediate requests is too long, etc.
Related coursesMore>
Summary of firewall technology for Linux network securityIntermediate23254 plays
Dark Horse Cloud Classroom 2016 Github Development Video TutorialElementary32607 plays
Python tutorial Tkinter video tutorialAdvanced36389 plays
Shangxuetang MySQL video tutorialAdvanced18147 plays
Related Resource DownloadsMore>
Related TutorialsMore>
- 03-31
- 02-14
- 09-10
- 06-13
- 03-19
- 08-08