scholarly journals Energy-aware strategies for reliability-oriented real-time task allocation on heterogeneous platforms

Author(s):  
Li Han ◽  
Yiqin Gao ◽  
Jing Liu ◽  
Yves Robert ◽  
Frédéric Vivien
IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 75110-75123 ◽  
Author(s):  
Haider Ali ◽  
Umair Ullah Tariq ◽  
Yongjun Zheng ◽  
Xiaojun Zhai ◽  
Lu Liu

2018 ◽  
Vol 15 (1) ◽  
pp. 172988141875584 ◽  
Author(s):  
Bing Xie ◽  
Shaofei Chen ◽  
Jing Chen ◽  
LinCheng Shen

This article presents a novel market-based mechanism for a dynamic coalition formation problem backgrounded under real-time task allocation. Specifically, we first analyze the main factors of the real-time task allocation problem, and formulate the problem based on the coalition game theory. Then, we employ a social network for communication among distributed agents in this problem, and propose a negotiation mechanism for agents forming coalitions on timely emerging tasks. In this mechanism, we utilize an auction algorithm for real-time agent assignment on coalitions, and then design a mutual-selecting method to acquire better performance on agent utilization rate and task completion rate. And finally, our experimental results demonstrate that our market-based mechanism has a comparable performance in task completion rate to a decentralized approach (within 25% better on average) and a centralized dynamic coalition formation method (within 10% less on average performance).


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weizhe Zhang ◽  
Hucheng Xie ◽  
Boran Cao ◽  
Albert M. K. Cheng

Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.


2016 ◽  
Vol 65 (4) ◽  
pp. 1297-1309 ◽  
Author(s):  
Ting-Hao Tsai ◽  
Lin-Fong Fan ◽  
Ya-Shu Chen ◽  
Tien-Shun Yao
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document