Linear-time approximation schemes for scheduling malleable parallel tasks

Algorithmica (New York)

Volumn 32, Issue 3, 2002, Pages 507-520

  Jansen, K ^a   Porkolab, L ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Approximation algorithms; Linear programming; Scheduling

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; PROGRAM PROCESSORS; SCHEDULING; SET THEORY;

PARALLEL TASKS;

LINEAR PROGRAMMING;

EID: 0012533991     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0085-8     Document Type: Article

References (19)

1. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proc. 5th European Symposium on Algorithms (1997), LNCS 1284, pp. 1-12.
2. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Private communication.
3. B. Baker, E. Coffman, and R. Rivest, Orthogonal packings in two dimensions, SIAM Journal on Computing 9 (1980), 846-855.
4. K. Belkhale and P. Banerjee, Approximate algorithms for the partitionable independent task scheduling problem, Proc. International Conference on Parallel Processing (1990), Vol. 1, pp. 72-75.
5. J. Blazewicz, W. Cellary, R. Slowinski, and J. Weglarz, Scheduling Under Resource Constraints -Deterministic Models, Annals of Operations Research, Vol. 7 (1986).
6. E. Coffman, M. Garey, D. S. Johnson, and R. Tarjan, Performance bounds for level-oriented two-dimensional packing problems, SIAM Journal on Computing 9 (1980), 808-826.
7. J. Du and J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Discrete Mathematics 2 (1989), 473-487.
8. A. Feldmann, M.-Y. Kao, J. Sgall, and S. H. Teng, Optimal online scheduling of parallel jobs with dependencies, Proc. 25th ACM Symposium on the Theory of Computing (1993), pp. 642-651.
9. A. Feldmann, J. Sgall, and S. H. Teng, Dynamic scheduling on parallel machines, Proc. 32nd IEEE Symposium on Foundations of Computer Science (1991), pp. 111-120.
10. M. Garey and R. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing 4 (1975), 187-200.
11. M. Garey and D. S. Johnson, Complexity results for multiprocessor scheduling under resource constraints, SIAM Journal on Computing 4 (1975), 397-411.
12. M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research 21 (1996), 321-340.
13. C. Kenyon and E. Remila, Approximate strip packing, Proc. 37th IEEE Symposium on Foundations of Computer Science (1996), pp. 31-36.
14. Y. Kopidakis, Approximabilite des Problemes d'Ordonnancement dans les Systemes Paralleles, These de Doctorat, Universite de Paris-Sud (1997).
15. Y. Kopidakis and V. Zissimopoulos, An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension, Theoretical Computer Science 178 (1997), 265-273.
16. W. Ludwig and P. Tiwari, Scheduling malleable and nonmalleable parallel tasks, Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (1994), pp. 167-176.
17. 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.
18. A. Steinberg, A strip packing algorithm with absolute performance bound 2, SIAM Journal on Computing 26 (1997), 401-409.
19. J. Turek, J. Wolf, and P. Yu, Approximate algorithms for scheduling parallelizable tasks, Proc. 4th ACM Symposium on Parallel Algorithms and Architectures (1992), pp. 323-332.