Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics

Journal of Scheduling

Volumn 6, Issue 3, 2003, Pages 231-250

  Edmonds, Jeff ^a   Chinn, Donald D ^a,b   Brecht, Tim ^a,c   Deng, Xiaotie ^a,d  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER WORKSTATIONS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; THEOREM PROVING;

MULTIPROCESSOR SCHEDULING; PARALLEL SYSTEMS; PROCESSORS; SCHEDULING ALGORITHMS;

MULTIPROCESSING SYSTEMS;

EID: 3543065228     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022952324290     Document Type: Article

References (30)

1. Brecht, T. and K. Guha, "Using parallel program characteristics in dynamic multiprocessor allocation policies," Performance Evaluation, 27 & 28, 519-539 (October 1996).
2. Chiang, S. H., R. K. Mansharamani, and M. Vernon, "Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies," in Proc. 1994 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1994, pp. 33-44.
3. Deng, X. and P. Dymond, "On multiprocessor system scheduling," Journal of Combinatorial Optimization, Vol. 1, 1998, pp. 377-392, a special issue on Scheduling on Parallel/Distributed Systems.
4. Deng, X., N. Gu, T. Brecht, and K. Lu, "Preemptive scheduling of parallel jobs on multiprocessors," SIAM J. Comput., 30(1), 145-160 (2000).
5. Deng, X., and E. Koutsoupias, "Competitive implementation of parallel programs," Algorithmica, 23(1), 14-30 (1999).
6. Edmonds, J., T. Brecht, D. Chinn, and X. Deng, "Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics," Technical Report, York, 2000.
7. Edmonds, J., "Scheduling in the dark," in STOC 1999 and Blum's Special Issue of the J. Theor. Comput. Sci., 1999, and in Proc. 31st Annu. ACM Symp. on Theory of Computing.
8. Edmonds, J., "Scheduling in the dark," in STOC 1999 and Blum's Special Issue of the J. Theor. Comput. Sci., 1999, and in Proc. 31st Annu. ACM Symp. on Theory of Computing.
9. Edmonds, J., "Scheduling in the dark," in Blum's Special Issue of the J. Theor. Comput. Sci., 1999 and in Proc. 31st Annu. ACM Symp. on Theory of Computing.
10. Edmonds, J., "Scheduling in the dark," in Blum's Special Issue of the J. Theor. Comput. Sci., 1999 and in Proc. 31st Annu. ACM Symp. on Theory of Computing.
11. Kalyanasundaram, B. and K. Pruhs, "Speed is as powerful as clairvoyance," in Proc. 36th Symp. on Foundations of Computer Science, October 1995, pp. 214-221, and JACM, 2000
12. Kalyanasundaram, B. and K. Pruhs, "Speed is as powerful as clairvoyance," in Proc. 36th Symp. on Foundations of Computer Science, October 1995, pp. 214-221, and JACM, 2000
13. Kumar, M., "Measuring parallelism in computation-intensive scientific/engineering applications," IEEE Trans. Comput., 37(9), 1088-1098 (September 1988).
14. Leutenegger, S. T. and R. D. Nelson, "Analysis of spatial and temporal scheduling policies for semi-static and dynamic multiprocessor environments," RC 17086 (75594), IBM T. J. Watson Research Center, Yorktown Heights, NY, August 1991.
15. Leutenegger, S. and M. Vernon, "The performance of multiprogrammed multiprocessor scheduling policies," in Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, 1990, pp. 226-236.
16. Ludwig, W. and P. Tiwari, The Power of Choice in Scheduling Parallel Tasks, TR 1190, Computer Science Department, University of Wisconsin, Madison, November 1993.
17. Mansharamani, R. and M. K. Vernon, Qualitative Behavior of the EQS Parallel Processor Allocation Policy, TR 1192, Computer Sciences Department, University of Wisconsin, Madison, November 1993.
18. Manasse, M., L. McGeoch, and D. Sleator, "Competitive algorithms for on-line problems," in Proc. 20th Annu. ACM Symp. on the Theory of Computing, 1988, pp. 322-333.
19. McCann, C., R. Vaswani, and J. Zahorjan, "A dynamic processor allocation policy for multiprogrammed, shared memory multiprocessors," ACM Trans. Comput. Syst., 11(2), 146-178 (1993).
20. McCann, C. and J. Zahorjan, "Scheduling memory constrained jobs on distributed memory parallel computers," in Proc. Int. Joint Conf. on Measurement and Modeling of Computer Systems, ACM SIGMETRICS 95 and Performance 95, 1995, pp. 208-219.
21. Motwani, R., S. Phillips, and E. Torng, "Non-clairvoyant scheduling," in Proc. 4th Annu. ACM/SIAM Symp. on Discrete Algorithms, Austin, Texas, January 1993, pp. 422-431 and Theor. Comput. Sci., 130, 17-47 (1994).
22. Motwani, R., S. Phillips, and E. Torng, "Non-clairvoyant scheduling," in Proc. 4th Annu. ACM/SIAM Symp. on Discrete Algorithms, Austin, Texas, January 1993, pp. 422-431 and Theor. Comput. Sci., 130, 17-47 (1994).
23. Nguyen, T., R. Vaswani, and J. Zahorjan, "Maximizing speedup through self-tuning of processor allocation," in Proc. 10th Int. Parallel Processing Symp., Waikiki, HI, April 1996, pp. 463-468.
24. Schwiegelshohn, U., W. Ludwig, J. Wolf, J. Turek, and P. Yu, "Smart SMART, bounds for weighted response time scheduling," SIAM J. Comput., 1996 (in press).
25. Sevcik, K., "Application scheduling and processor allocation in multiprogrammed parallel processing systems," Performance Evaluation, 19(2-3), 107-140 (1994).
26. Sleator, D. and R. Tarjan, "Amortized efficiency of list update and paging rules," Comm. ACM, 28(2), 202-208 (1985).
27. Tucker, A., and A. Gupta, "Process control and scheduling issues for multiprogrammed shared-memory multi-processors," in Proc. 12th ACM Symp. on Operating Systems Principles, 1989, pp. 159-166.
28. Turek, J., W. Ludwig, J. L. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P. S. Yu, "Scheduling parallelizable tasks to minimize average response time," in 6th Annu. ACM Symp. on Parallel Algorithms and Architectures, 1994a, pp. 200-209.
29. Turek, J., U. Schwiegelshohn, J. Wolf, and P. Yu, "Scheduling parallel tasks to minimize average response time," in Proc. 5th SIAM Symp. on Discrete Algorithms, 1994b, pp. 112-121.
30. Zahorjan, J. and C. McCann, "Processor scheduling in shared memory multiprocessors," in Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, Boulder, Colorado, May 1990, pp. 214-225.