Journal
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
Volume 31, Issue 20, Pages -Publisher
WILEY
DOI: 10.1002/cpe.5327
Keywords
batch-of-stochastic-tasks; dynamic voltage and frequency scaling; HypE; Pareto optimality; quantum computing; stochastic scheduling
Funding
- University Grants Commission [F. 30/377/2017 (BSR), 8123]
Ask authors/readers for more resources
Scheduling on dynamic voltage and frequency scaling enabled processors to determine the Pareto-optimal solutions with optimized makespan and energy consumption demands faster multi-objective scheduling algorithms. In general, the problem of multi-objective optimization, ie, finding the Pareto-optimal solutions to optimize two or more QoS parameters, has been proven to be an NP-complete problem. In this work, we propose a novel energy-efficient quantum-inspired stochastic Q-HypE algorithm to schedule the batch-of-stochastic-tasks (BoT) on DVFS-enabled processors with the aim to optimize the makespan of BoT as well as the energy consumption of processors. The stochastic processing times of tasks are drawn from independent probability distributions. The proposed Q-HypE algorithm evolves from combined characteristics of quantum computing and a hypervolume based multi-objective optimization HypE algorithm. The proposed Q-HypE algorithm simultaneously minimizes the makespan and energy consumption of the Pareto-optimal solutions whereas the dynamics of quantum computing accelerate the process of HypE to further minimize the overheads of hypervolume estimation. Experimental results reveal the effectiveness of the proposed Q-HypE algorithm both in terms of the number and quality of solutions offered.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available