Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Shin, Tae-ho | - |
| dc.contributor.author | Oh, Hyunok | - |
| dc.contributor.author | Ha, Soonhoi | - |
| dc.date.accessioned | 2022-12-20T11:02:52Z | - |
| dc.date.available | 2022-12-20T11:02:52Z | - |
| dc.date.created | 2022-09-16 | - |
| dc.date.issued | 2010-11 | - |
| dc.identifier.issn | 0000-0000 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/173453 | - |
| dc.description.abstract | 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. | - |
| dc.language | 영어 | - |
| dc.language.iso | en | - |
| dc.publisher | IEEE | - |
| dc.title | Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors | - |
| dc.type | Article | - |
| dc.contributor.affiliatedAuthor | Oh, Hyunok | - |
| dc.identifier.doi | 10.1109/SOCDC.2010.5682911 | - |
| dc.identifier.scopusid | 2-s2.0-79851484458 | - |
| dc.identifier.bibliographicCitation | 2010 International SoC Design Conference, ISOCC 2010, pp.298 - 301 | - |
| dc.relation.isPartOf | 2010 International SoC Design Conference, ISOCC 2010 | - |
| dc.citation.title | 2010 International SoC Design Conference, ISOCC 2010 | - |
| dc.citation.startPage | 298 | - |
| dc.citation.endPage | 301 | - |
| dc.type.rims | ART | - |
| dc.type.docType | Conference Paper | - |
| dc.description.journalClass | 1 | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.subject.keywordPlus | Answer set programming | - |
| dc.subject.keywordPlus | Buffer sizes | - |
| dc.subject.keywordPlus | Constraint programming | - |
| dc.subject.keywordPlus | Mapping information | - |
| dc.subject.keywordPlus | Optimal solutions | - |
| dc.subject.keywordPlus | Scheduling rules | - |
| dc.subject.keywordPlus | Static scheduling | - |
| dc.subject.keywordPlus | Synchronous dataflow | - |
| dc.subject.keywordPlus | Synchronous dataflow graph | - |
| dc.subject.keywordPlus | Target architectures | - |
| dc.subject.keywordPlus | Throughput constraint | - |
| dc.subject.keywordPlus | Throughput constraints | - |
| dc.subject.keywordPlus | Computer programming | - |
| dc.subject.keywordPlus | Constraint theory | - |
| dc.subject.keywordPlus | Optimization | - |
| dc.subject.keywordPlus | Response time (computer systems) | - |
| dc.subject.keywordPlus | Scheduling | - |
| dc.subject.keywordPlus | Throughput | - |
| dc.subject.keywordPlus | Data flow analysis | - |
| dc.subject.keywordAuthor | Buffer size minimization | - |
| dc.subject.keywordAuthor | Static scheduling | - |
| dc.subject.keywordAuthor | Synchronous dataflow graph | - |
| dc.subject.keywordAuthor | Throughput constraint | - |
| dc.identifier.url | https://ieeexplore.ieee.org/document/5682911 | - |
- Files in This Item
- Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 정보시스템학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Oh, Hyun Ok
- COLLEGE OF ENGINEERING (DEPARTMENT OF INFORMATION SYSTEMS)