{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:31Z","timestamp":1750307251398,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"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":[[2010,12]]},"abstract":"<jats:p>Applications in the signal processing domain are often modeled by dataflow graphs. Due to heterogeneous complexity requirements, these graphs contain both dynamic and static dataflow actors. In previous work, we presented a generalized clustering approach for these heterogeneous dataflow graphs in the presence of unbounded buffers. This clustering approach allows the application of static scheduling methodologies for static parts of an application during embedded software generation for multiprocessor systems. It systematically exploits the predictability and efficiency of the static dataflow model to obtain latency and throughput improvements. In this article, we present a generalization of this clustering technique to dataflow graphs with bounded buffers, therefore enabling synthesis for embedded systems without dynamic memory allocation. Furthermore, a case study is given to demonstrate the performance benefits of the approach.<\/jats:p>","DOI":"10.1145\/1880050.1880054","type":"journal-article","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T16:59:17Z","timestamp":1294246757000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of SystemC actor networks for efficient synthesis"],"prefix":"10.1145","volume":"10","author":[{"given":"Joachim","family":"Falk","sequence":"first","affiliation":[{"name":"University of Erlangen-Nuremberg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Zebelein","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Keinert","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Haubelt","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juergen","family":"Teich","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuvra S.","family":"Bhattacharyya","sequence":"additional","affiliation":[{"name":"University of Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,1,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Abdi S. Peng J. Yu H. Shin D. Gerstlauer A. Doemer R. and Gajski D. 2003. System-on-Chip Environment (SCE Version 2.2.0 beta): Tutorial. University of California Irvine CA. Tech. rep. CECS-TR-03-41.  Abdi S. Peng J. Yu H. Shin D. Gerstlauer A. Doemer R. and Gajski D. 2003. System-on-Chip Environment (SCE Version 2.2.0 beta): Tutorial. University of California Irvine CA. Tech. rep. CECS-TR-03-41."},{"volume-title":"IEEE Standard 1666-2005 SystemC Language Reference Manual","author":"Baird M.","key":"e_1_2_1_2_1","unstructured":"Baird , M. 2005. IEEE Standard 1666-2005 SystemC Language Reference Manual . IEEE , Los Alamitos, CA . Baird, M. 2005. IEEE Standard 1666-2005 SystemC Language Reference Manual. IEEE, Los Alamitos, CA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.105"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2000.860121"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/81.376876"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01608539"},{"key":"e_1_2_1_7_1","first-page":"9","article-title":"Software synthesis and code generation for signal processing systems","volume":"47","author":"Bhattacharyya S. S.","year":"2000","unstructured":"Bhattacharyya , S. S. , Leupers , R. , and Marwedel , P. 2000 . Software synthesis and code generation for signal processing systems . IEEE Trans. Circuits Syst. 47 , 9 . Bhattacharyya, S. S., Leupers, R., and Marwedel, P. 2000. Software synthesis and code generation for signal processing systems. IEEE Trans. Circuits Syst. 47, 9.","journal-title":"IEEE Trans. Circuits Syst."},{"key":"e_1_2_1_8_1","unstructured":"Bhattacharyya S. S. Murthy P. and Lee E. 1997. APGAN and RPMC: Complementary heuristics for translating DSP block diagrams into efficient software implementations. J. Des. Autom. Embedded Syst.  Bhattacharyya S. S. Murthy P. and Lee E. 1997. APGAN and RPMC: Complementary heuristics for translating DSP block diagrams into efficient software implementations. J. Des. Autom. Embedded Syst."},{"volume-title":"Proceedings of the International Workshop on Signal Processing. IEEE","author":"Bhattacharyya S. S.","key":"e_1_2_1_9_1","unstructured":"Bhattacharyya , S. S. and Murthy , P. K . 1995. Optimal parenthesization of lexical orderings for dsp block diagrams . In Proceedings of the International Workshop on Signal Processing. IEEE , Los Alamitos, CA, 177--186. Bhattacharyya, S. S. and Murthy, P. K. 1995. Optimal parenthesization of lexical orderings for dsp block diagrams. In Proceedings of the International Workshop on Signal Processing. IEEE, Los Alamitos, CA, 177--186."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.485935"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/334012.334042"},{"volume-title":"Proceedings of the International Workshop on Rapid System Prototyping. IEEE","author":"Choi C.","key":"e_1_2_1_13_1","unstructured":"Choi , C. and Ha , S . 1997. Software synthesis for dynamic data flow graph . In Proceedings of the International Workshop on Rapid System Prototyping. IEEE , Los Alamitos, CA. Choi, C. and Ha, S. 1997. Software synthesis for dynamic data flow graph. In Proceedings of the International Workshop on Rapid System Prototyping. IEEE, Los Alamitos, CA."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337511"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086228.1086277"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1450058.1450084"},{"key":"e_1_2_1_17_1","unstructured":"FZI Research Center for Information Technology. 2007. KaSCPar\u2014Karlsruhe SystemC Parser Suite. http:\/\/www.fzi.de\/sim\/kascpar.html.  FZI Research Center for Information Technology. 2007. KaSCPar\u2014Karlsruhe SystemC Parser Suite. http:\/\/www.fzi.de\/sim\/kascpar.html."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017753.1017778"},{"key":"e_1_2_1_19_1","unstructured":"Gr\u00f6tker T. Liao S. Martin G. and Swan S. 2002. System Design with SystemC. Kluwer Academic Publishers The Netherlands.   Gr\u00f6tker T. Liao S. Martin G. and Swan S. 2002. System Design with SystemC. Kluwer Academic Publishers The Netherlands."},{"key":"e_1_2_1_20_1","unstructured":"Hsu C. and Bhattacharyya S. S. 2007. Cycle-breaking techniques for scheduling synchronous dataflow graphs. Tech. rep. UMIACS-TR-2007-12 Institute for Advanced Computer Studies University of Maryland at College Park.  Hsu C. and Bhattacharyya S. S. 2007. Cycle-breaking techniques for scheduling synchronous dataflow graphs. Tech. rep. UMIACS-TR-2007-12 Institute for Advanced Computer Studies University of Maryland at College Park."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140389.1140394"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1146981"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Congress. 471--475","author":"Kahn G.","year":"1974","unstructured":"Kahn , G. 1974 . The semantics of simple language for parallel programming . In Proceedings of the Congress. 471--475 . Kahn, G. 1974. The semantics of simple language for parallel programming. In Proceedings of the Congress. 471--475."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151074.1151077"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455229.1455230"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.87"},{"volume-title":"Overview of the Ptolemy project. Tech. rep. ucb\/erl m03\/25. Department of Electrical Engineering and Computer Sciences","author":"Lee E. A.","key":"e_1_2_1_27_1","unstructured":"Lee , E. A. 2004. Overview of the Ptolemy project. Tech. rep. ucb\/erl m03\/25. Department of Electrical Engineering and Computer Sciences , University of California , Berkeley, CA . Lee, E. A. 2004. Overview of the Ptolemy project. Tech. rep. ucb\/erl m03\/25. Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.736561"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.850819"},{"volume-title":"Proceedings of the Conference on Signals, Systems, and Computers. IEEE","author":"Pino J. L.","key":"e_1_2_1_31_1","unstructured":"Pino , J. L. , Bhattacharyya , S. S. , and Lee , E. A . 1995. A hierarchical multiprocessor scheduling system for dsp applications . In Proceedings of the Conference on Signals, Systems, and Computers. IEEE , Los Alamitos, CA, 122--126. Pino, J. L., Bhattacharyya, S. S., and Lee, E. A. 1995. A hierarchical multiprocessor scheduling system for dsp applications. In Proceedings of the Conference on Signals, Systems, and Computers. IEEE, Los Alamitos, CA, 122--126."},{"volume-title":"Proceedings of the 20th International Conference Application and Theory of Petri Nets. Springer","author":"Sgroi M.","key":"e_1_2_1_32_1","unstructured":"Sgroi , M. , Lavagno , L. , Watanabe , Y. , and Sangiovanni-Vincentelli , A . 1999. Quasi-static scheduling of embedded software using equal conflict nets . In Proceedings of the 20th International Conference Application and Theory of Petri Nets. Springer , Berlin. Sgroi, M., Lavagno, L., Watanabe, Y., and Sangiovanni-Vincentelli, A. 1999. Quasi-static scheduling of embedded software using equal conflict nets. In Proceedings of the 20th International Conference Application and Theory of Petri Nets. Springer, Berlin."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.931229"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147138"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2006.23"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289816.1289823"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278647"},{"volume-title":"Proceedings of the 6th International Conference on Formal Methods and Models for Co-Design. ACM","author":"Zebelein C.","key":"e_1_2_1_38_1","unstructured":"Zebelein , C. , Falk , J. , Haubelt , C. , and Teich , J . 2008. Classification of general dataflow actors into known models of computation . In Proceedings of the 6th International Conference on Formal Methods and Models for Co-Design. ACM , New York, 119--128. Zebelein, C., Falk, J., Haubelt, C., and Teich, J. 2008. Classification of general dataflow actors into known models of computation. In Proceedings of the 6th International Conference on Formal Methods and Models for Co-Design. ACM, New York, 119--128."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2002.807767"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880050.1880054","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1880050.1880054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:16Z","timestamp":1750243936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1880050.1880054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1145\/1880050.1880054"],"URL":"https:\/\/doi.org\/10.1145\/1880050.1880054","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2010,12]]},"assertion":[{"value":"2009-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}