DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis
Open Access
- 15 March 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (3) , 628-641
Abstract
A central task in high-level synthesis is scheduling : the allocation of operations to clock cycles. The classic approach to scheduling is static , in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence of dynamic scheduling, in which an operation’s clock cycle is only determined at runtime. Both approaches have their merits: static scheduling (SS) can lead to simpler circuitry and more resource sharing, while dynamic scheduling (DS) can lead to faster hardware when the computation has nontrivial control flow. In this work, we seek a scheduling approach that combines the best of both worlds. Our idea is to identify the parts of the input program, where DS does not bring any performance advantage and to use SS on those parts. These statically scheduled parts are then treated as black boxes when creating a dataflow circuit for the remainder of the program, which can benefit from the flexibility of DS. An empirical evaluation on a range of applications suggests that by using this approach, we can obtain 74% of the area savings that would be made by switching from DS to SS, and 135% of the performance benefits that would be made by switching from SS to DS.Keywords
Funding Information
- Engineering and Physical Sciences Research Council (EP/P010040/1, EP/R006865/1)
- Royal Academy of Engineering
- Imagination Technologies
- Google Ph.D. Fellowship in Systems and Networking
This publication has 24 references indexed in Scilit:
- ElasticFlow: A complexity-effective approach for pipelining irregular loop nests2015
- From Latency-Insensitive Design to Communication-Based System-Level DesignProceedings of the IEEE, 2015
- Offline Synthesis of Online Dependence Testing: Parametric Loop Pipelining for HLS2015
- High-level synthesis of memory bound and irregular parallel applications with Bambu2014
- SDC-based modulo scheduling for pipeline synthesis2013
- Runtime dependency analysis for loop pipelining in high-level synthesis2013
- Throughput Analysis of Synchronous Data Flow Graphs2006
- An efficient and versatile scheduling algorithm based on SDC formulation2006
- Theory of latency-insensitive designIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2001
- The CORDIC algorithm: new results for fast VLSI implementationIEEE Transactions on Computers, 1993