Simulating Stable Stochastic Systems, I: General Multiserver Queues
Journal of the ACM (JACM)
A Performance Evaluation of the CII SIRIS 8 Operating System. Methodology, Tools and First Results
Proceedings of the International Workshop organized by the Commision of the European Communities on Modelling and Performance Evaluation of Computer Systems
A continuum of disk scheduling algorithms
ACM Transactions on Computer Systems (TOCS)
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Optimal directory placement on disk storage devices
Journal of the ACM (JACM)
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
ACM Transactions on Computer Systems (TOCS)
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
An analytic behavior model for disk drives with readahead caches and request reordering
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Architectural considerations for next generation file systems
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Cello: A Disk Scheduling Framework for Next Generation Operating Systems*
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Average case analysis for batched disk scheduling and increasing subsequences
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Disk scheduling policies with lookahead
ACM SIGMETRICS Performance Evaluation Review
Optimal Parallel Initialization Algorithms for a Class of Priority Queues
IEEE Transactions on Parallel and Distributed Systems
RAID5 Performance with Distributed Sparing
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Storage Systems
Performance Evaluation: Origins and Directions
Architectural considerations for next-generation file systems
Multimedia Systems
A log file design for analyzing secondary storage occupancy
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Throughput Optimization in Disk-Based Real-Time Application Specific Systems
ISSS '96 Proceedings of the 9th international symposium on System synthesis
Batched disk scheduling with delays
ACM SIGMETRICS Performance Evaluation Review - Design, implementation, and performance of storage systems
Virtual I/O scheduler: a scheduler of schedulers for performance virtualization
Proceedings of the 3rd international conference on Virtual execution environments
Why does file system prefetching work?
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Models of DASD Subsystems with Multiple Access Paths: A Throughput-Driven Approach
IEEE Transactions on Computers
Admission control algorithm for multimedia server: a hybrid approach
International Journal of Computers and Applications
A genetic based disk scheduling method to decrease makespan and missed tasks
Information Systems
A new real time disk-scheduling method based on GSR algorithm
Journal of Systems and Software
Hardware design of a new genetic based disk scheduling method
Real-Time Systems
On the energy consumption and performance of systems software
Proceedings of the 4th Annual International Conference on Systems and Storage
Survey and analysis of disk scheduling methods
ACM SIGARCH Computer Architecture News
Algorithms for designing multimedia servers
Computer Communications
| Hi-index | 48.22 |
We report on a rather extensive simulation effort directed at evaluating the merits of two scheduling strategies, FCFS and SSTF, for moving-arm disks under stationary request arrival process. For First-Come-First-Served (FCFS) scheduling, analytic results for the mean waiting time are also given (in a closed form). If the objective of a schedule is to minimize the mean waiting time (or queue size) and its variance, the results seem to confirm the overall superiority of Shortest-Seek-Time-First (SSTF), particularly for medium and heavy traffic. This holds also when the input is highly correlated or addresses the cylinders nonuniformly. These results contradict some statements published in recent years. The domain of policies where SSTF is optimal is considered. The simulation methodology is described in some detail.