Disk scheduling: FCFS vs.SSTF revisited
Communications of the ACM
A comparative analysis of disk scheduling policies
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Disk arm movement in anticipation of future requests
ACM Transactions on Computer Systems (TOCS)
Analysis of the Periodic Update Write Policy for Disk Cache
IEEE Transactions on Software Engineering
Parity declustering for continuous operation in redundant disk arrays
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
The process-flow model: examining I/O performance from the system's point of view
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Scheduling algorithms for modern disk drives
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
Destage algorithms for disk arrays with non-volatile caches
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Random I/O scheduling in online tertiary storage systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Destage Algorithms for Disk Arrays with Nonvolatile Caches
IEEE Transactions on Computers
Cello: a disk scheduling framework for next generation operating systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Disk scheduling for mixed-media workloads in a multimedia server
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Architectural considerations for next generation file systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Modeling and performance of MEMS-based storage devices
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Disk performance enhancement through Markov-based cylinder remapping
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Cello: A Disk Scheduling Framework for Next Generation Operating Systems*
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Disk scheduling policies with lookahead
ACM SIGMETRICS Performance Evaluation Review
Incremental Scheduling of Mixed Workloads in MultimediaInformation Servers
Multimedia Tools and Applications
Shared Index Scans for Data Warehouses
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Delivering presentations from multimedia servers
The VLDB Journal — The International Journal on Very Large Data Bases
Architectural considerations for next-generation file systems
Multimedia Systems
Throughput Optimization in Disk-Based Real-Time Application Specific Systems
ISSS '96 Proceedings of the 9th international symposium on System synthesis
Active block layout: a high performance disk layout mechanism
ACM SIGOPS Operating Systems Review
QoS-oriented negotiation in disk subsystems
Data & Knowledge Engineering
Modeling and improving security of a local disk system for write-intensive workloads
ACM Transactions on Storage (TOS)
WOW: wise ordering for writes - combining spatial and temporal locality in non-volatile caches
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Matrix-Stripe-Cache-Based Contiguity Transform for Fragmented Writes in RAID-5
IEEE Transactions on Computers
Integrating concurrency control and energy management in device drivers
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Evaluating block-level optimization through the IO path
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
An Adaptive Energy-Conserving Strategy for Parallel Disk Systems
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Conserving energy in real-time storage systems with I/O burstiness
ACM Transactions on Embedded Computing Systems (TECS)
A genetic based disk scheduling method to decrease makespan and missed tasks
Information Systems
STOW: a spatially and temporally optimized write caching algorithm
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Hardware design of a new genetic based disk scheduling method
Real-Time Systems
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
Predicting disk scheduling performance with virtual machines
PERFORM'10 Proceedings of the 2010 IFIP WG 6.3/7.3 international conference on Performance Evaluation of Computer and Communication Systems: milestones and future challenges
Operating system support for multimedia systems
Computer Communications
An adaptive energy-conserving strategy for parallel disk systems
Future Generation Computer Systems
Hi-index | 0.01 |
A continuum of disk scheduling algorithms, V(R), having endpoints V(0) = SSTF and V(1) = SCAN, is defined. V(R) maintains a current SCAN direction (in or out) and services next the request with the smallest effective distance. The effective distance of a request that lies in the current direction is its physical distance (in cylinders) from the read/write head. The effective distance of a request in the opposite direction is its physical distance plus R x (total number of cylinders on the disk). By use of simulation methods, it is shown that this definitional continuum also provides a continuum in performance, both with respect to the mean and with respect to the standard deviation of request waiting time. For objective functions that are linear combinations of the two measures, &mgr;w + kow, intermediate points of the continuum are seen to provide performance uniformly superior to both SSTF and SCAN. A method of implementing V(R) and the results of its experimental use in a real system are presented.