New algorithms for disk scheduling
DOI10.1007/S00453-001-0071-1zbMATH Open0990.68024OpenAlexW116784803MaRDI QIDQ5957577FDOQ5957577
Authors: Matthew Andrews, Michael A. Bender, Lisa Zhang 
Publication date: 14 August 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0071-1
Recommendations
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cited In (19)
- Title not available (Why is that?)
- 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
- 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
- Competitive analysis of on-line disk scheduling
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)
