Preemptive weighted completion time scheduling of parallel jobs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 39-51

  Schwiegelshohn, Uwe ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; SCHEDULING;

APPROXIMATION FACTOR; MACHINE MODELING; MASSIVELY PARALLEL PROCESSORS; NON-PREEMPTIVE; NUMERICAL OPTIMIZATIONS; OFF LINE SCHEDULING; PREEMPTION PENALTIES; WEIGHTED COMPLETION TIME;

OPTIMIZATION;

EID: 21444451933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_45     Document Type: Conference Paper

References (11)

1. th SIAM Symposium on Discrete Algorithms, January 1996.
2. D.G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 1-18. Springer-Verlag, Lecture Notes in Computer Science, 1995.
3. M. Garey and R. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4(2):187-200, June 1975.
4. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
5. T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4):1119-1129, November 1986.
6. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6(1):1-12, October 1959.
7. U. Schwiegelshohn, W. Ludwig, J. Wolf, J. Turek, and P. Yu. Smart SMART bounds for weighted response time scheduling. Technical Report RC 19789 (87176), IBM Research Division, July 1994. also to be published in SIAM Journal on Computing.
8. U. Schwiegelshohn, J. Tttrek, and J. Wolf. Preemptive scheduling of parallel tasks. Technical Report RC 20104 (88932), IBM Research Division, June 1995.
9. W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
10. J. Turek, W. Ludwig, J. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P. Yu. Scheduling paxallelizable tasks to minimize average response time. In Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures, Cape May, NJ, pages 200-209, June 1994.
11. th SIAM Symposium on Discrete Algorithms, pages 112-121, January 1994.