A General Constraint-centric Scheduling Framework for Spatial Architectures

作者：Nowatzki Tony^*; Sartin Tarm Michael; De Carli Lorenzo; Sankaralingam Karthikeyan; Estan Cristian; Robatmili Behnam

来源：ACM Sigplan Notices, 2013, 48(6): 495-506.

DOI：10.1145/2499370.2462163

• Spatial Architectures
• Spatial Architecture Scheduling
• Integer Linear Programming

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.

• 出版日期2013-6