Bound-oriented parallel pruning approaches for efficient resource constrained scheduling of high-level synthesis

Authors:
Mingsong Chen;Lei Zhou;Geguang Pu;Jifeng He
Affiliations:
East China Normal Univeristy, Shanghai, China;East China Normal Univeristy, Shanghai, China;East China Normal Univeristy, Shanghai, China;East China Normal Univeristy, Shanghai, China
Venue:
Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
Year:
2013

Citing 21
Cited 0

Comprehensive lower bound estimation from behavioral descriptions

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Execution interval analysis under resource constraints

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Estimation of lower bounds in scheduling algorithms for high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Automata-Based Symbolic Scheduling for Looping DFGs

IEEE Transactions on Computers
A fast approach to computing exact solutions to the resource-constrained scheduling problem

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Implications of Classical Scheduling Results for Real-Time Systems

Computer
Using speculative computation and parallelizing techniques to improve scheduling of control based designs

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
An Optimal Lower-Bound Algorithm for the High-Level Synthesis Scheduling Problem

DDECS '06 Proceedings of the 2006 IEEE Design and Diagnostics of Electronic Circuits and systems
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)

Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
An Introduction to High-Level Synthesis

IEEE Design & Test
High-Level Synthesis: Past, Present, and Future

IEEE Design & Test
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 in-place search algorithm for the resource constrained scheduling problem during high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A high-level synthesis flow for custom instruction set extensions for application-specific processors

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Estimating architectural resources and performance for high-level synthesis applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Force-directed scheduling for the behavioral synthesis of ASICs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A formal approach to the scheduling problem in high level synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
High-Level Synthesis for FPGAs: From Prototyping to Deployment

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Global optimization approach for architectural synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Lower-bound performance estimation for the high-level synthesis scheduling problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a key step of high-level synthesis (HLS), resource constrained scheduling (RCS) tries to find an optimal schedule which can dispatch all the operations with minimum latency under specific resource constraints. Branch-and-bound heuristics are promising to achieve such an optimal schedule quickly, since they can prune away large parts of infeasible solution space during the exploration. However, few of them are based on the prevalent multi-core platforms. Based on the bound information, this paper exploits the parallel pruning potentials from different perspectives and proposes various efficient techniques that can substantially reduce the overall RCS search efforts. The experimental results demonstrate that our approach can reduce the RCS time drastically.