{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:38:20Z","timestamp":1740148700038,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11265-021-01649-z","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T10:03:56Z","timestamp":1617789836000},"page":"1007-1026","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation of the Exact Throughput of a Synchronous DataFlow Graph"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8762-7513","authenticated-orcid":false,"given":"Bruno","family":"Bodin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2170-6366","authenticated-orcid":false,"given":"Alix Munier","family":"Kordon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,7]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aubry, P., Beaucamps, P., Blanc, F., Bodin, B., Carpov, S., Cudennec, L., David, V., Dore, P., Dubrulle, P., de Dinechin, B.D., Galea, F., Goubier, T., Harrand, M., Jones, S., Lesage, J., Louise, S., Chaisemartin, N.M., Nguyen, T.H., Raynaud, X., & Sirdey, R. (2013). Extended cyclostatic dataflow program compilation and execution for an integrated manycore processor. In Proceedings of the international conference on computational science, ICCS 2013, Barcelona, Spain, 5-7 June, 2013, pp. 1624\u20131633. https:\/\/doi.org\/10.1016\/j.procs.2013.05.330.","key":"1649_CR1","DOI":"10.1016\/j.procs.2013.05.330"},{"issue":"2","key":"1649_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10617-012-9086-x","volume":"17","author":"MA Bamakhrama","year":"2013","unstructured":"Bamakhrama, M. A., & Stefanov, T. P. (2013). On the hard-real-time scheduling of embedded streaming applications. Design Automation for Embedded Systems, 17(2), 221\u2013249. https:\/\/doi.org\/10.1007\/s10617-012-9086-x.","journal-title":"Design Automation for Embedded Systems"},{"issue":"5","key":"1649_CR3","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TAC.2012.2191871","volume":"57","author":"A Benabid","year":"2012","unstructured":"Benabid, A., Hanen, C., Marchetti, O., & Munier-Kordon, A. (2012). Periodic schedules for bounded timed weighted event graphs. IEEE Transactions on Automatic Control, 57(5), 1222\u20131232.","journal-title":"IEEE Transactions on Automatic Control"},{"doi-asserted-by":"publisher","unstructured":"Benazouz, M., Marchetti, O., Munier Kordon, A., & Michel, T. (2010). A new method for minimizing buffer sizes for cyclo-static dataflow graphs. In 8th IEEE workshop on embedded systems for real-time multimedia, ESTIMedia 2010, 28-29 October 2010, Scottsdale, AZ, USA, pp. 11\u201320. https:\/\/doi.org\/10.1109\/ESTMED.2010.5666980.","key":"1649_CR4","DOI":"10.1109\/ESTMED.2010.5666980"},{"doi-asserted-by":"publisher","unstructured":"Benazouz, M., Marchetti, O., Munier Kordon, A., & Urard, P. (2010). A new approach for minimizing buffer capacities with throughput constraint for embedded system design. In The 8th ACS\/IEEE international conference on computer systems and applications, AICCSA 2010, Hammamet, Tunisia, May 16-19, 2010, pp. 1\u20138. https:\/\/doi.org\/10.1109\/AICCSA.2010.5586972.","key":"1649_CR5","DOI":"10.1109\/AICCSA.2010.5586972"},{"unstructured":"Bilsen, G., Engels, M., Lauwereins, R., & Peperstraete, J. (1995). Cyclo-static data flow. IEEE Transactions on Signal Processing, 3255\u20133258.","key":"1649_CR6"},{"doi-asserted-by":"publisher","unstructured":"Bodin, B., Munier Kordon, A., & Dupont de Dinechin, B. (2012). K-periodic schedules for evaluating the maximum throughput of a synchronous dataflow graph. In 2012 International conference on embedded computer systems: architectures, modeling, and simulation, SAMOS XII, Samos, Greece, July 16-19, 2012, pp. 152\u2013159 https:\/\/doi.org\/10.1109\/SAMOS.2012.6404169.","key":"1649_CR7","DOI":"10.1109\/SAMOS.2012.6404169"},{"doi-asserted-by":"publisher","unstructured":"Bodin, B., Munier Kordon, A., & Dupont de Dinechin, B. (2016). Optimal and fast throughput evaluation of CSDF. In Proceedings of the 53rd Annual Design Automation Conference, DAC 2016, Austin, TX, USA, June 5-9, 2016, pp. 160:1\u2013160:6. https:\/\/doi.org\/10.1145\/2897937.2898056.","key":"1649_CR8","DOI":"10.1145\/2897937.2898056"},{"key":"1649_CR9","first-page":"127","volume":"4","author":"P Chr\u00e9tienne","year":"1985","unstructured":"Chr\u00e9tienne, P. (1985). Transient and limiting behavior of timed event graphs. RAIRO Techniques et Sciences Informatiques, 4, 127\u2013192.","journal-title":"RAIRO Techniques et Sciences Informatiques"},{"issue":"1","key":"1649_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/5.21069","volume":"77","author":"G Cohen","year":"1989","unstructured":"Cohen, G., Moller, P., Quadrat, J. P., & Viot, M. (1989). Algebraic tools for the performance evaluation of discrete event systems. IEEE Proceeding: special issue on Discrete Event Systems, 77(1), 39\u201358.","journal-title":"IEEE Proceeding: special issue on Discrete Event Systems"},{"key":"1649_CR11","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms. Cambridge: MIT Press."},{"doi-asserted-by":"publisher","unstructured":"Damavandpeyma, M., Stuijk, S., Basten, T., Geilen, M., & Corporaal, H. (2012). Modeling static-order schedules in synchronous dataflow graphs. In 2012 Design, Automation & Test in Europe Conference & Exhibition, DATE 2012, Dresden, Germany, March 12-16, 2012, pp. 775\u2013780. https:\/\/doi.org\/10.1109\/DATE.2012.6176588.","key":"1649_CR12","DOI":"10.1109\/DATE.2012.6176588"},{"doi-asserted-by":"publisher","unstructured":"Dasdan, A., Irani, S.S., & Gupta, R.K. (1999). Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Proceedings of the 36th annual ACM\/IEEE Design Automation Conference, DAC \u201999, pp. 37\u201342. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/309847.309862.","key":"1649_CR13","DOI":"10.1145\/309847.309862"},{"issue":"1","key":"1649_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s11265-014-0952-6","volume":"80","author":"K Desnos","year":"2015","unstructured":"Desnos, K., Pelcat, M., Nezan, J. F., & Aridhi, S. (2015). Memory analysis and optimized allocation of dataflow applications on shared-memory mpsocs. Journal of Signal Processing Systems, 80(1), 19\u201337. https:\/\/doi.org\/10.1007\/s11265-014-0952-6.","journal-title":"Journal of Signal Processing Systems"},{"unstructured":"Ghamarian, A. H., Geilen, M. C. W., Stuijk, S., Basten, T., Moonen, A. J. M., Bekooij, M. J. G., Theelen, B. D., & Mousavi, M. R. (2006). Throughput analysis of synchronous data flow graphs. In ACSD\u201906, proc. (2006) (pp. 25\u201334): IEEE.","key":"1649_CR15"},{"unstructured":"de Groote, R. (2016). On the analysis of synchronous dataflow graphs: a system-theoretic perspective. Ph.D. thesis, University of Twente.","key":"1649_CR16"},{"unstructured":"de Groote, R. Bhattacharyya, S. S., Deprettere, E. F., Leupers, R., & Takala, J. (Eds.). (2019). Throughput analysis of dataflow graphs. Cham: Springer International Publishing.","key":"1649_CR17"},{"unstructured":"de Groote, R., H\u00f6lzenspies, P.K.F., Kuper, J., & Broersma, H. (2013). Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. In 11th ACM\/IEEE International Conference on Formal Methods and Models for Codesign, MEMCODE 2013, Portland, OR, USA, October 18-20, 2013, pp. 35\u201346. http:\/\/ieeexplore.ieee.org\/document\/6670939\/.","key":"1649_CR18"},{"doi-asserted-by":"publisher","unstructured":"de Groote, R., H\u00f6lzenspies, P.K.F., Kuper, J., & Smit, G.J.M. (2014). Multi-rate equivalents of cyclo-static synchronous dataflow graphs. In 14th International Conference on Application of Concurrency to System Design, ACSD 2014, Tunis La Marsa, Tunisia, June 23-27, 2014, pp. 62\u201371. https:\/\/doi.org\/10.1109\/ACSD.2014.24.","key":"1649_CR19","DOI":"10.1109\/ACSD.2014.24"},{"doi-asserted-by":"publisher","unstructured":"de Groote, R., Kuper, J., Broersma, H., & Smit, G.J.M. (2012). Max-plus algebraic throughput analysis of synchronous dataflow graphs. In 38th Euromicro Conference on Software Engineering and Advanced Applications, SEAA 2012, Cesme, Izmir, Turkey, September 5-8, 2012, pp. 29\u201338. https:\/\/doi.org\/10.1109\/SEAA.2012.20.","key":"1649_CR20","DOI":"10.1109\/SEAA.2012.20"},{"key":"1649_CR21","volume-title":"Cyclic Scheduling, chap. 5. Introduction to scheduling","author":"C Hanen","year":"2009","unstructured":"Hanen, C. (2009). Cyclic Scheduling, chap. 5. Introduction to scheduling. Boca Raton: Chapman and Hall\/CRC Press. ISBN: 978-1420072730."},{"key":"1649_CR22","volume-title":"Dynamic programming and Markov Processes","author":"RA Howard","year":"1960","unstructured":"Howard, R. A. (1960). Dynamic programming and Markov Processes. New York: Wiley."},{"unstructured":"Lee, E.A. (1986). A coupled hardware and software architecture for programmable digital signal processors (synchronous data flow). Ph.D. thesis, University of California, Berkeley. AAI8718057.","key":"1649_CR23"},{"issue":"9","key":"1649_CR24","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","volume":"75","author":"EA Lee","year":"1987","unstructured":"Lee, E. A., & Messerschmitt, D. G. (1987). Synchronous data flow. Proceeding of the IEEE, 75 (9), 1235\u20131245.","journal-title":"Proceeding of the IEEE"},{"doi-asserted-by":"crossref","unstructured":"Leupers, R., Aguilar, M. A., Castrillon, J., & Sheng, W. Bhattacharyya, S. S., Deprettere, E. F., Leupers, R., & Takala, J. (Eds.). (2019). Software compilation techniques for heterogeneous embedded multi-core systems. Cham: Springer International Publishing.","key":"1649_CR25","DOI":"10.1007\/978-3-319-91734-4_28"},{"key":"1649_CR26","volume-title":"Cyclic scheduling for the synthesis of embedded systems, chap. 6. Introduction to scheduling","author":"O Marchetti","year":"2009","unstructured":"Marchetti, O., & Munier Kordon, A. (2009). Cyclic scheduling for the synthesis of embedded systems, chap. 6. Introduction to scheduling. Boca Raton: Chapman and Hall\/CRC Press. ISBN: 978-1420072730."},{"issue":"2","key":"1649_CR27","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.ejor.2008.07.037","volume":"197","author":"O Marchetti","year":"2009","unstructured":"Marchetti, O., & Munier-Kordon, A. (2009). A sufficient condition for the liveness of weighted event graphs. European Journal of Operational Research, 197(2), 532\u2013540. https:\/\/doi.org\/10.1016\/j.ejor.2008.07.037. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221708005900.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"1649_CR28","first-page":"487","volume":"27","author":"A Munier","year":"1993","unstructured":"Munier, A. (1993). R\u00e9gime asymptotique optimal d\u2019un graphe d\u2019\u00e9v\u00e9nements temporis\u00e9 g\u00e9n\u00e9ralis\u00e9: application \u00e0 un probl\u00e8me d\u2019assemblage. RAIRO-Automatique Productique Informatique Industrielle, 27(5), 487\u2013513.","journal-title":"RAIRO-Automatique Productique Informatique Industrielle"},{"doi-asserted-by":"publisher","unstructured":"Niknam, S., Wang, P., & Stefanov, T. (2019). Hard real-time scheduling of streaming applications modeled as cyclic csdf graphs. In 2019 Design, automation test in europe conference exhibition (DATE). https:\/\/doi.org\/10.23919\/DATE.2019.8714771 (pp. 1549\u20131554).","key":"1649_CR29","DOI":"10.23919\/DATE.2019.8714771"},{"issue":"1","key":"1649_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/B:VLSI.0000017002.91721.0e","volume":"37","author":"H Oh","year":"2004","unstructured":"Oh, H., & Ha, S. (2004). Fractional rate dataflow model for efficient code synthesis. VLSI Signal Processing, 37(1), 41\u201351. https:\/\/doi.org\/10.1023\/B:VLSI.0000017002.91721.0e.","journal-title":"VLSI Signal Processing"},{"issue":"4","key":"1649_CR31","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R Reiter","year":"1968","unstructured":"Reiter, R. (1968). Scheduling parallel computations. Journal of the ACM, 15(4), 590\u2013599.","journal-title":"Journal of the ACM"},{"key":"1649_CR32","volume-title":"Embedded multiprocessors: Scheduling and synchronization","author":"S Sriram","year":"2009","unstructured":"Sriram, S., & Bhattacharyya, S. S. (2009). Embedded multiprocessors: Scheduling and synchronization, 2nd edn. New York: CRC Press.","edition":"2nd edn."},{"doi-asserted-by":"crossref","unstructured":"Wiggers, M. H., Bekooij, M. J. G., Jansen, P. G., & Smit, G. J. M. (2007). Efficient computation of buffer capacities for cyclo-static real-time systems with back-pressure. In RTAS \u201907: Proceedings of the 13th IEEE real time and embedded technology and applications symposium (pp. 281\u2013292). Washington: IEEE Computer Society.","key":"1649_CR33","DOI":"10.1109\/RTAS.2007.12"},{"doi-asserted-by":"publisher","unstructured":"Zaki, G. F., Plishker, W., Bhattacharyya, S. S., & Fruth, F. (2012). Partial expansion graphs: Exposing parallelism and dynamic scheduling opportunities for dsp applications. In 2012 IEEE 23Rd international conference on application-specific systems, architectures and processors, pp. 86\u201393. https:\/\/doi.org\/10.1109\/ASAP.2012.14.","key":"1649_CR34","DOI":"10.1109\/ASAP.2012.14"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-021-01649-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-021-01649-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-021-01649-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,3]],"date-time":"2021-09-03T22:00:05Z","timestamp":1630706405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-021-01649-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,7]]},"references-count":34,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1649"],"URL":"https:\/\/doi.org\/10.1007\/s11265-021-01649-z","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2021,4,7]]},"assertion":[{"value":"2 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}