摘要
可重构资源的管理是影响动态可重构系统性能的关键因素之一.本文提出了一种保持任务顶点信息的布局算法KTVP,并将其扩展为KTVS调度算法.KTVP/KTVS算法根据已接收硬件任务的顶点信息安排新到达的硬件任务,可通过对系统资源的编码迅速验证布局/调度的可行性,能有效减少系统资源浪费,提高系统内在的并行度.仿真实验表明,与已有算法相比,KTVP/KTVS算法具有更低的任务拒绝率和更小的运行开销.
The management of reconfigurable resource is one of the most critical factors concerned deeply with the performance of dynamic reconfigurable systems, This paper presents two associated algorithms, KTVP （Keeping Tasks Vertexes for Placement） and KTVS （Keeping Tasks Vertexes for Scheduling）, to maximize the system utilization. These two algorithms arrange the new-coming hardware tasks according to the vertexes＇ information of the already running tasks. By exploiting a novel encoding scheme, they can validate the feasibility of the scheduling/placement in a fast way, so as to effectively reduce the waste of resource and improve the parallelism of the whole system. The simulation results show that, compared with existent algorithms, KTVP/KTVS can achieve lower task rejection ratio and reduce the execution overhead significantly.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2006年第11期2094-2098,共5页
Acta Electronica Sinica
基金
国家自然科学基金(No.60273042)
中国科学院创新基金
安徽省自然科学基金(No.03042203)
关键词
动态可重构
布局
调度
任务顶点
dynamic reconfiguration
placement
scheduling
task vertexes
