Bookmarks
Concepts
Activity
Courses
Learning Plans
Courses
Request
Log In
Sign up
👤
Log In
Join
?
⚙️
→
👤
Log In
Join
?
←
Menu
Bookmarks
Concepts
Activity
Courses
Learning Plans
Courses
Request
Log In
Sign up
×
CUSTOMIZE YOUR LEARNING
→
TIME COMMITMENT
10 sec
2 min
5 min
15 min
1 hr
3 hours
8 hours
1k hrs
YOUR LEVEL
beginner
some_idea
confident
expert
LET'S Start Learning
👤
Log In
Join
?
⚙️
→
👤
Log In
Join
?
←
Menu
Bookmarks
Concepts
Activity
Courses
Learning Plans
Courses
Request
Log In
Sign up
×
CUSTOMIZE YOUR LEARNING
→
TIME COMMITMENT
10 sec
2 min
5 min
15 min
1 hr
3 hours
8 hours
1k hrs
YOUR LEVEL
beginner
some_idea
confident
expert
LET'S Start Learning
New Course
Concept
Shortest Seek Time First (SSTF)
Shortest
Seek Time
First (SSTF) is a
disk scheduling algorithm
that selects the
disk I/O request
that requires the least
movement of the disk's read/write head
from its current position. This approach minimizes
Seek Time
, thereby potentially improving
system performance
, but it can also lead to
starvation of requests
that are far from the current head position.
Relevant Degrees
Human-Computer Interaction and User Experience 70%
Data Management and Processing 30%
Generate Assignment Link
Lessons
Concepts
Suggested Topics
Foundational Courses
Learning Plan
All
Followed
Recommended
Assigned
3