arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.11129cs.AR
收藏

基于泛连通性的CGRA映射的线性规划方法

Generic Connectivity-Based CGRA Mapping via Integer Linear Programming

Matthew J. P. Walker, Jason H. Anderson

摘要:

粗粒度可重构体系结构(CGRA)是具有大型粗粒度可重构逻辑块和多位数据路径式布线的可编程逻辑器件。CGRA通常具有相对受限的数据路由网络,因此它们吸引了使用精确方法的CAD映射工具,例如线性规划(ILP)。然而,针对通用架构的工具必须使用大型约束系统来充分描述架构的灵活性,从而导致冗长的运行时间。在本文中,我们建议从一个通用的设备模型中获得连接信息,并使用它来创建更简单的ILP,我们结合在一个迭代的时间表,并保留大部分的完全通用的ILP方法的准确性。这种新方法的加速几何平均值为5.88倍,考虑到基准测试在完全通用的ILP上没有达到7.5小时的时间限制,否则为37.6倍。这是使用一组基准测试来测量的,这些基准测试最初用于评估完全通用的方法,还有几个基准测试代表了三种不同的CGRA架构上的计算任务。新方法的所有运行时间都小于20分钟,90%时间为410秒。建议的映射技术集成到,并使用开源CGRA-ME架构建模和探索框架进行评估。

英文摘要:

Coarse-grained reconfigurable architectures (CGRAs) are programmable logic devices with large coarse-grained ALU-like logic blocks, and multi-bit datapath-style routing. CGRAs often have relatively restricted data routing networks, so they attract CAD mapping tools that use exact methods, such as Integer Linear Programming (ILP). However, tools that target general architectures must use large constraint systems to fully describe an architecture's flexibility, resulting in lengthy run-times. In this paper, we propose to derive connectivity information from an otherwise generic device model, and use this to create simpler ILPs, which we combine in an iterative schedule and retain most of the exactness of a fully-generic ILP approach. This new approach has a speed-up geometric mean of 5.88x when considering benchmarks that do not hit a time-limit of 7.5 hours on the fully-generic ILP, and 37.6x otherwise. This was measured using the set of benchmarks used to originally evaluate the fully-generic approach and several more benchmarks representing computation tasks, over three different CGRA architectures. All run-times of the new approach are less than 20 minutes, with 90th percentile time of 410 seconds. The proposed mapping techniques are integrated into, and evaluated using the open-source CGRA-ME architecture modelling and exploration framework.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑