A cycle-accurate compilation algorithm for custom pipelined datapaths
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Pipeline Scheduling with Input Port Constraints for an FPGA-Based Biochemical Simulator
ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
High-level synthesis for the design of FPGA-based signal processing systems
SAMOS'09 Proceedings of the 9th international conference on Systems, architectures, modeling and simulation
Word-Length Aware DSP Hardware Design Flow Based on High-Level Synthesis
Journal of Signal Processing Systems
Design of multi-mode application-specific cores based on high-level synthesis
Integration, the VLSI Journal
An energy and power-aware approach to high-level synthesis of asynchronous systems
Proceedings of the International Conference on Computer-Aided Design
Multi-token resource sharing for pipelined asynchronous systems
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly. We have developed a novel approach based on DFG analysis that is totally done as preparation phase. This DFG analysis information includes: every node knows its successor and its predecessor, total number of successors, and the treewhich it belongs to, where trees are constructed from every output operation from the constructed DFG. Incorporating this knowledge in the priority functions of the scheduler guided the scheduler to make the correct choice of the perfect operation to be scheduled next.