Explore tens of thousands of sets crafted by our community.
Disk Scheduling Algorithms
10
Flashcards
0/10
VSCAN
VSCAN is a variant of SCAN which varies the elevator's speed dynamically based on system load, offering a compromise between SSTF and SCAN.
C-SCAN
Circular SCAN (C-SCAN) moves the head from one end of the disk to the other servicing requests, then jumps back to the beginning and repeats the process.
LOOK
LOOK moves the head towards the nearest end and processes requests on the way, then reverses direction and does the same, ignoring requests further than the last one in each direction.
NSS
The NSS (Next Served Sector) scheduling handles requests by choosing the request with the shortest seek time from the next sector to be serviced.
FCFS
First Come First Serve (FCFS) processes the requests in the order they arrive in the disk queue.
C-LOOK
Circular LOOK (C-LOOK) is similar to LOOK but the head jumps to the opposite end of the queue without servicing requests after hitting the last request in one direction.
SCAN
SCAN moves the disk arm towards one end servicing all requests until it gets to the end of the disk, then reverses direction.
N-Step-SCAN
N-Step-SCAN breaks the disk request queue into subqueues of size N and processes each subqueue using SCAN before moving on.
SSTF
Shortest Seek Time First (SSTF) selects the request closest to the current head position.
FSCAN
FSCAN maintains two queues of requests; it processes one while collecting new requests in the other, then switches queues.
© Hypatia.Tech. 2024 All rights reserved.