计算机工程与应用2017，Vol.53Issue(14)：65-69,75,6.DOI:10.3778/j.issn.1002-8331.1612-0350
行路由PEA广度贪心调度映射算法
Breadth greedy scheduling mapping algorithm for row routing PEA.
摘要
Abstract
Greedy mapping of hardware tasks in coarse-grained reconfigurable cell array is the key problem that reconfig-urable computing should solve. Different arrays have different hardware constraints, this paper proposes a Breadth Greedy Mapping Algorithm(BGMA)based on row routing coarse-grained reconfigurable cell array. The algorithm starts scan-ning from the first node, if the node satisfies the condition, it will be mapped to the PEA. When a node does not meet the mapping conditions, the algorithm will skip the node to continue to find nodes that meet the constraints to map. To be compared with the Breadth No Greedy Mapping Algorithm(BNGMA), on average, the N1 of BGMA decreased by 35.1%(PEA6×6)and 54.8%(PEA8×8), the N2 of BGMA decreased by 35.6%(PEA6×6)and 54.6%(PEA8×8), the CCON of BGMA decreased by 15.7%(PEA6 × 6)and 26.2%(PEA8 × 8), the TTOTAL of BGMA decreased by 20.2%(PEA6 × 6)and 32.1%(PEA8×8). Experimental evaluations confirm the importance of the greedy strategy in the mapping algorithm.关键词
贪心映射/硬件约束/行路由/广度贪心/广度不贪心Key words
greedy mapping/hardware constraint/row routing/breadth greedy/breadth no greedy分类
信息技术与安全科学引用本文复制引用
何瑞祥,陈乃金..行路由PEA广度贪心调度映射算法[J].计算机工程与应用,2017,53(14):65-69,75,6.基金项目
安徽省自然科学基金(No.1408085MF124) （No.1408085MF124）
安徽省高校省级自然科学基金重点项目(No.kj2015A003) （No.kj2015A003）
安徽工程大学国家自然科学预研基金. （）
