Scheduling on hierarchical clusters using malleable tasks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 199-208

  Dutot, P F ^a   Trystram, D ^a  

^a CNRS GRAVIR INRIA   (France)

Author keywords

Cluster computing; Fully polynomial time approximation scheme; Malleable tasks; Scheduling

Indexed keywords

ALGORITHMS; HIERARCHICAL SYSTEMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING; SUPERCOMPUTERS;

HIERARCHICAL CLUSTERS;

MULTIPROCESSING PROGRAMS;

EID: 0034832390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378640     Document Type: Conference Paper

References (19)

1. Orthogonal packings in two dimensions
2. Dynamic load balancing for ocean circulation model with adaptive meshing
3. Scheduling on networks of workstations
4. Performance bounds for level-oriented two-dimensional packing algorithms
5. Parallel real root isolation using the Descartes method
6. Theory and practice in parallel job schedulin
7. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
8. Linear time approximation schemes for scheduling problems
9. Efficient approximation algorithm for scheduling malleable tasks
10. UET scheduling with unit interprocessor communication delays
11. A strip-packing algorithm with absolute performance bound 2
12. Beowulf: A parallel workstation for scientific computation
13. Approximate algorithms for scheduling parallelizable tasks