상세 보기
Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors
- Shin, Tae-ho;
- Oh, Hyunok;
- Ha, Soonhoi
Citations
SCOPUS
5초록
This paper determines a static scheduling and the minimal size of arc buffers for a given synchronous dataflow (SDF) graph, satisfying a throughput constraint. Unlike the previous work, we assume that the target architecture and the mapping information are given. In addition we consider the unfolding of the SDF graph to improve the throughput. To solve this problem, we adopt answer set programming (ASP) with constraint programming (CP) technique which always finds optimal solutions. The proposed ASP+CP formulation is compact enough to list the scheduling rules in 27 lines and could be applied to a small-but-practical size of coarse-grain SDF graphs successfully.
키워드
Buffer size minimization; Static scheduling; Synchronous dataflow graph; Throughput constraint; Answer set programming; Buffer sizes; Constraint programming; Mapping information; Optimal solutions; Scheduling rules; Static scheduling; Synchronous dataflow; Synchronous dataflow graph; Target architectures; Throughput constraint; Throughput constraints; Computer programming; Constraint theory; Optimization; Response time (computer systems); Scheduling; Throughput; Data flow analysis
- 제목
- Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors
- 저자
- Shin, Tae-ho; Oh, Hyunok; Ha, Soonhoi
- 발행일
- 2010-11
- 유형
- Conference Paper
- 저널명
- 2010 International SoC Design Conference, ISOCC 2010
- 페이지
- 298 ~ 301