Smart smart bounds for weighted response time scheduling

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 237-253

  Schwiegelshohn, Uwe ^a   Ludwig, Walter ^b   Wolf, Joel L ^c   Turek, John ^c   Yu, Philip S ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b University of Wisconsin Madison   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximate algorithms; Parallel computing; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

SCHEDULING TO MINIMIZE AVERAGE RESPONSE TIME (SMART);

PARALLEL PROCESSING SYSTEMS;

EID: 0032057851     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795286831     Document Type: Article

References (14)

1. B. BAKER, E. COFFMAN, AND R. RIVEST, Orthogonal packings in two dimensions, SIAM J. Comput., 9 (1980), pp. 846-855.
2. J. BLAZEWICZ, J. LENSTRA, AND A. R. KAN, Scheduling subject to resource constraints: Classification and complexity, Discrete Appl. Math., 5 (1983), pp. 11-24.
3. E. COFFMAN, M. GAREY, D. JOHNSON, AND R. TARJAN, Performance bounds for level-oriented two-dimensional packing algorithms, SIAM J. Comput., 9 (1980), pp. 808-826.
4. M. GAREY AND R. GRAHAM, Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput., 4 (1975), pp. 187-200.
5. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, 1979.
6. D. JOHNSON, Near-Optimal Bin-Packing Algorithms, Tech. Report MAC TR-109, MIT, Cambridge, MA, June 1973.
7. D. JOHNSON, Fast algorithms for bin packing, J. Comput. System Sci., 8 (1974), pp. 272-314.
8. W. LUDWIG AND P. TIWARI, The Power of Choice in Scheduling Parallel Tasks, Technical Report 1190, Computer Sciences Department, University of Wisconsin-Madison, November 1993.
9. D. SLEATOR, A 2.5 times optimal algorithm for packing in two dimensions, Inform. Process. Lett., 10 (1980), pp. 37-40.
10. W. SMITH, Various optimizers for single-stage production, Naval Research Logistics Quarterly, 3 (1956), pp. 59-66.
11. J. TUREK, W. LUDWIG, J. WOLF, L. FLEISCHER, P. TIWARI, J. GLASGOW, U. SCHWIEGELSHOHN, AND P. Yu, Scheduling parallelizable tasks to minimize average response time, in Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures, Cape May, NJ, June 1994, pp. 200-209.
12. J. TUREK, U. SCHWIEGELSHOHN, J. WOLF, AND P. Yu, Scheduling parallel tasks to minimize average response times, in Proceedings of the SIAM Symposium on Discrete Algorithms, Arlington, VA, January 1994, pp. 112-121.
13. J. TUREK, J. WOLF, K. PATTIPATI, AND P. Yu, Scheduling parallelizable tasks: Putting it all on the shelf, in Proceedings of the ACM Sigmetrics Conference, Newport, RI, June 1992, pp. 225-236.
14. J. TUREK, J. WOLF, AND P. Yu, Approximate algorithms for scheduling parallelizable tasks, in Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, San Diego, CA, June 1992, pp. 323-332.