Scheduling in the dark

Theoretical Computer Science

Volumn 235, Issue 1, 2000, Pages 109-141

  Edmonds, Jeff ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

Competitive ratio; Equal partition; Response; Scheduling

Indexed keywords

EID: 0037893025     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00186-3     Document Type: Article

References (30)

1. P. Berman, C. Coulston, Speed is more powerful than clairvoyance SWAT 98.
2. T. Brecht, K. Guha, Using parallel program characteristics in dynamic multiprocessor allocation policies, Performance Evaluat. 27 & 28 (1996) 519-539.
3. S.H. Chiang, R.K. Mansharamani, M. Vernon, Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies, Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1994, pp. 33-44.
4. X. Deng, P. Dymond, On multiprocessor system scheduling, 7th ACM Symp. on Parallel Architectures and Algorithms, June 1996.
5. X. Deng, N. Gu, T. Brecht, K. Lu, Preemptive scheduling of parallel jobs on multiprocessors, 7th Annual ACM-SIAM Symp. on Discrete Algorithms, Atlanta, Georgia, January 1996, pp. 159-167.
6. X. Deng, E. Koutsoupias, Competitive implementation of parallel programs, 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 455-461.
7. J. Edmonds, D. Chinn, T. Brecht, X. Deng, Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics, 29th Ann. ACM Symp. on Theory of Computing, pp. 120-129, 1997 and submitted to the SIAM J. Comput.
8. J. Edmonds, Scheduling in the Dark In 31st Ann. ACM Symp. on Theory of Computing, 1999.
9. B. Kalyanasundaram, K. Pruhs, Minimizing flow time nonclairvoyantly, Proc. 38th Symp. on Foundations of Computer Science, October 1997.
10. B. Kalyanasundaram, K. Pruhs, Speed is as powerful as clairvoyance, Proc. 36th Symp. on Foundations of Computer Science, October 1995, pp. 214-221.
11. A. Karlin, M. Manasse, L. Rudolph, D. Sleator, Competitive snoopy caching, Algorithmica 3 (1988) 79-119.
12. M. Kumar, Measuring parallelism in computation-intensive scientific/engineering applications, IEEE Trans. Comput. 37(9) (1988) 1088-1098.
13. S. Leonardi, D. Raz, Approximating total flow time on parallel machines, ACM Symp. on Theory of Computing, 1997.
14. S. Leutenegger, M. Vernon, The performance of multiprogrammed multiprocessor scheduling policies, Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, May 1990, pp. 226-236.
15. M. Manasse, L. McGeoch, D. Sleator, Competitive algorithms for on-line problems, Proc. 20th Annual ACM Symp. on the Theory of Computing, 1988, pp. 322-333.
16. Matsumoto, Competitive analysis of the round robin algorithm, 3rd Int. Symp. on Algorithms and Computation, 1992, pp. 71-77.
17. C. McCann, R. Vaswani, J. Zahorjan, A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors, ACM Trans. Comput. Systems 11(2) (1993) 146-178.
18. C. McCann, J. Zahorjan, Scheduling memory constrained jobs on distributed memory parallel computers, Proc. Inter. Joint. Conf. on Measurement and Modeling of Computer Systems, ACM SIGMETRICS 95 and Performance 95, 1995, pp. 208-219.
19. R. Motwani, S. Phillips, E. Torng, Non-clairvoyant scheduling, Theoret. Comput. Sci. (Special Issue on Dynamic and On-Line Algorithms) 130 (1994) 17-47. Preliminary Version: Proceedings of the 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 422-431.
20. R. Motwani, S. Phillips, E. Torng, Non-clairvoyant scheduling, Theoret. Comput. Sci. (Special Issue on Dynamic and On-Line Algorithms) 130 (1994) 17-47. Preliminary Version: Proceedings of the 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 422-431.
21. T. Nguyen, R. Vaswani, J. Zahorjan, Maximizing speedup through self-tuning of processor allocation, Proc. 10th Int. Parallel Processing Symp. Waikiki, HI, April 1996, pp. 463-468.
22. C. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation, 29th Ann. ACM Symp. on Theory of Computing, pp. 140-149, 1997, SIAM J. Comput., submitted.
23. U. Schwiegelshohn, W. Ludwig, J. Wolf, J. Turek, P. Yu, Smart SMART bounds for weighted response time scheduling, SIAM J. Comput., to appear.
24. K. Sevick, Application scheduling and processor allocation in multiprogrammed parallel processing systems, Performance Evaluat. 19(2-3) (1994) 107-140.
25. D. Sleator, R. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28(2) (1985) 202-208.
26. A. Tucker, A. Gupta, Process control and scheduling issues for multiprogrammed shared-memory multiprocessors, Proc. 12th ACM Symp. Operating Systems Principles, 1989, pp. 159-166.
27. J. Turek, W. Ludwig, J.L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, P.S. Yu, Scheduling parallelizable tasks to minimize average response time, 6th Annual ACM Symp. on Parallel Algorithms and Architectures, June 1994, pp. 200-209.
28. J. Turek, U. Schwiegelsohn, J. Wolf, P. Yu, Scheduling parallel tasks to minimize average response time, Proc. 5th SIAM Symp. on Discrete Algorithms, 1994, pp. 112-121.
29. A. Yao, Probablistic computations: towards a unified measure of complexity, Proc. of 18th IEEE Symp. on Foundations of Computer Science, 1977, pp. 222-227.
30. J. Zahorjan, C. McCann, Processor scheduling in shared memory multiprocessors, Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, May 1990, pp. 214-225.