首页> 外文会议>2017 Internet Technologies and Applications >Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming
【24h】

Scaling analysis of solving algorithms for canonical problem of dispatching in the context of dynamic programming

机译:动态规划环境下典型调度问题求解算法的尺度分析

获取原文
获取原文并翻译 | 示例

摘要

The paper analyses computational model based on dynamic programming for platforms with multicore processors and heterogeneous architectures with FPGA. The models are applied for solving a canonical problem of dispatching where the computation time significantly depends on the problem scale factor. The parallel algorithms of NP-hard problem of dispatching are complicate and require intensive RAM data exchange. In order to reduce the computation time, it is suggested to use FPGA as a coprocessor providing massively parallel computation and increase the operational performance of the system in one order.
机译:本文针对多核处理器平台和FPGA异构架构的平台,基于动态编程分析了计算模型。该模型用于解决典型的调度问题,其中计算时间在很大程度上取决于问题的比例因子。 NP难题的并行算法复杂,需要大量的RAM数据交换。为了减少计算时间,建议使用FPGA作为协处理器,提供大规模并行计算并以一个顺序提高系统的操作性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号