Emergent Mind
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
(1811.11595)
Published Nov 28, 2018
in
cs.DS
Abstract
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor approximation algorithms for the non-migratory cases when all jobs have a common release time and/or a common deadline.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.