SALSA: a new approach to scheduling with timing constraints
SALSA: a new approach to scheduling with timing constraints
复制标题
SALSA：一种具有时间限制的调度新方法
DOI：
--
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
Ganesh Krishnamoorthy
中科院分区：
文献类型：
--
作者：
J. Nestor;Ganesh Krishnamoorthy
首先，使用基于布局压缩的算法生成满足所有时间约束的初始调度。然后使用模拟退火来改进该调度的资源使用情况。SALSA在支持时间约束、条件、循环和子例程的同时，提供了对可选调度的有效探索。详细描述了SALSA调度程序。该方法的实现显示了令人满意的结果
First, an initial schedule that satisfies all timing constraints is generated using algorithms adapted from layout compaction. This schedule is then improved with respect to resource usage using simulated annealing. SALSA provides for efficient exploration of alternative schedules while supporting timing constraints, conditionals, loops, and subroutines. The SALSA scheduling procedure is described in detail. An implementation of the approach shows promising results.<<ETX>>