Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Algorithms for scheduling malleable and nonmalleable parallel tasks
Algorithms for scheduling malleable and nonmalleable parallel tasks
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
Parallel Job Scheduling: Issues and Approaches
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Online scheduling of malleable parallel jobs
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Online malleable job scheduling for m≤3
Information Processing Letters
Computers and Operations Research
Fast approximation algorithms for scheduling independent multiprocessor tasks
Proceedings of the 19th High Performance Computing Symposia
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
Energy efficient frequency scaling and scheduling for malleable tasks
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 14.98 |
The problem of optimal scheduling n independent malleable tasks in a parallel processor system is studied. It is assumed that an execution of any task can be preempted and the number of processors allocated to the same task can change during its execution. We present a rectangle packing algorithm, which converts an optimal solution for the relaxed problem, in which the number of processors allocated to a task is not required to be integer, into an optimal solution for the original problem in O(n) time.