New algorithms for disk scheduling
From MaRDI portal
Publication:5957577
Recommendations
Cited in
(20)- Competitive analysis of on-line disk scheduling
- scientific article; zbMATH DE number 1424318 (Why is no real title available?)
- Euro-Par 2004 Parallel Processing
- Average case analysis of disk scheduling, increasing subsequences and spacetime geometry
- Optimal read-once parallel disk scheduling
- The optimum execution order of queries in linear storage
- A disk scheduling algorithm: SPFF
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Min-max subsequence problems in multi-zone disk recording
- RCPCP: A Ceiling-based Protocol for Multiple-disk Environments
- Disk Performance in a Transaction-Oriented System
- An adversarial queueing model for online server routing
- Hardware design of a new genetic based disk scheduling method
- Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues
- The cost of cache-oblivious searching
- Improved disk scheduling algorithms based on rotational position
- The two headed disk: Stochastic dominance of the greedy policy
- Evaluating disk idle behavior by leveraging disk schedulers
- Cello: A disk scheduling framework for next generation operating systems
- Phased RGSS: An improved disk array scheduling for continuous media retrieval
This page was built for publication: New algorithms for disk scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957577)