Minimizing Buffer Requirements for Throughput Constrained Parallel Execution of Synchronous Dataflow Graph
- Title
- Minimizing Buffer Requirements for Throughput Constrained Parallel Execution of Synchronous Dataflow Graph
- Author
- 오현옥
- Keywords
- Throughput; Dynamic scheduling; Processor scheduling; Optimal scheduling; Schedules; Clocks; Pipeline processing
- Issue Date
- 2011-06
- Publisher
- Seoul National University Seoul, Korea/Hanyang University Seoul, Korea
- Citation
- 16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011) Design Automation Conference (ASP-DAC), 2011 16th Asia and South Pacific. :165-170 Jan, 2011
- Abstract
- This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has several benefits over static scheduling approaches. We determine the buffer size of all arcs to minimize the total buffer size while satisfying a throughput constraint. Dynamic scheduling is able to achieve the similar throughput performance as the static scheduling does by unfolding the given SDF graph. A key issue of dynamic scheduling is how to assign the priority to each node invocation, which is also discussed in this paper. Since the problem is NP-hard, we present a heuristic based on a genetic algorithm. The experimental results confirm the viability of the proposed technique.
- URI
- http://ieeexplore.ieee.org/document/5722178/http://hdl.handle.net/20.500.11754/36686
- ISSN
- 2153-6961
- DOI
- 10.1109/ASPDAC.2011.5722178
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > INFORMATION SYSTEMS(정보시스템학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML