基于簇的层次敏感的可重构系统任务划分算法.pdfVIP

第 18 卷第 5 期 计算机辅助设计与朋形学学报 Vo1.1 8, No.5 2006 年 5 月 JOURNAL OF COMPUTER-AIDED DESIGN COMPU丁ER GRAPHICS 如f串 y ， 2006 基于簇的层次敏感的可嚣构系统任务划分算法 m 峨附如川邱叩，算呻V 东咐山川对应优勇叫咱将时门 似酌布减但却靡则 用啤伽 占 日 学@lrf W 幽胁咱川 上 海 句、 -d w 川 l 擒 察 对于可囊构计算中部积的柬条件下的任务划分问题，提出…种基于簇的、黯次敏感的划分 LSCBP 算法.该 算法按照依赖优先、最早最先和碎片利用三原则构造了新的启发扇数 AS ..Level ， 能够跟踪节点分配过程并进行动态 调猿;它克服了 CBP 算法机械选取节点进行为!分的缺点，同时算法衷杂度也增大到 oIIVI 2 +IEII. 对随机古龙成的 佼务翻(节点数小子 250) 的是ù 分实验表明:对于相岗的 DAG ， LSCBP 算法能够比 CBP 算法获得更少的任务簇(?iJ重 构资源需求最)和簇间有 I句边(通信代价) . 关键贺喜 可主运构系统;辛苦肉觉环凶:留划分:任务簇; FPGA 中阁法分类哥哥 丁P316 A Level Sensitive Cluster Based Partitioning Algorithms for Reconfi事urable Systems Zhou Bo Qìu Weidong ChenY onghui Peng Chenglian (Deμ rtment 01 白mputer and InfQr刷刷 ion Tech 削logy ， Fudan University , Shanghai 200433) Abstract This paper presents a DAG (directed 在cyclíc graph) p在rtitíoning algorithm for reconfigurable computing, called LSCBP (Level Sensitive cluster based Partitioning) algorithm , which partítions th贮 whole task graph into small segments and keep task precedence relations under area constraints. The proposed heuristic function AS_Level can denote allocation priorities of the ready lìst and will be adjusted during the partitioning proce贮es邸s. The h 巳m阳ur川r川is悦ti比c func盯tion 沁i scωI川lstruct 日仪叫d with the 仪 ui川d巳eline of de叩pe创nde创n口m贮 fi让rs创t time 白f irst 缸an时d ‘‘fr阳agmηle创仙川n1t 陀reu盼se旷♂. The proposed algorithm can overcome the drawback of CBP algorithm and its time complexity increases to 011 V 1 2 十 1 E 11. For the same DAGs , the experimental results on random 日AGs show that LSCBP algorithm can get less tas