Abstract

Pipelining is an effective method to optimize the execution of a loop, especially for digital signal processing (DSP) applications where data enter a circuit regularly. In this tutorial, the authors define the pipeline scheduling problem and the terminologies used in the high-level synthesis. Then they classify current pipeline scheduling algorithms based on the basic techniques used, namely, integer programming based, list scheduling based, probability based, randomized searching based, and transformation based. Future research directions in pipeline scheduling are highlighted. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.