Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
From MaRDI portal
Publication:1195936
DOI10.1007/BF01994839zbMath0757.68061MaRDI QIDQ1195936
Tung-Shou Chen, Wei-Pang Yang, Richard Chia-Tung Lee
Publication date: 26 January 1993
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01994839
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68N25: Theory of operating systems
Related Items
A stochastic analysis of hard disk drives, Hardware design of a new genetic based disk scheduling method, SIMPLE: An optimal disk system with two restricted heads
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The pairing heap: A new form of self-adjusting heap
- Object-oriented operating systems
- Competitive algorithms for server problems
- Amortized Computational Complexity
- Self-adjusting binary search trees
- An anomaly in disk scheduling
- Self-Adjusting Heaps
- Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems
- A comparative analysis of disk scheduling policies
- Analysis of Scanning Policies for Reducing Disk Seek Times