Abstract
The first section of this chapter presents systematic techniques for compiling SDF graphs into implementations that require minimum code size. A graph decomposition process is defined that can be used to construct single appearance schedules whenever they exist. Based on this decomposition process, a general framework for developing scheduling algorithms is defined, and it is shown that all scheduling algorithms that are constructed through this framework construct single appearance schedules whenever they exist. It is also shown that the code size optimality of the scheduling framework extends in a restricted way to SDF graphs that do not have single appearance schedules: the framework guarantees minimum code size for all actors that are not contained in subgraphs of a certain form, called tightly interdependent subgraphs. Section 5.2 presents a practical example to illustrate the efficacy of the scheduling framework of section 5.1.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
