Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
- Authors
- Shin, Tae-ho; Oh, Hyunok; Ha, Soonhoi
- Issue Date
- Jan-2011
- Publisher
- IEEE
- Citation
- Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp.165 - 170
- Indexed
- SCOPUS
- Journal Title
- Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
- Start Page
- 165
- End Page
- 170
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169230
- DOI
- 10.1109/ASPDAC.2011.5722178
- ISSN
- 0000-0000
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 정보시스템학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169230)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.