首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >Solving Energy-Aware Real-Time Tasks Scheduling Problem with Shuffled Frog Leaping Algorithm on Heterogeneous Platforms
【2h】

Solving Energy-Aware Real-Time Tasks Scheduling Problem with Shuffled Frog Leaping Algorithm on Heterogeneous Platforms

机译:在异构平台上用改编的蛙跳算法解决能量敏感的实时任务调度问题

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called Shuffled Frog Leaping Algorithm (SFLA) is proposed to reduce the energy consumption. Precocity remission and local optimal avoidance techniques are proposed to avoid the precocity and improve the solution quality. Convergence acceleration significantly reduces the search time. Experimental results show that the SFLA-based energy-aware meta-heuristic uses 30% less energy than the Ant Colony Optimization (ACO) algorithm, and 60% less energy than the Genetic Algorithm (GA) algorithm. Remarkably, the running time of the SFLA-based meta-heuristic is 20 and 200 times less than ACO and GA, respectively, for finding the optimal solution.
机译:为了保持电池寿命和降低异构实时多处理器系统的总体运行成本,降低能耗变得非常重要。在本文中,我们首先将其表述为组合优化问题。然后,提出了一种成功的元启发式算法,称为随机蛙跳算法(SFLA),以减少能耗。提出了早熟缓解和局部最优避免技术,以避免早熟并提高解决方案质量。收敛加速显着减少了搜索时间。实验结果表明,基于SFLA的能量感知元启发式方法比蚁群优化(ACO)算法要少30%的能量,比遗传算法(GA)算法要少60%的能量。值得注意的是,基于SFLA的元启发式算法的运行时间分别比ACO和GA缩短了20倍和200倍,从而找到了最佳解决方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号