Computing optimal preemptive schedules for parallel tasks: Linear programming approaches

Mathematical Programming, Series B

Volumn 95, Issue 3, 2003, Pages 617-630

  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

ALGORITHMS; COMPUTATION THEORY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

MALLEABLE TASKS; OPTIMAL PREEMPTIVE SCHEDULE; PARALLEL TASKS;

SCHEDULING;

EID: 21044451992     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0361-7     Document Type: Article

References (27)

1. Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Proc. 5th European Symp. Algorithms LNCS 1284, 1-12 (1997)
2. Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor (asks, manuscript of an extended version of [I], submitted to Algorithmica, 32, 247-261 (2002)
3. Bianco, L., Blazewicz, J., Dell Olmo, P., Drozdowski, M.: Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Ann. Oper. Res. 58, 493-517 (1995)
4. Blazewicz, J., Drabowski, M., Weglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comp. C-35-5, 389-393 (1986)
5. Blazewicz, J., Drozdowski, M., Schmidt, G., de Werra, D.: Scheduling independent multiprocessor tasks on a uniform k-processor system. Parallel Comput. 20, 15-28 (1994)
6. Blazewicz, J., Drozdowski, M., de Werra, D., Weglarz, J.: Deadline scheduling of multiprocessor tasks. Dis. Appl. Math. 65, 81-96 (1996)
7. Chen, J., Miranda, A.: A polynomial time approximation scheme for general multiprocessor job scheduling. Proc. 31st ACM Sym. SIAM Journal on Computing 31, 1-17 (2001)
8. Drozdowski, M.: Scheduling multiprocessor tasks on hypercubes. Bull. Polish Acad. Sci. 42, 437-445 (1994)
9. Drozdowski, M.: On the complexity of multiprocessor task scheduling. Bull. Polish Acad. Sci. 43, 381-392 (1995)
10. Drozdowski, M.: Scheduling multiprocessor tasks - an overview. Eur. J. Oper. Res. 94, 215-230 (1996)
11. Du, J., Leung, J.: Complexity of scheduling parallel task systems. SIAM J. Dis. Math. 2, 473-487 (1989)
12. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comp. Syst. Sci. 57, 187-199 (1998)
13. Feldmann, A., Sgall, J., Teng, S.H.: Dynamic scheduling on parallel machines. Proc. 32nd IEEE Symp. Found. Theoretical Computer Science 130(1), 49-72 (1994)
14. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-CompIeteness, Freeman, San Francisco, 1979
15. Gonzales.T, Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92-101 (1978)
16. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Berlin: Springer Verlag, 1988
17. Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Dis. Appl. Math. 55, 259-272 (1994)
18. Jansen, K., Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. Proc. 10th ACM-SIAM Symp. Dis. Algorithmica 32, 507-520 (2002)
19. Kenyon, C., Remila, E.: Approximate strip packing. Proc. 37th IEEE Symp. Found. Mathematics of operations Research 25 (2000), 645-656 with modified title "A near-optional solution to a two dimensional an thing stock problem".
20. Ludwig, W., Tiwari, P.: Scheduling malleable and nonmalleable parallel tasks. Proc. 5th ACM-SIAM Symp. Dis. Algorithms 167-176 (1994)
21. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960-981 (1994)
22. Schmidt, G.: Scheduling on semi-identical processors. Zeitschrift für Operations Research 28, 153-162 (1984)
23. Schmidt, G.: Scheduling independent tasks with deadlines on semi-identical processors. J. Oper. Res. Soc. 39, 271-277 (1988)
24. Schmidt, G.: Scheduling with limited machine availability. International Computer Science Institute Technical Report TR-98-036, Berkeley, California, October 1998
25. Schwiegelshohn, U.: Preemptive weighted completion time scheduling of parallel jobs. Proc. 4th European Symp. Algorithms LNCS 1136, 39-51 (1996)
26. Steinberg, A.: A strip-packing algorithm with absolute performance bound two. SIAM J. Comput. 26, 401-409 (1997)
27. Turek, J., Wolf, J., Yu, P.: Approximate algorithms for scheduling parallelizable tasks. Proc. 4th ACM Symp. Parallel Algorithms Architec. 323-332 (1992)