{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:31:32Z","timestamp":1770276692364,"version":"3.49.0"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T00:00:00Z","timestamp":1667001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Yale-NUS seed grant","award":["IG19-SG102"],"award-info":[{"award-number":["IG19-SG102"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2023,1,31]]},"abstract":"<jats:p>The design of time-critical embedded systems often requires static models of computation such as cyclo-static dataflow. These models enable performance guarantees, execution correctness, and optimized memory usage. Nonetheless, determining optimal buffer sizing of dataflow applications remains difficult: existing methods offer either approximate solutions or fail to provide solutions for complex instances. We propose a throughput-buffering trade-off exploration that uses K-periodic scheduling to direct a design-space exploration\u2014providing optimal solutions while significantly reducing the search space compared to existing methodologies. We compare this strategy against previous approaches and demonstrate search-space reductions over two benchmark suites, resulting in significant improvements in computation times while retaining optimal results.<\/jats:p>","DOI":"10.1145\/3559760","type":"journal-article","created":{"date-parts":[[2022,9,14]],"date-time":"2022-09-14T13:29:30Z","timestamp":1663162170000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["K-Periodic Scheduling for Throughput-Buffering Trade-Off Exploration of CSDF"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1760-6733","authenticated-orcid":false,"given":"Jaime","family":"Koh","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8762-7513","authenticated-orcid":false,"given":"Bruno","family":"Bodin","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266036"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3273905.3273921"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-012-9086-x"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2191871"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2010.5586972"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008052406396"},{"key":"e_1_3_2_8_2","first-page":"3255","article-title":"Cyclo-static data flow","author":"Bilsen Greet","year":"1995","unstructured":"Greet Bilsen, Marc Engels, Rudy Lauwereins, and Jean A. Peperstraete. 1995. Cyclo-static data flow. IEEE Transactions on Signal Processing 5 (1995), 3255\u20133258. https:\/\/ieeexplore.ieee.org\/abstract\/document\/485935\/.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ESTIMedia.2013.6704509"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898056"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2012.16"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309862"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91734-4_21"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178142"},{"key":"e_1_3_2_15_2","first-page":"5","article-title":"Decidability issues for Petri nets","author":"Esparza Javier","year":"1994","unstructured":"Javier Esparza and Mogens Nielsen. 1994. Decidability issues for Petri nets. Petri Nets Newsletter 94 (1994), 5\u201323. https:\/\/pdfs.semanticscholar.org\/11ee\/c1de65956f3a65d8d124386f4b8fbd80cc38.pdf.","journal-title":"Petri Nets Newsletter 94"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2006.20"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2006.33"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.52"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-018-1415-2"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.3233\/fi-2018-1708"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2016.52"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8714771"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4210-2"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/icassp.1995.480106"},{"key":"e_1_3_2_26_2","volume-title":"Embedded Multiprocessors: Scheduling and Synchronization (2nd ed.)","author":"Sriram Sundararajan","year":"2009","unstructured":"Sundararajan Sriram and Shuvra S. Bhattacharyya. 2009. Embedded Multiprocessors: Scheduling and Synchronization (2nd ed.). CRC Press, Boca Raton, FL."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2019.101657"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147138"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.58"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278647"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2016.7760571"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.2012.14"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3559760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:57Z","timestamp":1750183677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,29]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1,31]]}},"alternative-id":["10.1145\/3559760"],"URL":"https:\/\/doi.org\/10.1145\/3559760","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,29]]},"assertion":[{"value":"2021-04-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-18","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}