Tightness results for malleable task scheduling algorithms

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

Volumn 4967 LNCS, Issue , 2008, Pages 1059-1067

  Schwarz, Ulrich M ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; MICROFLUIDICS; NONLINEAR PROGRAMMING; PARALLEL ALGORITHMS; PARALLEL PROGRAMMING; POLYNOMIAL APPROXIMATION; SCHEDULING; STATISTICS;

(SPM) CLASSES; APPLIED MATHEMATICS; GENERAL (CO); HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MALLEABLE TASKS; PARALLEL PROCESSING; PRECEDENCE CONSTRAINTS; SERIES-PARALLEL GRAPHS; SPRINGER (CO); SUBLINEAR; TASK-SCHEDULING ALGORITHMS; UPPER BOUNDS;

SCHEDULING ALGORITHMS;

EID: 45449097653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_112     Document Type: Conference Paper

References (14)

1. Lepère, R., Trystram, D., Woeginger, G.J.: Approximation algorithms for scheduling malleable tasks under precedence constraints. Int. J. Found. Comput. Sci. 13(4), 613-627 (2002)
2. Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 236-245. Springer, Heidelberg (2005)
3. Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Technical Report 514/1996, Technische Universität Berlin (1996)
4. Du, J., Leung, J.Y.T.: Complexity of scheduling parallel task systems. SIAM J. Disc. Math. 2(4), 473-487 (1989)
5. Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms scheduling parallelizable tasks. In: Proceedings of SPAA 1992, pp. 323-332 (1992)
6. Mounie, G., Rapine, C., Trystram, D.: A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks. SIAM J. Comp. 37(2), 401-412 (2007)
7. Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica 39(1), 59-81 (2004)
8. Dutot, P.F.: Hierarchical scheduling for moldable tasks. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 302-311. Springer, Heidelberg (2005)
9. Leung, J.Y.T. (ed.): Handbook of Scheduling. CRC Press, Boca Raton (2004)
10. Gonzalez, T.F. (ed.): Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC, Boca Raton (2007)
11. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979)
12. Grigoriev, A., Woeginger, G.J.: Project scheduling with irregular costs: complexity, approximability, and algorithms. Acta Informatica 41(2-3), 83-97 (2004)
13. Schwarz, U.M.: Design and analysis of approximation algorithms for certain scheduling problems. Diploma thesis, University of Kiel (2006)
14. Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell Systems Tech. J. 45, 1563-1581 (1966)