首页> 外文期刊>International Journal of Distributed and Parallel Systems >Heuristic Based Task Scheduling in Multiprocessor Systems with Genetic Algorithm by Choosing the Eligible Processor
【24h】

Heuristic Based Task Scheduling in Multiprocessor Systems with Genetic Algorithm by Choosing the Eligible Processor

机译:选择合格处理器的遗传算法在多处理器系统中基于启发式的任务调度

获取原文
           

摘要

In multiprocessor systems, one of the main factors of systems’ performance is task scheduling. The well the task be distributed among the processors the well be the performance. Again finding the optimal solution of scheduling the tasks into the processors is NP-complete, that is, it will take a lot of time to find the optimal solution. Many evolutionary algorithms (e.g. Genetic Algorithm, Simulated annealing) are used to reach the near optimal solution in linear time. In this paper we propose a heuristic for genetic algorithm based task scheduling in multiprocessor systems by choosing the eligible processor on educated guess. From comparison it is found that this new heuristic based GA takes less computation time to reach the suboptimal solution.
机译:在多处理器系统中,系统性能的主要因素之一是任务调度。任务在处理器之间分配得很好,性能也就很好。再次找到将任务调度到处理器中的最佳解决方案是NP完全的,也就是说,找到最佳解决方案将花费大量时间。许多进化算法(例如,遗传算法,模拟退火)用于在线性时间内达到接近最佳的解。在本文中,我们提出了一种基于遗传算法的多处理器系统中任务调度的启发式方法,方法是根据有根据的猜测选择合适的处理器。通过比较发现,这种基于启发式算法的新算法花费较少的计算时间来达到次优解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号