摘要
本文提出了一种冒险模拟退火算法。该算法将冒险计算引进模拟退火算法来处理任务映射问题。它引入任务图与费用函数的概念，不仅考虑到任务的计算时间，还考虑到任务间的通信时间。既确保了模拟退火的串行顺序，使解趋于最优，又缩短了达到最优所需时间，提高了并行计算效率。
In this paper, we present a speculative simulated annealing algorithm for taskmapping. Speculative computing is introduced into simulated annealing to solve the taskmapping problem. The concept of task graph and cost function are introduced. The algorithm not only takes computing time of a task into account, but also deals with communicating time. It maintains the serial sequence that the simulated annealing requires,and converges to a global optimum solution. And at the same time, it speeds up the solution and improves parallel computing efficiency.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1996年第3期198-204,共7页
Journal of Computer Research and Development
基金
863高科技基金
关键词
模拟退火
冒险计算
任务映射
算法
Simulated annealing, speculative computing, task mapping.
