摘要
在系统级综合中,资源的分配通常由设计者指定,或在设计空间搜索的最外层循环中进行枚举探索.提出了一种结合资源分配的启发式调度算法.它根据当前系统划分的结果,在调度过程中寻找合适的所需资源实例的数目,从而确定系统的资源分配以及调度指派方案.应用该调度算法可使设计空间搜索过程简化为划分、调度和评估三个步骤,省去了最外层的资源分配枚举循环,提高了搜索效率.实验结果验证了该算法的可行性和有效性.
In system-level synthesis, the allocation of resources is always decided by the designer or explored in the outer-most loop. In this paper, a heuristic scheduling algorithm is proposed to find the resource allocation during its running process. It determines the appropriate number of required resource instances based on the system partition in scheduling, and generates the corresponding resource allocation, scheduling and assignment solution. Such an algorithm can simplify the system-level design exploration to a procedure of system partitioning, scheduling and evaluation, and can improve the exploration efficiency. Experimental results show the feasibility and validity of the approach.
出处
《软件学报》
EI
CSCD
北大核心
2007年第2期220-228,共9页
Journal of Software
基金
国家自然科学基金Nos.90207017, 60236020
国家高技术研究发展计划(863)No.2003AA115110~~
关键词
任务调度
资源分配
启发式算法
设计空间搜索
系统级综合
task scheduling
resource allocation
heuristic algorithm
design space exploration
system-level synthesis
