Force-directed scheduling in automatic data path synthesis
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Self-timed rings and their application to division
Self-timed rings and their application to division
Synthesis and Optimization of Digital Circuits
Synthesis and Optimization of Digital Circuits
An Efficient List-Based Scheduling Algorithm for High-Level Synthesis
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
DSD '04 Proceedings of the Digital System Design, EUROMICRO Systems
Spatial computation
High-level Synthesis for Highly Concurrent Hardware Systems
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Behavioral Synthesis Frontend to the Haste/TiDE Design Flow
ASYNC '09 Proceedings of the 2009 15th IEEE Symposium on Asynchronous Circuits and Systems (async 2009)
A Fast Branch-and-Bound Approach to High-Level Synthesis of Asynchronous Systems
ASYNC '10 Proceedings of the 2010 IEEE Symposium on Asynchronous Circuits and Systems
An energy and power-aware approach to high-level synthesis of asynchronous systems
Proceedings of the International Conference on Computer-Aided Design
Faster maximum and minimum mean cycle algorithms for system-performance analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
This paper introduces the first exact method for optimal resource sharing in a pipelined system in order to minimize area. Given as input a dependence graph and a throughput requirement, our approach searches through the space of legal resource allocations, performing both scheduling and optimal buffer insertion, in order to produce the minimum area implementation. Furthermore, we do not arbitrarily limit the number of concurrent threads or data tokens; instead, we explore the full space of legal token counts, effectively allowing the depth of pipelining to be determined by our algorithm, while concurrently minimizing area and meeting performance constraints. Our approach has been automated, and compared with an existing single-token scheduling approach. Experiments using a set of benchmarks indicate that our multi-token approach has significant advantages: (i) it can find schedules that deliver higher throughput than the single-token approach; and (ii) for the same throughput, the multi-token approach obtains solutions that consumed 33--61% less area.