摘要
为了提高可重构任务调度效率以及改善可重构计算系统性能,有效地管理可重构资源并为可重构任务选择合适的放置位置是其中的关键部分。对此,提出一种基于资源矩阵的相邻边可重构任务放置算法,通过一定的编码法则构建相应的矩阵方便于可重构资源的管理,同时引入任务的相邻边数作为选择合适放置位置的关键指标,使任务放置紧凑,减少资源碎片。仿真实验表明,与已有的算法相比,本算法具有更低的任务拒绝率。
In order to improve the efficiency of reconfigurable task scheduling and the performance of reconfigurable computing systems,the key part is how to manage the reconfigurable resource effectively and how to choose the right location as well.It has a great influence on the reconfigurable computing system performance. This paper presented a reconfigurable task placement algorithm which based on adjacent edges of resource matrix,that was to say,the new algorithm introduced certain coding rule to construct the corresponding matrix with the purpose of making the reconfigurable resource management easier,and brought in the number of edges of adjacent tasks as appropriate key indicators simultaneously,with a view to reducing the fragmentation and made the task of placing compact. Compared to the existing algorithm,the results of simulation show that,the new algorithm is a much more effective algorithm.
出处
《计算机应用研究》
CSCD
北大核心
2014年第8期2342-2345,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61075028)
江苏省"六大人才高峰"高层次人才项目
关键词
可重构系统
任务放置
资源管理
相邻边
reconfigurable system
task placement
resource management
adjacent edges
