• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Information Technology and Computer Science >A Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System
【24h】

A Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System

机译：一种解决分布式处理器系统任务分配问题的改进并行启发式图匹配方法

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Task assignment is one of the most fundamental combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. In this paper a Heuristic and Parallel Algorithm for Task Assignment Problem is proposed. Results obtained for certain cases are presented and compared with the optimal solutions obtained by already available algorithms. It is observed that the proposed algorithm works much faster and efficient than the existing algorithms .The paper also demonstrates how the proposed algorithm could be extended to multiple distributed processors.
机译：任务分配是最基本的组合优化问题之一。解决任务分配问题对于许多实时和计算场景非常重要，在这些场景中，许多小型任务需要同时由多个处理器解决。本文提出了一种启发式并行任务分配算法。介绍了某些情况下获得的结果，并将其与通过现有算法获得的最佳解决方案进行比较。可以看出，该算法比现有算法具有更快，更有效的工作效果。本文还论证了该算法可以扩展到多个分布式处理器。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号