{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:58:38Z","timestamp":1743148718642,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319495828"},{"type":"electronic","value":"9783319495835"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49583-5_25","type":"book-chapter","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T03:11:09Z","timestamp":1479957069000},"page":"325-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Buffer Minimization for Rate-Optimal Scheduling of Synchronous Dataflow Graphs on Multicore Systems"],"prefix":"10.1007","author":[{"given":"Mingze","family":"Ma","sequence":"first","affiliation":[]},{"given":"Rizos","family":"Sakellariou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"key":"25_CR1","unstructured":"http:\/\/www.es.ele.tue.nl\/sdf3\/"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-40903-8_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T Amnell","year":"2004","unstructured":"Amnell, T., Fersman, E., Mokrushin, L., Pettersson, P., Yi, W.: TIMES: a tool for schedulability analysis and code generation of real-time systems. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 60\u201372. Springer, Heidelberg (2004). doi:\n                      10.1007\/978-3-540-40903-8_6"},{"key":"25_CR3","volume-title":"Software Synthesis from Dataflow Graphs","author":"SS Bhattacharyya","year":"2012","unstructured":"Bhattacharyya, S.S., Murthy, P.K., Lee, E.A.: Software Synthesis from Dataflow Graphs. Springer Science & Business Media, Heidelberg (2012)"},{"key":"25_CR4","unstructured":"Chen, Y., Zhou, H.: Buffer minimization in pipelined SDF scheduling on multi-core platforms. In: ASP-DAC (2012)"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0166-218X(91)90037-W","volume":"30","author":"P Chretienne","year":"1991","unstructured":"Chretienne, P.: The basic cyclic scheduling problem with deadlines. Discret. Appl. Math. 30(2), 109\u2013123 (1991)","journal-title":"Discret. Appl. Math."},{"issue":"2s","key":"25_CR6","first-page":"72","volume":"13","author":"A Das","year":"2014","unstructured":"Das, A., Kumar, A., Veeravalli, B.: Energy-aware task mapping and scheduling for reliable embedded computing systems. ACM Trans. Embed. Comput. Syst. (TECS) 13(2s), 72 (2014)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Dkhil, A., Do, X.K., Louise, S., Rochange, C.: A hybrid scheduling algorithm based on self-timed and periodic scheduling for embedded streaming applications. In: PDP (2015)","DOI":"10.1109\/PDP.2015.109"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-319-27122-4_32","volume-title":"Algorithms and Architectures for Parallel Processing","author":"XK Do","year":"2015","unstructured":"Do, X.K., Dkhil, A., Louise, S.: Self-timed periodic scheduling of data-dependent tasks in embedded streaming applications. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9529, pp. 458\u2013478. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27122-4_32"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Geilen, M., Basten, T., Stuijk, S.: Minimising buffer requirements of synchronous dataflow graphs with model checking. In: DAC (2005)","DOI":"10.1109\/DAC.2005.193928"},{"key":"25_CR10","unstructured":"Ghamarian, A.H., Geilen, M., Stuijk, S., Basten, T., Moonen, A., Bekooij, M.J., Theelen, B.D., Mousavi, M.: Throughput analysis of synchronous data flow graphs. In: ACSD (2006)"},{"issue":"4s","key":"25_CR11","first-page":"135","volume":"13","author":"H Jung","year":"2014","unstructured":"Jung, H., Lee, C., Kang, S.-H., Kim, S., Oh, H., Ha, S.: Dynamic behavior specification and dynamic mapping for real-time embedded systems: hopes approach. ACM Trans. Embed. Comput. Syst. (TECS) 13(4s), 135 (2014)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11265-013-0753-3","volume":"73","author":"C Lee","year":"2013","unstructured":"Lee, C., Kim, S., Oh, H., Ha, S.: Failure-aware task scheduling of synchronous data flow graphs under real-time constraints. J. Signal Process. Syst. 73(2), 201\u2013212 (2013)","journal-title":"J. Signal Process. Syst."},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TC.1987.5009446","volume":"100","author":"EA Lee","year":"1987","unstructured":"Lee, E.A., Messerschmitt, D.G.: Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Comput. 100(1), 24\u201335 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Liu, W., Gu, Z., Yaoyao, Y.: Efficient SAT-based application mapping and scheduling on multiprocessor systems for throughput maximization. In: CASES (2015)","DOI":"10.1109\/CASES.2015.7324553"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TC.2009.155","volume":"59","author":"O Moreira","year":"2010","unstructured":"Moreira, O., Basten, T., Geilen, M., Stuijk, S.: Buffer sizing for rate-optimal single-rate data-flow scheduling revisited. IEEE Trans. Comput. 59(2), 188\u2013201 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Rosvall, K., Sander, I.: A constraint-based design space exploration framework for real-time applications on MPSoCs. In: DATE (2014)","DOI":"10.7873\/DATE2014.339"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Shin, T.-H., Oh, H., Ha, S.: Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph. In: ASP-DAC (2011)","DOI":"10.1109\/ASPDAC.2011.5722178"},{"key":"25_CR18","doi-asserted-by":"publisher","DOI":"10.1201\/9781420048025","volume-title":"Embedded Multiprocessors: Scheduling and Synchronization","author":"S Sriram","year":"2009","unstructured":"Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors: Scheduling and Synchronization. CRC Press, Boca Raton (2009)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Stuijk, S., Basten, T., Geilen, M., Corporaal, H.: Multiprocessor resource allocation for throughput-constrained synchronous dataflow graphs. In: DAC (2007)","DOI":"10.1109\/DAC.2007.375269"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Stuijk, S., Geilen, M., Basten, T.: Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In: DAC (2006)","DOI":"10.1145\/1146909.1147138"},{"key":"25_CR21","unstructured":"Stuijk, S., Geilen, M., Basten, T.: SDF\n                      \n                        \n                      \n                      $$^{3}$$\n                    : SDF for free. In: ACSD (2006)"},{"issue":"6","key":"25_CR22","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1016\/j.compeleceng.2014.05.002","volume":"40","author":"G Wang","year":"2014","unstructured":"Wang, G., Allen, R., Andrade, H.A., Sangiovanni-Vincentelli, A.: Communication storage optimization for static dataflow with access patterns under periodic scheduling and throughput constraint. Comput. Electr. Eng. 40(6), 1858\u20131873 (2014)","journal-title":"Comput. Electr. Eng."},{"issue":"7","key":"25_CR23","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1109\/TPDS.2013.172","volume":"25","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Shao, Z., Chan, H., Liu, D., Guan, Y.: Memory-aware task scheduling with communication overhead minimization for streaming applications on bus-based multiprocessor system-on-chips. IEEE Trans. Parallel Distrib. Syst. 25(7), 1797\u20131807 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, X.-Y., Geilen, M., Basten, T., Stuijk, S.: Static rate-optimal scheduling of multirate DSP algorithms via retiming and unfolding. In: RTAS (2012)","DOI":"10.1109\/RTAS.2012.15"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, X.-Y., Geilen, M., Basten, T., Stuijk, S.: Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming. In: DATE (2014)","DOI":"10.7873\/DATE.2014.338"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49583-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:34:57Z","timestamp":1558316097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49583-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319495828","9783319495835"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49583-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"25 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Granada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}