IEEE Transactions on Parallel and Distributed Systems
Design issues for dynamic voltage scaling
ISLPED '00 Proceedings of the 2000 international symposium on Low power electronics and design
Task scheduling and voltage selection for energy minimization
Proceedings of the 39th annual Design Automation Conference
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Fast and Effective Task Scheduling in Heterogeneous Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A Scalable Task Duplication Based Scheduling Algorithm for Heterogeneous Systems
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Benchmarking the Task Graph Scheduling Algorithms
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
A Cluster-based Strategy for Scheduling Task on Heterogeneous Processors
SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
Journal of Parallel and Distributed Computing
Parallel Computing - Heterogeneous computing
Journal of Parallel and Distributed Computing
A dominant predecessor duplication scheduling algorithm for heterogeneous systems
The Journal of Supercomputing
Speed Scaling of Tasks with Precedence Constraints
Theory of Computing Systems
A Low-Complexity Task Scheduling Algorithm for Heterogeneous Computing Systems
AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
NP-complete scheduling problems
Journal of Computer and System Sciences
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Energy aware DAG scheduling on heterogeneous systems
Cluster Computing
Energy Conscious Scheduling for Distributed Computing Systems under Different Operating Conditions
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Efficient application scheduling is critical for achieving high performance in heterogeneous computing (HC) environments. Because of its importance, there are many researches on this problem and various algorithms have been proposed. Duplication-based algorithm is a kind of famous algorithm to solve scheduling problem, which achieve high performance on minimizing the overall completion time(makespan) of applications. However, they do not consider energy consumption. With the growing advocacy for green computing system, energy conservation has been an important issue and gained a particular interest. An existing technique to reduce energy consumption of application is dynamic voltage/frequcny scaling(DVFS), but its efficiency is affected by the overhead of time and energy caused by voltage scaling. In this paper, we propose a new energy-aware scheduling algorithm called Energy Aware Scheduling by Minimizing Duplication(EAMD), which considers the energy consumption as well as the makespan of applications. It adopts a subtle energy-aware method to determine and delete the abundant task copies in the schedules generated by duplication-based algorithms, which is easier to operate than DVFS and produces no extra time and energy consumption. This algorithm can reduce large amount of energy consumption while having the same makespan compared with duplication-based algorithms without energy awareness. Randomly generated DAGs are tested in our experiments. Experimental results show that EAMD can save up to 15.59% energy consumption for the existed duplication-based algorithms. Several factors affecting the performance are analyzed in the paper, too.