New algorithms for disk scheduling

DOI10.1007/S00453-001-0071-1MaRDI QIDQ5957577zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

asymmetric traveling salesman problemdisk scheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• A disk scheduling algorithm: SPFF
• Competitive analysis of on-line disk scheduling
• Competitive analysis of on-line disk scheduling
• Optimal Computer Disk Access
• Optimal read-once parallel disk scheduling

Cited in

(25)

• Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
• Competitive analysis of on-line disk scheduling
• Adaptive disk spindown via optimal rent-to-buy in probabilistic environments
• The two headed disk: Stochastic dominance of the greedy policy
• Phased RGSS: An improved disk array scheduling for continuous media retrieval
• Average case analysis of disk scheduling, increasing subsequences and spacetime geometry
• Disk Performance in a Transaction-Oriented System
• Improved disk scheduling algorithms based on rotational position
• A disk scheduling algorithm: SPFF
• Mathematical adventures in performance analysis. From storage systems, through airplane boarding, to express line queues
• Optimal Computer Disk Access
• RCPCP: A Ceiling-based Protocol for Multiple-disk Environments
• scientific article; zbMATH DE number 885350 (Why is no real title available?)
• scientific article; zbMATH DE number 1424318 (Why is no real title available?)
• Euro-Par 2004 Parallel Processing
• Min-max subsequence problems in multi-zone disk recording
• Cello: A disk scheduling framework for next generation operating systems
• Hardware design of a new genetic based disk scheduling method
• The cost of cache-oblivious searching
• Competitive analysis of on-line disk scheduling
• Evaluating disk idle behavior by leveraging disk schedulers
• A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy
• Optimal read-once parallel disk scheduling
• The optimum execution order of queries in linear storage
• An adversarial queueing model for online server routing

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)