The k-Client Problem

Journal of Algorithms

Volumn 41, Issue 2, 2001, Pages 115-173

  Alborzi, Houman ^a   Torng, Eric ^b   Uthaisombut, Patchrawat ^b   Wagner, Stephen ^b  

^a University of Maryland ^*  (United States)

^b Michigan State University   (United States)

Author keywords

Average completion time; Competitive analysis; Disk scheduling; Maximum response time; Multithreaded systems; Online algorithms

Indexed keywords

EID: 0347156631     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1182     Document Type: Article

References (32)

1. M. Andrews, M. Bender, and L. Zhang, New algorithms for the disk scheduling problem. in "Proceedings of IEEE FOCS, 1996."
2. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Serving requests with on-line routing, in "Proceedings of the 4th Scandinavian Workshop on Algorithms Theory (SWAT 94), 1994," pp. 37-48.
3. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Competitive algorithms for the on-line traveling-salesman, in "Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS 95), 1995," pp. 206-217.
4. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, On-line scheduling in the presence of overload, in "Proc. 32nd IEEE Symp. on the Foundations of Computer Science, 1991," pp. 101-110.
5. A. Borodin, N. Linial, and M. Saks, An optimal online algorithm for metrical task system, J. Assoc. Comput. Machinery 39 (1992), 745-763.
6. T.-S. Chen, SIMPLE: An optimal disk system with two restricted heads, Inform. Process. Lett. 55 (1995), 273-277.
7. E. Coffman and M. Hofri, On the expected performance of scanning disks, SIAM J. Comput. 11 (1982), 60-70.
8. E. Coffman, L. Klimko, and B. Ryan, Analysis of scanning policies for reducing disk seek times, SIAM J. Comput. 1(3) (1972), 269-279.
9. T. Cormen, C. Leiserson, and R. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
10. X. Deng and C. H. Papadimitriou, Exploring an unknown graph, in "Proc. 31st IEEE Symp. on Foundations of Computer Science, 1990," pp. 355-361.
11. M. Dertouzos and A. Mok, Multiprocessor on-line scheduling of hard-real-time tasks, IEEE Trans. Software Eng. 15 (1989), 1497-1506.
12. A. Feldmann, M.-Y. Kao, J. Sgall, and S.-H. Teng, Optimal online scheduling of parallel jobs with dependencies, J. Combin. Optim. 1 (1998), 393-411.
13. A. Feldmann, J. Sgall, and S.-H. Teng, Dynamic scheduling on parallel machines, in "Proc. of 32nd IEEE Symp. on Foundations of Computer Science, 1991," pp. 111-120.
14. E. Feuerstein, "On-line Paging of Structured Data and Multi-threaded Paging," Ph.D. thesis, University of Rome, 1995.
15. A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, and N. Young, Competitive paging algorithms, J. Algorithms 12 (1991), 685-699.
16. R. Geist and S. Daniel, A continuum of disk scheduling algorithms, ACM Trans. Comput. Scheduling 5(1) (1987), 77-92.
17. B. Kalyanasundaram and K. Pruhs, Constructing competitive tours from local information, Theoret. Comput. Sci. 130 (1994), 125-138.
18. B. Kalyanasundaram and K. Pruhs, Speed is as powerful as clairvoyance, in "Proceedings of the 34th Annual IEEE Foundations of Computer Science, 1995," pp. 214-221, to appear in J. Assoc. Comput. Machinery.
19. M.-Y. Kao, J. H. Reif, and S. R Tate, Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem, Inform. and Comput. 131 (1997), 63-80.
20. G.-Koren and D. Shasha, MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling, Theoret. Comput. Sci. 128 (1994), 75-97.
21. E. Koutsoupias and C. Papadimitriou, On the k-server conjecture, J. Assoc. Comput. Machinery 42(5) (1995), 971-983.
22. E. Koutsoupias, P. Papadimitriou, and M. Yannakakis, Searching a fixed graph, in "Int. Colloq. on Automata, Languages, and Programming (ICALP 96), 1996."
23. M. S. Manasse, L. A. McGeoch and D. D. Sleator, Competitive algorithms for server problems, J. Algorithms 11(2) (1990), 208-230.
24. R. Motwani, S. Phillips, and E. Torng, Non-clairvoyant scheduling, Theoret. Comput. Sci. 130(1) (1994), 17-47.
25. W. Oney, Queuing analysis of the scan policy for moving-head disks, J. Assoc. Comput. Machinery 22(3) (1975), 397-412.
26. P. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theoret. Comput. Sci. 84 (1991), 127-150.
27. M. Seltzer, P. Chen, and J. Ousterhout, Disk scheduling revisited, in "USENIX, 1990," pp. 313-324.
28. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, CACM 28 (1985), 202-208.
29. T. Teorey and T. Pinkerton, A comparative analysis of disk scheduling policies, Comm. Assoc. Comput. Machinery 15(3) (1972), 177-184.
30. J. Vuillemin, A data structure for manipulating priority queues, Comm. Assoc. Comput. Machinery 24 (1978), 309-315.
31. B. Worthington, G. Ganger, and Y. Patt, Scheduling algorithms for modern disk drives, in "SIGMETRICS, 1994," pp. 241-251.
32. A. C.-C. Yao, Probabilistic computations: Towards a unified measure of complexity, in "Proc. of 18th IEEE Symp. on Foundations of Computer Science, 1977," pp. 222-227.