Algorithms for scheduling malleable and nonmalleable parallel tasks

Efficient approximation algorithms for scheduling malleable tasks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures

Scheduling on hierarchical clusters using malleable tasks

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

Scheduling Parallel Applications Using Malleable Tasks on Clusters

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Approximation Algorithms for Scheduling Independent Malleable Tasks

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing

Preemptable Malleable Task Scheduling Problem

IEEE Transactions on Computers

Scheduling malleable tasks with interdependent processing rates: Comments and observations

Discrete Applied Mathematics

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time

Computers and Operations Research

Scheduling moldable BSP tasks

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures

Online optimization of busy time on parallel machines

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation