{"title":"带吞吐量约束的多处理器同步数据流应用程序的缓冲区最优静态调度","authors":"Tae-ho Shin, Hyunok Oh, S. Ha","doi":"10.1109/SOCDC.2010.5682911","DOIUrl":null,"url":null,"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.","PeriodicalId":380183,"journal":{"name":"2010 International SoC Design Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors\",\"authors\":\"Tae-ho Shin, Hyunok Oh, S. Ha\",\"doi\":\"10.1109/SOCDC.2010.5682911\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":380183,\"journal\":{\"name\":\"2010 International SoC Design Conference\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International SoC Design Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOCDC.2010.5682911\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International SoC Design Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCDC.2010.5682911","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
