A new LOOK-style disk scheduling algorithm with per-track sector and platter ordering plus a bad-sector handling table is claimed to cut disk access time by about 7.5 percent over earlier variants.
Galvin, and Gerg Gagne, (2014) ―Operating System Concepts ‖
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.OS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Optimized Disk Scheduling Algorithm With Bad-Sector Management
A new LOOK-style disk scheduling algorithm with per-track sector and platter ordering plus a bad-sector handling table is claimed to cut disk access time by about 7.5 percent over earlier variants.