Hierarchical scheduling for moldable tasks

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 302-311

  Dutot, Pierre François ^a  

^a APACHE Lab ID   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HIERARCHICAL SYSTEMS; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING; SUPERCOMPUTERS;

APPROXIMATION ALGORITHMS; HIERARCHICAL SCHEDULING; MOLDABLE TASK (MT); MULTI-PROCESSORS;

PARALLEL PROCESSING SYSTEMS;

EID: 27144547779     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_35     Document Type: Conference Paper

References (8)

1. Dutot, P.F., Trystram, D.: Scheduling on hierarchical clusters using malleable tasks. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, ACM Press (2001) 199-208
2. Du, J., Leung, J.T.: Complexity of scheduling parallel tasks systems. SIAM Journal on Discrete Mathematics 2 (1989) 473-487
3. Lepere, R., Trystram, D., Woeginger, G.: Approximation algorithms for scheduling malleable tasks under precedence constraints. In Springer-Verlag, ed.: 9th Annual European Symposium on Algorithms - ESA 2001. Number 2161 in LNCS (2001) 146-157
4. Zhang, H.: Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling. PhD thesis, University of Kiel, Germany (2004)
5. Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. In: 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas (2005)
6. Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints (2005) submitted.
7. Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23 (1998) 909-929
8. Dutot, P.F.: Hierarchical scheduling for moldable tasks - extended version. Technical report, Laboratory ID-IMAG (2005) www-id.imag.fr/~pfdutot/perso.html.