Combining performance and priority for scheduling resizable parallel applications
We describe a job scheduler that exploits malleable parallel applications. Processor allocations are based on job performance and on cluster workload. We present scheduling scenarios and algorithms that exploit malleability. Potential benefits when only some jobs are malleable and when job priority varies are studied.
dynamic resizing parallel job scheduling scheduling policies malleable parallel jobs