E. Bachmat
- Aldous D. and Diaconis P., Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem, Bull. of the AMS, Vol. 36 Nu.4, 413-432, 1999.Google Scholar
Cross Ref
- Andrews M, Bender M. A. and Zhang L., New algorithms for the disk scheduling problem, Proc. of STOC 96.Google Scholar
- Bachmat E., Average case analysis for batched disk scheduling and increasing subsequences, preprint, 2001.Google Scholar
- Beardwood J. E., Halton J. H and Hammersley J. M., The shortest path through many points, Proc. Cambridge Philo. Society, Vol.55, 299-327,1959.Google ScholarCross Ref
- Deuschel J. D. and Zeitouni O., Limiting curves for iid records, Ann. of probability, Vol 23, 852-878, 1995.Google Scholar
- Dilworth R. P., A decomposition theorem for partially ordered sets, Annals of math. 51, 161-166, 1950.Google Scholar
- Jacobson D. and Wilkes J., Disk scheduling algorithms based on rotational position, HP Labs tech. report HPL-CSP-91-7rev1, 1991.Google Scholar
- Talagrand M., Concentration of measure and isoperimetric inequalities in product spaces, Pub. Math. I.H.E.S, vol. 81, 73-203, 1995.Google ScholarCross Ref
Index Terms
- Average case analysis for batched disk scheduling and increasing subsequences
Recommendations
Systems Support for Preemptive Disk Scheduling
Allowing higher-priority requests to preempt ongoing disk IOs is of particular benefit to delay-sensitive and real-time systems. In this paper, we present Semi-preemptible IO, which divides disk IO requests into small temporal units of disk commands to ...
Online Scheduling to Minimize Average Stretch
We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount ...
Comments