首页> 外国专利> Programming model for transparent parallelization of combinatorial optimization

Programming model for transparent parallelization of combinatorial optimization

机译:组合优化的透明并行化编程模型

摘要

Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.
机译:多个子任务中的每个子任务都配置为通过表示的可重入有限状态机来探索和评估组合优化问题的替代解决方案。多个线程中的每一个被配置为执行包括子任务的操作,直到达到完成或阻止状态为止,并且在达到阻止状态的情况下,继续执行当前未处于阻止状态的另一子任务。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号