{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:25Z","timestamp":1750306405646,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:00:00Z","timestamp":1449532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2015,12,8]]},"abstract":"<jats:p>\n            In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (\n            <jats:sc>csdf<\/jats:sc>\n            ) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding\n            <jats:sc>csdf<\/jats:sc>\n            actors and how this manipulation allows\n            <jats:sc>csdf<\/jats:sc>\n            graphs to be transformed into\n            <jats:sc>mrsdf<\/jats:sc>\n            graphs that are\n            <jats:italic>equivalent<\/jats:italic>\n            , in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for\n            <jats:sc>mrsdf<\/jats:sc>\n            graphs to be applied to\n            <jats:sc>csdf<\/jats:sc>\n            graphs and generalizes the well-known transformations from\n            <jats:sc>csdf<\/jats:sc>\n            and\n            <jats:sc>mrsdf<\/jats:sc>\n            into\n            <jats:sc>hsdf<\/jats:sc>\n            . Moreover, it gives rise to an incremental approach to the analysis of\n            <jats:sc>csdf<\/jats:sc>\n            graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.\n          <\/jats:p>","DOI":"10.1145\/2792981","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T14:22:10Z","timestamp":1449757330000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Analysis of Cyclo-Static Synchronous Dataflow Graphs"],"prefix":"10.1145","volume":"14","author":[{"given":"Robert De","family":"Groote","sequence":"first","affiliation":[{"name":"University of Twente, AE Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip K. F.","family":"H\u00f6lzenspies","sequence":"additional","affiliation":[{"name":"Facebook"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kuper","sequence":"additional","affiliation":[{"name":"University of Twente, AE Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard J. M.","family":"Smit","sequence":"additional","affiliation":[{"name":"University of Twente, AE Enschede, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463596.2463602"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.485935"},{"key":"e_1_2_1_3_1","volume-title":"Geert Jan Olsder, and Jean-Pierre Quadrat","author":"Cohen Guy","year":"1992","unstructured":"Guy Cohen, Geert Jan Olsder, and Jean-Pierre Quadrat. 1992. Synchronization and linearity. Wiley New York."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027084.1027085"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2014.24"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2609248.2609249"},{"volume-title":"Proceedings of the 11th ACM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). 35--46","author":"de Groote Robert","key":"e_1_2_1_7_1","unstructured":"Robert de Groote, P. K. F. H\u00f6lzenspies, Jan Kuper, and H. J. Broersma. 2013. Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. In Proceedings of the 11th ACM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). 35--46."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEAA.2012.20"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630146"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880050.1880052"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","unstructured":"A. H. Ghamarian M. Geilen T. Basten B. Theelen M. R. Mousavi and S. Stuijk. 2006a. Liveness and boundedness of synchronous data flow graphs. FMCAD\u201906 August (2006) 68--75. 10.1109\/FMCAD.2006.20","DOI":"10.1109\/FMCAD.2006.20"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2006.33"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6859-2"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380356.2380390"},{"key":"e_1_2_1_15_1","volume-title":"Geert Jan Olsder, and Jacob van der Woude","author":"Heidergott B.","year":"2006","unstructured":"B. Heidergott, Geert Jan Olsder, and Jacob van der Woude. 2006. Max Plus at Work: modeling and analysis of synchronized systems. Princeton University Press."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2007.52"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1995.540541"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321485"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1550904"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147138"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.58"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2006.23"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2007.12"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2792981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:34Z","timestamp":1750223254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,8]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12,8]]}},"alternative-id":["10.1145\/2792981"],"URL":"https:\/\/doi.org\/10.1145\/2792981","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2015,12,8]]},"assertion":[{"value":"2014-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-06-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-12-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}