Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme

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

Volumn 2461, Issue , 2002, Pages 562-574

  Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS; SCHEDULING;

ARBITRARY NUMBER; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; MALLEABLE TASKS; NON-PREEMPTIVE; PARALLEL PROCESSOR; PARALLEL TASK; RUNNING TIME;

POLYNOMIAL APPROXIMATION;

EID: 84938079144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_50     Document Type: Conference Paper

References (27)

1. B. Baker, E. Coffman and R. Rivest, Orthogonal packings in two dimensions, SIAM Journal on Computing, 9(1980), 846-855. 563
2. K. Belkhale and P. Banerjee, Approximate algorithms for the partitionable independent task scheduling problem, International Conference on Parallel Processing (1990), Vol. 1, 72-75. 563
3. J. Blazewicz, W. Cellary, R. Slowinski, and J. Weglarz, Scheduling under resource constraints - deterministic models, Annals of Operations Research 7 (1986). 563
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. 563, 565
5. E. Coffman, M. Garey, D. Johnson and R. Tarjan, Performance bounds for leveloriented two dimensional packing algorithms, SIAM Journal on Computing, 9 (1980), 808-826. 563, 570
6. M. Drozdowski, On the complexity of multiprocessor task scheduling, Bulletin of the Polish Academy of Sciences, 43 (1995), 381-392. 563
7. M. Drozdowski, Scheduling multiprocessor tasks - an overview, European Journal on Operations Research, 94 (1996), 215-230. 563, 565
8. J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics 2 (1989), 473-487. 563, 565
9. M.R. Garey and R. L. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing 4 (1975), 187–200. 564
10. M.R. Garey, R. L. Graham, D. S. Johnson and A.C.-C. Yao, Resource constrained scheduling as generalized bin packing, Journal Combinatorial Theory A, 21 (1976), 251-298. 563
11. M. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing 4 (1975), 397-411. 563
12. M.D. Grigoriadis, L. G. Khachiyan, L. Porkolab and J. Villavicencio, Approximate max-min resource sharing for structured concave optimization, SIAM Journal on Optimization, 11 (2001), 1081-1091. 566
13. M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, Berlin, 1988. 563
14. K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Algorithmica 32 (2002), 507-520. 563
15. K. Jansen and L. Porkolab, Computing optimal preemptive schedules for parallel tasks: Linear Programming Approaches, Proceedings 11th Annual International Symposium on Algorithms and Computation (2000), LNCS 1969, Springer Verlag, 398-409, and to appear in: Mathematical Programming. 563, 565
16. K. Jansen and L. Porkolab, On preemptive resource constrained scheduling: polynomial-time approximation schemes, Proceedings 9th International Conference on Integer Programming and Combinatorial Optimization (2002), LNCS2337, Springer Verlag, 329-349. 563, 564, 565
17. N. Karmarkar and R. M. Karp, An efficient approximation scheme for the onedimensional bin packing problem, Proceedings 23rd IEEE Symposium on Foundationsof Computer Science (1982), 312-320. 569
18. C. Kenyon and E. Remila, A near-optimal solution to a two-dimensional cuttingstock problem, Mathematics of Operations Research 25 (2000), 645-656. 563,564, 568, 569, 570
19. B. Korte and J. Vygen, Combinatorial optimization: Theory and Algorithms, Springer Verlag, Berlin, 2000. 569
20. E. Lawler, Fast approximation algorithms for knapsack problems, Mathematics of Operations Research, 4 (1979), 339-356. 566, 570
21. J.K. Lenstra, D. B. Shmoys and E. Tardos, Approximation algorithms forscheduling unrelated parallel machines, Mathematical Programming, 24 (1990), 259-272. 568
22. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proceedings 5th ACM-SIAM Symposium on Discrete Algorithms (1994), 167-176. 563, 564
23. G. Mounie, C. Rapine and D. Trystram, Efficient approximation algorithms forscheduling malleable tasks, Proceedings 11th ACM Symposium on Parallel Algorithmsand Architectures (1999), 23-32. 564
24. S.A. Plotkin, D. B. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operations Research,20 (1995), 257-301. 566, 569
25. I. Schiermeyer, Reverse-Fit: A 2-optimal algorithm for packing rectangles, Proceedings 2nd European Symposium of Algorithms (1994), LNCS 855, 290-299. 563, 564
26. A. Steinberg, A strip-packing algorithm with absolute performance bound two, SIAM Journal on Computing, 26 (1997), 401-409. 563, 564 574
27. J. Turek, J.Wolf and P. Yu, Approximate algorithms for scheduling parallelizable tasks, Proceedings 4th ACM Symposium on Parallel Algorithms and Architectures(1992), 323-332. 563, 570