Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN
暂无分享,去创建一个
[1] Neil C. Wilhelm. An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses , 1976, CACM.
[2] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[3] Peter J. Denning,et al. Effects of scheduling on file memory operations , 1899, AFIPS '67 (Spring).
[4] Toby J. Teorey,et al. A comparative analysis of disk scheduling policies , 1972, CACM.
[5] Edward F. Grove. The harmonic online K-server algorithm is competitive , 1991, STOC '91.
[6] Jon Louis Bentley,et al. Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.
[7] Tung-Shou Chen,et al. Amortized Analysis of Disk Scheduling Algorithm V(R) , 1992, J. Inf. Sci. Eng..
[8] Howard Frank,et al. Analysis and Optimization of Disk Storage Devices for Time-Sharing Systems , 1969, JACM.
[9] Micha Hofri. Disk scheduling: FCFS vs.SSTF revisited , 1980, CACM.
[10] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[11] Robert E. Tarjan,et al. Self-Adjusting Heaps , 1986, SIAM J. Comput..
[12] Edward G. Coffman,et al. Analysis of Scanning Policies for Reducing Disk Seek Times , 1972, SIAM J. Comput..
[13] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[14] Seymour E. Goodman,et al. Introduction to the Design and Analysis of Algorithms , 1977 .
[15] Abraham Silberschatz,et al. Operating System Concepts , 1983 .
[16] Robert Geist,et al. A continuum of disk scheduling algorithms , 1987, TOCS.
[17] R. Tarjan. Amortized Computational Complexity , 1985 .
[18] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.