首页> 外文期刊>Moscow University Computational Mathematics and Cybernetics >Estimating the Convergence of a Simulated Annealing Algorithm for the Problem of Constructing Multiprocessor Schedules
【24h】

Estimating the Convergence of a Simulated Annealing Algorithm for the Problem of Constructing Multiprocessor Schedules

机译:估计构造多处理器调度问题的模拟退火算法的收敛性

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

摘要

An algorithm for constructing a computational system with the minimum number of processors while observing restrictions on system reliability and program execution time is considered. The problem is formulated mathematically, and an algorithm based on simulated annealing is proposed. Asymptotic convergence of the algorithm is formally proved.
机译:考虑一种用于构建具有最少处理器数量的计算系统,同时遵守对系统可靠性和程序执行时间的限制的算法。用数学方法解决该问题,并提出了一种基于模拟退火的算法。正式证明了该算法的渐近收敛性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号