{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:48Z","timestamp":1750306608746,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T00:00:00Z","timestamp":1429574400000},"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,5,21]]},"abstract":"<jats:p>The advent of chip-level parallel architectures prompted a renewal of interest into dataflow process networks. The trend is to model an application independently from the architecture, then the model is morphed to best fit the target architecture. One downplayed aspect is the mapping of communications through the on-chip topology. The cost of such communications is often prevalent with regard to computations.<\/jats:p>\n          <jats:p>\n            This article establishes a dataflow process network called\n            <jats:italic>K-periodically Routed Graph<\/jats:italic>\n            (KRG), which serves the role of representing the various routing decisions during the transformation of a genuine application into a architecture-aware version for this application.\n          <\/jats:p>","DOI":"10.1145\/2700081","type":"journal-article","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T13:57:35Z","timestamp":1429711055000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Modeling and Analyzing Dataflow Applications on NoC-Based Many-Core Architectures"],"prefix":"10.1145","volume":"14","author":[{"given":"Jean-Vivien","family":"Millo","sequence":"first","affiliation":[{"name":"University of Nice Sophia Antipolis"}]},{"given":"Emilien","family":"Kofman","sequence":"additional","affiliation":[{"name":"University of Nice Sophia Antipolis"}]},{"given":"Robert De","family":"Simone","sequence":"additional","affiliation":[{"name":"INRIA Sophia-M\u00e9diterran\u00e9e"}]}],"member":"320","published-online":{"date-parts":[[2015,4,21]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Marco Aldinucci Marco Danelutto Peter Kilpatrick and Massimo Torquati. 2013. FastFlow: High-level and efficient streaming on multi-core. In Programming Multi-Core and Many-Core Computing Systems S. Pllana and F. Xhafa (Eds.). Wiley.  Marco Aldinucci Marco Danelutto Peter Kilpatrick and Massimo Torquati. 2013. FastFlow: High-level and efficient streaming on multi-core. In Programming Multi-Core and Many-Core Computing Systems S. Pllana and F. Xhafa (Eds.). Wiley."},{"volume-title":"Best of PLDI, Kathryn S","author":"Allen Randy","key":"e_1_2_1_2_1","unstructured":"Randy Allen and Ken Kennedy . 1984. Automatic loop interchange (with retrospective) . In Best of PLDI, Kathryn S . McKinley (Ed.). ACM , New York, NY , 75--90. Randy Allen and Ken Kennedy. 1984. Automatic loop interchange (with retrospective). In Best of PLDI, Kathryn S. McKinley (Ed.). ACM, New York, NY, 75--90."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347482"},{"key":"#cr-split#-e_1_2_1_4_1.1","doi-asserted-by":"crossref","unstructured":"Luca Benini Eric Flamand Didier Fuin and Diego Melpignano. 2012. P2012: Building an ecosystem for a scalable modular and high-efficiency embedded computing accelerator. In Proceedings of the Design Automation and Test in Europe Conference Exhibition (DATE). 983--987. DOI:http:\/\/dx.doi.org\/10.1109\/DATE.2012.6176639 10.1109\/DATE.2012.6176639","DOI":"10.1109\/DATE.2012.6176639"},{"key":"#cr-split#-e_1_2_1_4_1.2","doi-asserted-by":"crossref","unstructured":"Luca Benini Eric Flamand Didier Fuin and Diego Melpignano. 2012. P2012: Building an ecosystem for a scalable modular and high-efficiency embedded computing accelerator. In Proceedings of the Design Automation and Test in Europe Conference Exhibition (DATE). 983--987. DOI:http:\/\/dx.doi.org\/10.1109\/DATE.2012.6176639","DOI":"10.1109\/DATE.2012.6176639"},{"key":"e_1_2_1_5_1","volume-title":"Murthy","author":"Bhattacharyya Shuvra S.","year":"1996","unstructured":"Shuvra S. Bhattacharyya , Edward A. Lee , and Praveen K . Murthy . 1996 . Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers , Norwell, MA. Shuvra S. Bhattacharyya, Edward A. Lee, and Praveen K. Murthy. 1996. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell, MA."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP-95)","volume":"5","author":"Bilsen Greet","year":"1995","unstructured":"Greet Bilsen , Marc Engels , Rudy Lauwereins , and Jean A. Peperstraete . 1995. Cyclo-static dataflow . In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP-95) , Vol. 5 . 3255--3258. DOI:http:\/\/dx.doi.org\/10.1109\/ICASSP. 1995 .479579 10.1109\/ICASSP.1995.479579 Greet Bilsen, Marc Engels, Rudy Lauwereins, and Jean A. Peperstraete. 1995. Cyclo-static dataflow. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP-95), Vol. 5. 3255--3258. DOI:http:\/\/dx.doi.org\/10.1109\/ICASSP.1995.479579"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2006.1695923"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2392987.2392995"},{"volume-title":"Proceedings of the Electronic System Level Synthesis Conference (ESLsyn\u201913)","author":"Broman David","key":"e_1_2_1_9_1","unstructured":"David Broman , Michael Zimmer , Yooseong Kim , Hokeun Kim , Jian Cai , Aviral Shrivastava , Stephen A. Edwards , and Edward A. Lee . 2013. Precision timed infrastructure: Design challenges . In Proceedings of the Electronic System Level Synthesis Conference (ESLsyn\u201913) . 1--6. http:\/\/chess.eecs.berkeley.edu\/pubs\/993.html. David Broman, Michael Zimmer, Yooseong Kim, Hokeun Kim, Jian Cai, Aviral Shrivastava, Stephen A. Edwards, and Edward A. Lee. 2013. Precision timed infrastructure: Design challenges. In Proceedings of the Electronic System Level Synthesis Conference (ESLsyn\u201913). 1--6. http:\/\/chess.eecs.berkeley.edu\/pubs\/993.html."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999946.1999948"},{"volume-title":"Parallel programming in OpenMP. Morgan Kaufmann","author":"Chandra Rohit","key":"e_1_2_1_12_1","unstructured":"Rohit Chandra , Leonardo Dagun , Dave Kohr , Dror Maydan , Jeff McDonald , and Ramesh Menon . 2001. Parallel programming in OpenMP. Morgan Kaufmann , San Francisco, CA . http:\/\/opac.inria.fr\/record&equals;b1101261. Rohit Chandra, Leonardo Dagun, Dave Kohr, Dror Maydan, Jeff McDonald, and Ramesh Menon. 2001. Parallel programming in OpenMP. Morgan Kaufmann, San Francisco, CA. http:\/\/opac.inria.fr\/record&equals;b1101261."},{"volume-title":"Fundamentals of Computation Theory","author":"Chrzastowski-Wachtel Piotr","key":"e_1_2_1_13_1","unstructured":"Piotr Chrzastowski-Wachtel and Marek Raczunas . 1993. Liveness of weighted circuits and the Diophantine problem of Frobenius . In Fundamentals of Computation Theory . Springer , 171--180. Piotr Chrzastowski-Wachtel and Marek Raczunas. 1993. Liveness of weighted circuits and the Diophantine problem of Frobenius. In Fundamentals of Computation Theory. Springer, 171--180."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111054"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(71)80013-2"},{"volume-title":"Algorithmes et architectures parall\u00e8les. InterEditions","author":"Cosnard Michel","key":"e_1_2_1_17_1","unstructured":"Michel Cosnard and Denis Trystram . 1993. Algorithmes et architectures parall\u00e8les. InterEditions , Paris . http:\/\/opac.inria.fr\/record&equals;b1077080. Michel Cosnard and Denis Trystram. 1993. Algorithmes et architectures parall\u00e8les. InterEditions, Paris. http:\/\/opac.inria.fr\/record&equals;b1077080."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2012.04.016"},{"volume-title":"Networks on Chips","author":"de Micheli Giovanni","key":"e_1_2_1_19_1","unstructured":"Giovanni de Micheli and Luca Benini . 2006. Networks on Chips . Morgan Kauffmann (Elsevier) . Giovanni de Micheli and Luca Benini. 2006. Networks on Chips. Morgan Kauffmann (Elsevier)."},{"volume-title":"Communication dans les r\u00e9seaux de processeurs","author":"de Rumeur Jean","key":"e_1_2_1_20_1","unstructured":"Jean de Rumeur . 1994. Communication dans les r\u00e9seaux de processeurs . Masson , Paris, France . Jean de Rumeur. 1994. Communication dans les r\u00e9seaux de processeurs. Masson, Paris, France."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912)","author":"Djemal Manel","year":"2012","unstructured":"Manel Djemal , Francois Pecheux , Dumitru Potop-Butucaru , Robert de Simone , Franck Wajsburt , and Zhen Zhang . 2012 . Programmable routers for efficient mapping of applications onto NoC-based MPSoCs . In Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912) . 1--8. Manel Djemal, Francois Pecheux, Dumitru Potop-Butucaru, Robert de Simone, Franck Wajsburt, and Zhen Zhang. 2012. Programmable routers for efficient mapping of applications onto NoC-based MPSoCs. In Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912). 1--8."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_2_1_24_1","volume-title":"SPDF: A schedulable parametric data-flow MoC","author":"Fradet Pascal","year":"2012","unstructured":"Pascal Fradet , Alain Girault , and Peter Poplavkoy . 2012 . SPDF: A schedulable parametric data-flow MoC . In DATE, W. Rosenstiel and L. Thiele (Eds.). IEEE , Los Alamitos, CA , 769--774. Pascal Fradet, Alain Girault, and Peter Poplavkoy. 2012. SPDF: A schedulable parametric data-flow MoC. In DATE, W. Rosenstiel and L. Thiele (Eds.). IEEE, Los Alamitos, CA, 769--774."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837353"},{"volume-title":"Gossiping, Leader Election, and Fault-Tolerance","author":"Hromkovi\u010d Juraj","key":"e_1_2_1_27_1","unstructured":"Juraj Hromkovi\u010d , Ralf Klasing , Andrzej Pelc , Peter Ru\u017ei\u010dka , and Walter Unger . 2005. Dissemination of Information in Communication Networks: Part I. Broadcasting , Gossiping, Leader Election, and Fault-Tolerance . Springer-Verlag . Juraj Hromkovi\u010d, Ralf Klasing, Andrzej Pelc, Peter Ru\u017ei\u010dka, and Walter Unger. 2005. Dissemination of Information in Communication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Springer-Verlag."},{"key":"e_1_2_1_28_1","volume-title":"Information Processing 74: Proceedings of the IFIP Congress 74","author":"Kahn Gilles","year":"1974","unstructured":"Gilles Kahn . 1974 . The semantics of a simple language for parallel programming . In Information Processing 74: Proceedings of the IFIP Congress 74 . 471--475. Gilles Kahn. 1974. The semantics of a simple language for parallel programming. In Information Processing 74: Proceedings of the IFIP Congress 74. 471--475."},{"volume-title":"Retrieved","year":"2012","key":"e_1_2_1_29_1","unstructured":"Kalray. 2012 . MPPA Manycore . Retrieved March 18, 2015, from http:\/\/www.kalray.eu\/products\/mppa-manycore. Kalray. 2012. MPPA Manycore. Retrieved March 18, 2015, from http:\/\/www.kalray.eu\/products\/mppa-manycore."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/780732.780747"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/321406.321418"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/334012.334015"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.805821"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/360827.360844"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.180"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.5009446"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"volume-title":"Trees, Hypercubes. Morgan Kaufmann","author":"Leighton F. Thomson","key":"e_1_2_1_38_1","unstructured":"F. Thomson Leighton . 1992. Introduction to Parallel Algorithms and Architectures: Array , Trees, Hypercubes. Morgan Kaufmann , San Francisco, CA . F. Thomson Leighton. 1992. Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann, San Francisco, CA."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228568"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-013-9378-5"},{"volume-title":"A Calculus of Communicating Systems","author":"Milner Robin","key":"e_1_2_1_41_1","unstructured":"Robin Milner . 1982. A Calculus of Communicating Systems . Springer-Verlag , New York, NY . Robin Milner. 1982. A Calculus of Communicating Systems. Springer-Verlag, New York, NY."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.911337"},{"volume-title":"Network on Chip Routing Algorithms","author":"Rantala Ville","key":"e_1_2_1_45_1","unstructured":"Ville Rantala , Teijo Lehtonen , and Juha Plosila . 2006. Network on Chip Routing Algorithms . Turku Centre for Computer Science . Ville Rantala, Teijo Lehtonen, and Juha Plosila. 2006. Network on Chip Routing Algorithms. Turku Centre for Computer Science."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912)","author":"Ravindran Kaushik","year":"2012","unstructured":"Kaushik Ravindran , Arkadeb Ghosal , Rhishikesh Limaye , Guoqiang Wang , Guang Yang , and Hugo Andrade . 2012 . Analysis techniques for static dataflow models with access patterns . In Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912) . 1--8. Kaushik Ravindran, Arkadeb Ghosal, Rhishikesh Limaye, Guoqiang Wang, Guang Yang, and Hugo Andrade. 2012. Analysis techniques for static dataflow models with access patterns. In Proceedings of the Conference on Design and Architectures for Signal and Image Processing (DASIP\u201912). 1--8."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403714"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/MEMCOD.2006.1695924"},{"volume-title":"Handbook of Signal Processing Systems","author":"Verdoolaege Sven","key":"e_1_2_1_49_1","unstructured":"Sven Verdoolaege . 2013. Polyhedral process networks . In Handbook of Signal Processing Systems , S. S. Bhattacharyya, E. F. Deprettere, R. Leupers, and J. Takala (Eds.). Springer , New York, NY , 1335--1375. DOI:http:\/\/dx.doi.org\/10.1007\/978-1-4614-6859-2&lowbar;41 10.1007\/978-1-4614-6859-2&lowbar;41 Sven Verdoolaege. 2013. Polyhedral process networks. In Handbook of Signal Processing Systems, S. S. Bhattacharyya, E. F. Deprettere, R. Leupers, and J. Takala (Eds.). Springer, New York, NY, 1335--1375. DOI:http:\/\/dx.doi.org\/10.1007\/978-1-4614-6859-2&lowbar;41"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.10.008"},{"key":"e_1_2_1_51_1","volume-title":"Retrieved","author":"Whelihan David","year":"2013","unstructured":"David Whelihan . 2013 . NoCsim . Retrieved March 18, 2015, from http:\/\/nocsim.sourceforge.net\/. David Whelihan. 2013. NoCsim. Retrieved March 18, 2015, from http:\/\/nocsim.sourceforge.net\/."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2008.10"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2700081","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2700081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:00Z","timestamp":1750227420000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2700081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,21]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5,21]]}},"alternative-id":["10.1145\/2700081"],"URL":"https:\/\/doi.org\/10.1145\/2700081","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2015,4,21]]},"assertion":[{"value":"2014-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-04-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}