{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:09Z","timestamp":1750219809605,"version":"3.41.0"},"reference-count":83,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T00:00:00Z","timestamp":1747094400000},"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":[[2025,5,31]]},"abstract":"<jats:p>\n            The major drawback of using static schedules to execute dataflow applications is their high inflexibility. In real-time systems, periodic schedules make it easier to assert safety guarantees and to decrease the schedule size, but their characteristics remain hard to compute. This article presents an approach to automatically generate fixed priority schedules from a dataflow specification. To do so, precedence dependencies between actors in the dataflow graphs are abstracted, as well as the task periods, by using\n            <jats:italic>affine relations<\/jats:italic>\n            . This abstraction allows us to synthesize schedules efficiently considering two main objectives: the maximization of throughput and the minimization of buffer sizes. Given a dataflow graph to execute in a real-time environment, we transform it into an Affine Dataflow Graph (ADFG) and compute the task priorities, their mapping, the number of delays in the buffers, and the buffer sizes. This article is the first to present an overview of both theoretical and practical aspects of ADFG. On the theoretical side, it presents corrections and improvements on the fixed priority case. On the practical side, benchmark evaluations demonstrate the robustness and maturity of the approach that our scheduling synthesizer implements. Synthesized schedules are evaluated by using scheduling simulation and real-time implementation. Last but not least, the synthesized periods reach the optimal throughput if enough processors are available, and most of the time the periods reach the maximal processor utilization factor in the uni-processor case. Moreover, execution time of the synthesis is about only 1 second for the main proposed algorithms.\n          <\/jats:p>","DOI":"10.1145\/3615586","type":"journal-article","created":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T12:42:22Z","timestamp":1692362542000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-time Fixed Priority Scheduling Synthesis Using Affine DataFlow Graphs: from Theory to Practice"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5875-7258","authenticated-orcid":false,"given":"Alexandre","family":"Honorat","sequence":"first","affiliation":[{"name":"University of Grenoble Alpes, INRIA, CNRS, Grenoble INP, LIG, Montbonnot, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8358-0327","authenticated-orcid":false,"given":"Hai Nam","family":"Tran","sequence":"additional","affiliation":[{"name":"University of Brest, CNRS, Lab-STICC - UMR 6285, Brest, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8020-872X","authenticated-orcid":false,"given":"Thierry","family":"Gautier","sequence":"additional","affiliation":[{"name":"INRIA Research Centre at the University of Rennes, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1964-4514","authenticated-orcid":false,"given":"Lo\u00efc","family":"Besnard","sequence":"additional","affiliation":[{"name":"CNRS, University of Rennes Research Centre, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7719-1106","authenticated-orcid":false,"given":"Shuvra","family":"Bhattacharyya","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA and INSA\/IETR, Rennes, France, and INRIA, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0556-4265","authenticated-orcid":false,"given":"Jean-Pierre","family":"Talpin","sequence":"additional","affiliation":[{"name":"INRIA Research Centre at the University of Rennes, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,13]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"1","volume-title":"Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA\u201912)","author":"Andrade H.","year":"2012","unstructured":"H. Andrade, J. Correll, A. Ekbal, A. Ghosal, D. Kim, J. Kornerup, R. Limaye, A. Prasad, K. Ravindran, T. N. Tran, M. Trimborn, G. Wang, I. Wong, and G. Yang. 2012. From streaming models to FPGA implementations. In Proceedings of the International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA\u201912). WORLDCOMP\u201912, 1."},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1049\/sej.1993.0034","article-title":"Applying new scheduling theory to static priority pre-emptive scheduling","volume":"8","author":"Audsley N.","year":"1993","unstructured":"N. Audsley, A. Burns, M. Richardson, K. Tindell, and A. J. Wellings. 1993. Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8 (1993), 284\u2013292.","journal-title":"Softw. Eng. J."},{"key":"e_1_3_2_4_2","volume-title":"International Conference on Embedded Software (EMSOFT\u201911)","author":"Bamakhrama M.","year":"2011","unstructured":"M. Bamakhrama and T. Stefanov. 2011. Hard-real-time scheduling of data-dependent tasks in embedded streaming applications. In International Conference on Embedded Software (EMSOFT\u201911)."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2191871"},{"key":"e_1_3_2_6_2","volume-title":"8th IEEE Workshop on Embedded Systems for Real-time Multimedia","author":"Benazouz M.","year":"2010","unstructured":"M. Benazouz, O. Marchetti, A. Munier-Kordon, and T. Michel. 2010. A new method for minimizing buffer sizes for cyclo-static dataflow graphs. In 8th IEEE Workshop on Embedded Systems for Real-time Multimedia."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.31"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.05.014"},{"key":"e_1_3_2_9_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1389-2","volume-title":"Software Synthesis from Dataflow Graphs","author":"Bhattacharyya S. S.","year":"1996","unstructured":"S. S. Bhattacharyya, E. A. Lee, and P. K. Murthy. 1996. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell, MA."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.485935"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.167"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","DOI":"10.1201\/9781351255790","volume-title":"Real-time Systems Development with RTEMs and Multicore Processors","author":"Bloom Gedare","year":"2020","unstructured":"Gedare Bloom, Joel Sherrill, Tingting Hu, and Ivan Cibrario Bertolotti. 2020. Real-time Systems Development with RTEMs and Multicore Processors. CRC Press."},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ESTIMedia.2013.6704509"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2016.35"},{"key":"e_1_3_2_15_2","volume-title":"Real-time Scheduling of Dataflow Graphs","author":"Bouakaz Adnan","year":"2013","unstructured":"Adnan Bouakaz. 2013. Real-time Scheduling of Dataflow Graphs. Theses. Universit\u00e9 Rennes 1."},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/MEMCOD.2014.6961838","volume-title":"2014 12th ACM\/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE\u201914)","author":"Bouakaz A.","year":"2014","unstructured":"A. Bouakaz and T. Gautier. 2014. An abstraction-refinement framework for priority-driven scheduling of static dataflow graphs. In 2014 12th ACM\/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE\u201914). 2\u201311. 10.1109\/MEMCOD.2014.6961838"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS.2014.6986102"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/2491899.2465558","volume-title":"Proceedings of the 14th ACM SIGPLAN\/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems (LCTES\u201913)","author":"Bouakaz Adnan","year":"2013","unstructured":"Adnan Bouakaz and Jean-Pierre Talpin. 2013. Buffer minimization in earliest-deadline first scheduling of dataflow graphs. In Proceedings of the 14th ACM SIGPLAN\/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems (LCTES\u201913). ACM, New York, NY, 133\u2013142. 10.1145\/2465554.2465558"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463596.2463600"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/ACSD.2012.16","volume-title":"Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design","author":"Bouakaz A.","year":"2012","unstructured":"A. Bouakaz, J.-P. Talpin, and J. Vitek. 2012. Affine data-flow graphs for the synthesis of hard real-time applications. In Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design. ACM, 183\u2013192. 10.1109\/ACSD.2012.16"},{"issue":"1","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:TIME.0000048932.30002.d9","article-title":"Rate monotonic vs. EDF: Judgment day","volume":"29","author":"Buttazzo Giorgio C.","year":"2005","unstructured":"Giorgio C. Buttazzo. 2005. Rate monotonic vs. EDF: Judgment day. Real-time Syst. 29, 1 (2005), 5\u201326.","journal-title":"Real-time Syst."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2011.2173941"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/ETFA.2006.355388","volume-title":"IEEE Conference on Emerging Technologies and Factory Automation, 2006.","author":"Cucu L.","year":"2006","unstructured":"L. Cucu and J. Goossens. 2006. Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors. In IEEE Conference on Emerging Technologies and Factory Automation, 2006.397\u2013404."},{"key":"e_1_3_2_24_2","first-page":"3","volume-title":"Proceedings of the 28th IEEE International Real-time Systems Symposium (RTSS\u201907)","author":"Davis R. I.","year":"2007","unstructured":"R. I. Davis and A. Burns. 2007. Robust priority assignment for fixed priority real-time systems. In Proceedings of the 28th IEEE International Real-time Systems Symposium (RTSS\u201907). 3\u201314."},{"key":"e_1_3_2_25_2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.sysarc.2016.04.002","article-title":"A review of priority assignment in real-time systems","volume":"65","author":"Davis R. I.","year":"2016","unstructured":"R. I. Davis, L. Cucu-Grosjean, M. Bertogna, and A. Burns. 2016. A review of priority assignment in real-time systems. J. Syst. Archit. 65 (2016), 64\u201382.","journal-title":"J. Syst. Archit."},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/SEAA.2012.20","volume-title":"2012 38th Euromicro Conference on Software Engineering and Advanced Applications","author":"Groote R. de","year":"2012","unstructured":"R. de Groote, J. Kuper, H. Broersma, and G. J. M. Smit. 2012. Max-plus algebraic throughput analysis of synchronous dataflow graphs. In 2012 38th Euromicro Conference on Software Engineering and Advanced Applications. 29\u201338. 10.1109\/SEAA.2012.20"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2871744"},{"issue":"1","key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.26.1.127","article-title":"On a real-time scheduling problem","volume":"26","author":"Dhall Sudarshan K.","year":"1978","unstructured":"Sudarshan K. Dhall and C. L. Liu. 1978. On a real-time scheduling problem. Oper. Res. 26, 1 (1978), 127\u2013140.","journal-title":"Oper. Res."},{"key":"e_1_3_2_29_2","volume-title":"Procedia Computer Science","author":"Dkhil A.","year":"2014","unstructured":"A. Dkhil, X. Do, P. Dubrulle, S. Louise, and C. Rochange. 2014. Self-timed periodic scheduling for a cyclo-static DataFlow model. In Procedia Computer Science, Vol. 29."},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.805829"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/ECRTS.2006.30","volume-title":"Proceedings of the 18th Euromicro Conference on Real-Time Systems (ECRTS\u201906)","author":"Fisher N.","year":"2006","unstructured":"N. Fisher, S. Baruah, and T. P. Baker. 2006. The partitioned scheduling of sporadic tasks according to static-priorities. In Proceedings of the 18th Euromicro Conference on Real-Time Systems (ECRTS\u201906). IEEE Computer Society, Washington, DC, 118\u2013127. 10.1109\/ECRTS.2006.30"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043662.2043663"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-017-6134-5"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/ACSD.2006.33","volume-title":"Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD\u201906)","author":"Ghamarian A. H.","year":"2006","unstructured":"A. H. Ghamarian, M. C. W. Geilen, S. Stuijk, T. Basten, B. D. Theelen, M. R. Mousavi, A. J. M. Moonen, and M. J. G. Bekooij. 2006. Throughput analysis of synchronous data flow graphs. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD\u201906). IEEE Computer Society, Washington, DC, 25\u201336. 10.1109\/ACSD.2006.33"},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/DSD.2007.4341468","volume-title":"10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD\u201907)","author":"Ghamarian A. H.","year":"2007","unstructured":"A. H. Ghamarian, S. Stuijk, T. Basten, M. C. W. Geilen, and B. D. Theelen. 2007. Latency minimization for synchronous data flow graphs. In 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD\u201907). 189\u2013196. 10.1109\/DSD.2007.4341468"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015452903532"},{"key":"e_1_3_2_37_2","first-page":"1","volume-title":"2014 International Conference on Hardware\/Software Codesign and System Synthesis (CODES+ISSS\u201914)","author":"Guo L.","year":"2014","unstructured":"L. Guo, Q. Zhu, P. Nuzzo, R. Passerone, A. Sangiovanni-Vincentelli, and E. A. Lee. 2014. Metronomy: A function-architecture co-simulation framework for timing verification of cyber-physical systems. In 2014 International Conference on Hardware\/Software Codesign and System Synthesis (CODES+ISSS\u201914). 1\u201310. 10.1145\/2656075.2656093"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1255456.1255461"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.WCET.2017.8"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","unstructured":"J. P. H. M. Hausmans S. J. Geuns M. Wiggers and M. Bekooij. 2014. Temporal analysis flow based on an enabling rate characterization for multi-rate applications executed on mpsocs with non-starvation-free schedulers. In Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems (SCOPES\u201914) Sankt Goar Germany Association for Computing Machinery New York NY 108\u2013117. 10.1145\/2609248.2609262","DOI":"10.1145\/2609248.2609262"},{"key":"e_1_3_2_41_2","first-page":"1","volume-title":"International Conference on Real-time Networks and Systems","author":"Honorat A.","year":"2017","unstructured":"A. Honorat, H. N. Tran, L. Besnard, T. Gautier, J.-P. Talpin, and A. Bouakaz. 2017. ADFG: A scheduling synthesis tool for dataflow graphs in real-time systems. In International Conference on Real-time Networks and Systems. 1\u201310. 10.1145\/3139258.3139267"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800210113"},{"issue":"4","key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/1376804.1376810","article-title":"From the prototype to the final embedded system using the ocarina AADL tool suite","volume":"7","author":"Hugues J.","year":"2008","unstructured":"J. Hugues, B. Zalila, L. Pautet, and F. Kordon. 2008. From the prototype to the final embedded system using the ocarina AADL tool suite. ACM Trans. Embed. Comput. Syst. 7, 4 (2008), 42.","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997479"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997474"},{"key":"e_1_3_2_47_2","first-page":"409","volume-title":"Proceedings of the 19th IEEE Real-time Systems Symposium, 1998.","author":"Kwak Hee-Hwan","year":"1998","unstructured":"Hee-Hwan Kwak, Insup Lee, Anna Philippou, Jin-Young Choi, and Oleg Sokolsky. 1998. Symbolic schedulability analysis of real-time systems. In Proceedings of the 19th IEEE Real-time Systems Symposium, 1998. IEEE, 409\u2013418."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.381846"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01759032"},{"issue":"4","key":"e_1_3_2_52_2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","article-title":"On the complexity of fixed-priority scheduling of periodic, real-time tasks","volume":"2","author":"Leung Joseph Y.-T.","year":"1982","unstructured":"Joseph Y.-T. Leung and Jennifer Whitehead. 1982. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform. Eval. 2, 4 (1982), 237\u2013250.","journal-title":"Perform. Eval."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","unstructured":"S. Lin Y. Liu K. Lee L. Li W. Plishker and S. S. Bhattacharyya. 2017. The DSPCAD framework for modeling and synthesis of signal processing systems. In Handbook of Hardware\/Software Codesign Soonhoi Ha and J\u00fcrgen Teich (Eds.). Springer Netherlands 1185\u20131219. 10.1007\/978-94-017-7267-9_36","DOI":"10.1007\/978-94-017-7267-9_36"},{"issue":"2","key":"e_1_3_2_54_2","first-page":"50:1\u201350:25","article-title":"Memory-constrained vectorization and scheduling of dataflow graphs for hybrid CPU-GPU platforms","volume":"17","author":"Lin S.","year":"2018","unstructured":"S. Lin, J. Wu, and S. S. Bhattacharyya. 2018. Memory-constrained vectorization and scheduling of dataflow graphs for hybrid CPU-GPU platforms. ACM Trans. Embed. Comput. Syst. 17, 2 (Jan.2018), 50:1\u201350:25.","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"1","key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard-real-time environment","volume":"20","author":"Liu Chung Laung","year":"1973","unstructured":"Chung Laung Liu and James W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20, 1 (1973), 46\u201361.","journal-title":"J. ACM"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:TIME.0000033378.56741.14"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2006.03.023"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.037"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.637146"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2008.4484696"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/83710"},{"key":"e_1_3_2_62_2","article-title":"Implementation of holistic response-time analysis in rubus-ICE","author":"Mubeen Saad","year":"2011","unstructured":"Saad Mubeen, Jukka M\u00e4ki-Turja, and Mikael Sj\u00f6din. 2011. Implementation of holistic response-time analysis in rubus-ICE. InProceedings of the 32nd IEEE Real-time Systems Symposium (RTSS\u201911), WIP Session.","journal-title":"Proceedings of the 32nd IEEE Real-time Systems Symposium (RTSS\u201911), WIP Session"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/566225.513834"},{"key":"e_1_3_2_64_2","first-page":"26","volume-title":"Proceedings of the 19th IEEE Real-time Systems Symposium, 1998.","author":"Palencia Jos\u00e9 Carlos","year":"1998","unstructured":"Jos\u00e9 Carlos Palencia and M. Gonz\u00e1lez Harbour. 1998. Schedulability analysis for tasks with static and dynamic offsets. In Proceedings of the 19th IEEE Real-time Systems Symposium, 1998. IEEE, 26\u201337."},{"key":"e_1_3_2_65_2","volume-title":"VLSI Digital Signal Processing Systems: Design and Implementation","author":"Parhi Keshab K.","year":"2007","unstructured":"Keshab K. Parhi. 2007. VLSI Digital Signal Processing Systems: Design and Implementation. John Wiley & Sons."},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.73588"},{"key":"e_1_3_2_67_2","first-page":"204","volume-title":"1995 Conference Record of the 29th Asilomar Conference on Signals, Systems and Computers, 1995","volume":"1","author":"Parks T. M.","year":"1995","unstructured":"T. M. Parks, J. L. Pino, and E. A. Lee. 1995. A comparison of synchronous and cycle-static dataflow. In 1995 Conference Record of the 29th Asilomar Conference on Signals, Systems and Computers, 1995, Vol. 1. IEEE, 204\u2013210."},{"key":"e_1_3_2_68_2","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/EDERC.2014.6924354","volume-title":"2014 6th European Embedded Design in Education and Research Conference (EDERC\u201914)","author":"Pelcat M.","year":"2014","unstructured":"M. Pelcat, K. Desnos, J. Heulot, C. Guy, J.-F. Nezan, and S. Aridhi. 2014. Preesm: A dataflow-based rapid prototyping framework for simplifying multicore DSP programming. In 2014 6th European Embedded Design in Education and Research Conference (EDERC\u201914). 36\u201340. 10.1109\/EDERC.2014.6924354"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1201\/b11644-15"},{"key":"e_1_3_2_70_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/1629335.1629367","volume-title":"Proceedings of the 7th ACM International Conference on Embedded Software (EMSOFT\u201909)","author":"Pellizzoni R.","year":"2009","unstructured":"R. Pellizzoni, P. Meredith, M.-Y. Nam, M. Sun, M. Caccamo, and L. Sha. 2009. Handling mixed-criticality in SoC-based real-time embedded systems. In Proceedings of the 7th ACM International Conference on Embedded Software (EMSOFT\u201909). ACM, New York, NY, 235\u2013244. 10.1145\/1629335.1629367"},{"key":"e_1_3_2_71_2","first-page":"1","volume-title":"ACM SIGAda Ada Letters","author":"Singhoff Frank","year":"2004","unstructured":"Frank Singhoff, J\u00e9r\u00f4me Legrand, Laurent Nana, and Lionel Marc\u00e9. 2004. Cheddar: A flexible real time scheduling framework. In ACM SIGAda Ada Letters, Vol. 24. ACM, 1\u20138."},{"key":"e_1_3_2_72_2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/REAL.1998.739773","volume-title":"Proceedings 19th IEEE Real-time Systems Symposium (Cat. No.98CB36279)","author":"Sj\u00f6din M.","year":"1998","unstructured":"M. Sj\u00f6din and H. Hansson. 1998. Improved response-time analysis calculations. In Proceedings 19th IEEE Real-time Systems Symposium (Cat. No.98CB36279). 399\u2013408. 10.1109\/REAL.1998.739773"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48118-4_22"},{"key":"e_1_3_2_74_2","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1145\/1146909.1147138","volume-title":"2006 43rd ACM\/IEEE Design Automation Conference","author":"Stuijk S.","year":"2006","unstructured":"S. Stuijk, M. Geilen, and T. Basten. 2006. Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In 2006 43rd ACM\/IEEE Design Automation Conference. 899\u2013904. 10.1145\/1146909.1147138"},{"key":"e_1_3_2_75_2","volume-title":"6th International Conference on Application of Concurrency to System Design (ACSD\u201906)","author":"Stuijk S.","year":"2006","unstructured":"S. Stuijk, M. C. W. Geilen, and T. Basten. 2006. SDF \\(^3\\) : SDF for free. In 6th International Conference on Application of Concurrency to System Design (ACSD\u201906)."},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.58"},{"key":"e_1_3_2_77_2","unstructured":"Youcheng Sun \u00c9tienne Andr\u00e9 and Giuseppe Lipari. 2015. Verification of two real-time systems using parametric timed automata. In Waters 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems. http:\/\/waters2015.inria.fr\/program\/"},{"key":"e_1_3_2_78_2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-45937-5_14","volume-title":"Proceedings of the 11th International Conference on Compiler Construction (CC\u201902)","author":"Thies W.","year":"2002","unstructured":"W. Thies, M. Karczmarek, and S. P. Amarasinghe. 2002. StreamIt: A language for streaming applications. In Proceedings of the 11th International Conference on Compiler Construction (CC\u201902). Springer-Verlag, 179\u2013196."},{"issue":"2","key":"e_1_3_2_79_2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0165-6074(94)90080-9","article-title":"Holistic schedulability analysis for distributed hard real-time systems","volume":"40","author":"Tindell Ken","year":"1994","unstructured":"Ken Tindell and John Clark. 1994. Holistic schedulability analysis for distributed hard real-time systems. Microprocess. Microprogram. 40, 2\u20133 (1994), 117\u2013134.","journal-title":"Microprocess. Microprogram."},{"key":"e_1_3_2_80_2","volume-title":"21th International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS\u201921)","author":"Tran Hai Nam","year":"2021","unstructured":"Hai Nam Tran, Alexandre Honorat, Shuvra S. Bhattacharyya, Jean-Pierre Talpin, Thierry Gautier, and Lo\u00efc Besnard. 2021. A framework for fixed priority periodic scheduling synthesis from synchronous data-flow graphs. In 21th International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS\u201921)."},{"key":"e_1_3_2_81_2","volume-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","author":"Verhaegh W. F. J.","year":"2001","unstructured":"W. F. J. Verhaegh, E. H. L. Aarts, P. C. N. van Gorp, and P. E. R. Lippens. 2001. A two-stage solution approach to multidimensional periodic scheduling. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 20."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2014.05.002"},{"key":"e_1_3_2_83_2","first-page":"328","volume-title":"6th IEEE International Conference on Real-time Computing Systems and Applications (RTCSA\u201999)","author":"Wang Yun","year":"1999","unstructured":"Yun Wang and Manas Saksena. 1999. Scheduling fixed-priority tasks with preemption threshold. In 6th IEEE International Conference on Real-time Computing Systems and Applications (RTCSA\u201999). 328\u2013335."},{"key":"e_1_3_2_84_2","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1145\/1278480.1278647","volume-title":"2007 44th ACM\/IEEE Design Automation Conference","author":"Wiggers M. H.","year":"2007","unstructured":"M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. 2007. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In 2007 44th ACM\/IEEE Design Automation Conference. 658\u2013663."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3615586","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3615586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:45:47Z","timestamp":1750178747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3615586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,13]]},"references-count":83,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,31]]}},"alternative-id":["10.1145\/3615586"],"URL":"https:\/\/doi.org\/10.1145\/3615586","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2025,5,13]]},"assertion":[{"value":"2023-02-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}