Competitive analysis of on-line disk scheduling
From MaRDI portal
Publication:6487455
Recommendations
Cites work
- A comparative analysis of disk scheduling policies
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- An Optimal On-Line Algorithm for K Servers on Trees
- An anomaly in disk scheduling
- Competitive \(k\)-server algorithms
- Competitive paging algorithms
- On the Expected Performance of Scanning Disks
Cited in
(5)
This page was built for publication: Competitive analysis of on-line disk scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487455)