A general constraint-centric scheduling framework for spatial architectures
A general constraint-centric scheduling framework for spatial architectures
复制标题
空间架构的通用以约束为中心的调度框架
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Behnam Robatmili
中科院分区：
文献类型：
--
作者：
Tony Nowatzki;Michael Sartin;Lorenzo De Carli;Karthikeyan Sankaralingam;Cristian Estan;Behnam Robatmili
使用空间架构的专门执行提供能量高效的计算，但需要有效的算法来空间调度计算。一般来说，这已经解决了与架构特定的编译器，一种方法，遭受穷人的编译器/架构师的生产力，缺乏洞察力的最优性，并抑制架构之间的技术迁移。我们的目标是开发一个可用于所有空间架构的调度框架。为此，我们表示空间调度作为一个约束满足问题，使用线性规划（ILP）。我们观察到，架构原语和调度器的责任可以通过五个抽象：放置计算，路由数据，管理事件的时间，管理资源利用率，并形成优化目标。我们将这些责任编码为20个一般ILP约束，用于为不同的TRIPS，DySER和PLUG架构创建标记。我们的研究结果表明，使用ILP的一般声明性方法是可实现的，实用的，通常匹配或优于专门的编译器。
Specialized execution using spatial architectures provides energy efficient computation, but requires effective algorithms for spatially scheduling the computation. Generally, this has been solved with architecture-specific heuristics, an approach which suffers from poor compiler/architect productivity, lack of insight on optimality, and inhibits migration of techniques between architectures. Our goal is to develop a scheduling framework usable for all spatial architectures. To this end, we expresses spatial scheduling as a constraint satisfaction problem using Integer Linear Programming (ILP). We observe that architecture primitives and scheduler responsibilities can be related through five abstractions: placement of computation, routing of data, managing event timing, managing resource utilization, and forming the optimization objectives. We encode these responsibilities as 20 general ILP constraints, which are used to create schedulers for the disparate TRIPS, DySER, and PLUG architectures. Our results show that a general declarative approach using ILP is implementable, practical, and typically matches or outperforms specialized schedulers.