Abstract
Synchronous dataflow (SDF) is a widely-used model of computation for digital signal processing and multimedia applications. In this letter, we propose an automatic approach to synthesize efficient software from SDF models with improved runtime efficiency. Our synthesis technique is based on dynamic single-appearance scheduling (dynSAS), which generates software with minimized code size, the same as traditional single-appearance schedule (SAS), while requires much less buffer memory space. We enhance dynSAS systematically to reduce control flow overhead and increase memory utilization. Experiment results show that our approach can generate efficient software with enhanced runtime performance compared to related techniques.
| Original language | English |
|---|---|
| Article number | 5373867 |
| Pages (from-to) | 69-72 |
| Number of pages | 4 |
| Journal | IEEE Embedded Systems Letters |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Oct 2009 |
Keywords
- Genetic algorithms
- Scheduling
- Software synthesis
- Synchronous dataflow
Fingerprint
Dive into the research topics of 'Efficient software synthesis for dynamic single appearance scheduling of synchronous dataflow'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver