Preemptive parallel task scheduling in o(N) + poly(m) time

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

Volumn 1969, Issue , 2000, Pages 298-409

  Jansen, Klaus ^a   Porkolab, Lorant ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; SCHEDULING;

LINEAR PROGRAMMING FORMULATION; MALLEABLE TASKS; MAXIMUM LATENESS; MINIMUM MAKESPAN; OPTIMAL PREEMPTIVE SCHEDULE; PARALLEL TASK; PROCESSING TIME; SCHEDULING PROBLEM;

PARALLEL PROCESSING SYSTEMS;

EID: 84949805758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_34     Document Type: Conference Paper

References (23)

1. A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th European Symposium on Algorithms (1997), LNCS 1284, 1-12.
2. A.K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, manuscript of an extended version of [1], submitted to Algorithmica, 1998.
3. L. Bianco, J. Blazewicz, P. Dell Olmo and M. Drozdowski, Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors, Annals of Operations Research 58 (1995), 493-517.
4. J. Blazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, C-35-5 (1986), 389-393.
5. J. Blazewicz, M. Drozdowski, D. de Werra and J. Weglarz, Deadline scheduling of multiprocessor tasks, Discrete Applied Mathematics 65 (1996), 81-96.
6. J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st ACM Symposium on the Theory of Computing (1999), 418-427.
7. M. Drozdowski, On the complexity of multiprocessor task scheduling, Bulletin of the Polish Academy of Sciences, 43 (1995), 381-392.
8. M. Drozdowski, Scheduling multiprocessor tasks - an overview, European Journal on Operations Research, 94 (1996), 215-230.
9. J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics, 2 (1989), 473-487.
10. U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57 (1998), 187-199.
11. A. Feldmann, J. Sgall and S.H. Teng, Dynamic scheduling on parallel machines, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (1991), 111-120.
12. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, 1988.
13. J.A. Hoogeveen, S.L. van de Velde and B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics 55 (1994), 259-272.
14. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (1999), 490-498.
15. K. Jansen and L. Porkolab, Preemptive scheduling on dedicated processors: applications of fractional graph coloring, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, Springer Verlag.
16. C. Kenyon and E. Remila, Approximate strip packing, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (1996), 31-36.
17. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (1994), 167-176.
18. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of ACM, 41 (1994), 960-981.
19. G. Schmidt, Scheduling on semi-identical processors, Zeitschrift f¨ur Oper. Res. 28 (1984), 153-162.
20. G. Schmidt, Scheduling with limited machine availability, International Computer Science Institute Technical Report TR-98-036, Berkeley, California, October 1998.
21. U. Schwiegelshohn, Preemptive weighted completion time scheduling of parallel jobs, Proceedings of the 4th European Symposium of Algorithms (1996), LNCS 1136, 39-51.
22. A. Steinberg, A strip-packing algorithm with absolute performance bound two, SIAM Journal on Computing 26 (1997), 401-409.
23. J. Turek, J. Wolf and P. Yu, Approximate algorithms for scheduling parallelizable tasks, Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures (1992), 323-332.