{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:29:40Z","timestamp":1759332580149},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11265-014-0952-6","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T10:09:25Z","timestamp":1415009365000},"page":"19-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Memory Analysis and Optimized Allocation of Dataflow Applications on Shared-Memory MPSoCs"],"prefix":"10.1007","volume":"80","author":[{"given":"Karol","family":"Desnos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Pelcat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Nezan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slaheddine","family":"Aridhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,1]]},"reference":[{"key":"952_CR1","unstructured":"Arndt, O., Becker, D., Banz, C., Blume, H. (2013). Parallel implementation of real-time semi-global matching on embedded multi-core architectures. In Embedded computer systems: architectures, modeling, and simulation (SAMOS XIII)."},{"key":"952_CR2","doi-asserted-by":"crossref","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 Computer systems and applications (AICCSA), 2010 IEEE\/ACS.","DOI":"10.1109\/AICCSA.2010.5586972"},{"key":"952_CR3","doi-asserted-by":"crossref","unstructured":"Bodin, B., Munier-Kordon, A., de Dinechin, B. (2012). K-periodic schedules for evaluating the maximum throughput of a synchronous dataflow graph. In Embedded computer systems (SAMOS).","DOI":"10.1109\/SAMOS.2012.6404169"},{"key":"952_CR4","doi-asserted-by":"crossref","unstructured":"Bouchard, M., Angalovi\u0107, M., Hertz, A. About equivalent interval colorings of weighted graphs. Discrete Appl. Math. doi: 10.1016\/j.dam.2009.04.015 .","DOI":"10.1016\/j.dam.2009.04.015"},{"key":"952_CR5","unstructured":"Boutellier, J. (2009). Quasi-static scheduling for fine-grained embedded multiprocessing. Ph.D.thesis."},{"key":"952_CR6","doi-asserted-by":"crossref","unstructured":"Desnos, K., Pelcat, M., Nezan, J., Aridhi, S. (2012). Memory bounds for the distributed execution of a hierarchical synchronous data-flow graph. In International conference on embedded computer systems (SAMOS).","DOI":"10.1109\/SAMOS.2012.6404170"},{"key":"952_CR7","unstructured":"Desnos, K., Pelcat, M., Nezan, J.F., Aridhi, S. (2013). Pre-and post-scheduling memory allocation strategies on mpsocs. In Electronic system level synthesis conference (ESLsyn)."},{"key":"952_CR8","unstructured":"Desnos, K., & Zhang, J. (2013). Preesm project - stereo matching. svn:\/\/svn.code.sf.net\/p\/preesm\/code\/trunk\/tests\/stereo ."},{"key":"952_CR9","unstructured":"El Assad, S., & Noura, H. (2013). Generator of chaotic sequences and corresponding generating system. EP Patent App. EP20,110,720,313. http:\/\/www.google.com\/patents\/EP2553567A1?cl=en ."},{"key":"952_CR10","unstructured":"Electronic Systems Group TU Eindhoven (2013). Sdf for free (sdf3). http:\/\/www.es.ele.tue.nl\/sdf3\/ ."},{"key":"952_CR11","unstructured":"Embedded Vision Alliance (2013). Embedded vision alliance. http:\/\/www.embedded-vision.com ."},{"key":"952_CR12","doi-asserted-by":"crossref","unstructured":"Fabri, J. (1979). Automatic storage optimization. Courant Institute of Mathematical Sciences, New York University.","DOI":"10.1145\/800229.806957"},{"key":"952_CR13","doi-asserted-by":"crossref","unstructured":"Fischaber, S., Woods, R., McAllister, J. (2007). Soc memory hierarchy derivation from dataflow graphs. In IEEE workshop on signal processing systems (pp. 469\u2013474). doi: 10.1109\/SIPS.2007.4387593 10.1109\/SIPS.2007.4387593 .","DOI":"10.1109\/SIPS.2007.4387593"},{"key":"952_CR14","doi-asserted-by":"crossref","unstructured":"Greef, E.D., Catthoor, F., Man, H.D. (1997). Array placement for storage size reduction in embedded multimedia systems. ASAP.","DOI":"10.1109\/ASAP.1997.606813"},{"key":"952_CR15","unstructured":"Intel (2013). i7-3610qm processor product page. http:\/\/ark.intel.com\/products\/64899\/ ."},{"key":"952_CR16","unstructured":"Johnson, D.S. (1973). Near-optimal bin packing algorithms. Ph.D. thesis, Massachusetts Institute of Technology."},{"key":"952_CR17","unstructured":"Kalray (2013). Many-core processors \u2013 dataflow. http:\/\/www.kalray.eu\/technology\/dataflow\/ ."},{"issue":"9","key":"952_CR18","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","volume":"75","author":"E Lee","year":"1987","unstructured":"Lee, E., & Messerschmitt, D. (1987). Synchronous data flow. Proceedings of the IEEE, 75(9), 1235\u20131245. doi: 10.1109\/PROC.1987.13876","journal-title":"Proceedings of the IEEE"},{"issue":"5","key":"952_CR19","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/5.381846","volume":"83","author":"EA Lee","year":"1995","unstructured":"Lee, E.A., & Parks, T.M. (1995). Dataflow process networks. Proceedings of the IEEE, 83(5), 773\u2013801.","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"952_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0262-8856(02)00152-X","volume":"21","author":"EN Malamas","year":"2003","unstructured":"Malamas, E.N., Petrakis, E.G., Zervakis, M., Petit, L., Legat, J.D. (2003). A survey on industrial vision systems, applications and tools. Image and Vision Computing, 21(2), 171\u2013188.","journal-title":"Image and vision computing"},{"key":"952_CR21","doi-asserted-by":"crossref","unstructured":"Murthy, P., & Bhattacharyya, S. (2000). Shared memory implementations of synchronous dataflow specifications. In Proceedings of the design, automation and test in Europe conference and exhibition.","DOI":"10.1109\/DATE.2000.840303"},{"key":"952_CR22","unstructured":"Murthy, P.K.,& Bhattacharyya, S.S. (2010). Memory management for synthesis of DSP software. CRC Press."},{"key":"952_CR23","unstructured":"\u00d6sterg\u00e5rd, P.R.J. (2001). A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4), 424\u2013436."},{"key":"952_CR24","unstructured":"Parks, T.M. (1995). Bounded scheduling of process networks. Ph.D. thesis, University of California."},{"key":"952_CR25","unstructured":"Pelcat, M., Aridhi, S., Piat, J., Nezan, J.F. (2012). Physical layer multi-core prototyping: a dataflow-based approach for LTE eNodeB. Springer."},{"key":"952_CR26","unstructured":"Pelcat, M., Nezan, J.F., Piat, J., Croizer, J., Aridhi, S. (2009). A System-Level architecture model for rapid prototyping of heterogeneous multicore embedded systems. DASIP."},{"issue":"2\u20133","key":"952_CR27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1008192004934","volume":"34","author":"S Roy","year":"1999","unstructured":"Roy, S. (1999). Stereo without epipolar lines: a maximum-flow formulation. International Journal of Computer Vision, 34(2\u20133), 147\u2013161.","journal-title":"International Journal of Computer Vision"},{"key":"952_CR28","doi-asserted-by":"crossref","DOI":"10.1201\/9781420048025","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. Boca Raton, FL: CRC Press, Inc.","edition":"2"},{"key":"952_CR29","doi-asserted-by":"crossref","unstructured":"Stuijk, S., Geilen, M., Basten, T. (2006). Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In Proceedings of the 43rd annual design automation conference.","DOI":"10.1145\/1146909.1147138"},{"key":"952_CR30","unstructured":"Szeliski, R., & Zabih, R. (2000). An experimental comparison of stereo algorithms:Vision algorithms: theory and practice. In Vision algorithms: theory and practice, pp. 1\u201319. Springer."},{"key":"952_CR31","unstructured":"Szymanek, R., & Kuchcinski, K. (2001). A constructive algorithm for memory-aware task assignment and scheduling. In CODES Proceedings."},{"key":"952_CR32","unstructured":"Texas Instruments. Tms320c6678 product page. http:\/\/www.ti.com\/product\/tms320c6678 ."},{"key":"952_CR33","unstructured":"Urban, F., Raulet,M., Nezan, J.F., D\u00e9forges, O. (2006). Automatic dsp cache memory management and fast prototyping for multi-processor image applications. In 14th European signal processing conference. Eusipco."},{"key":"952_CR34","unstructured":"Wagner, D. (2007). Handheld augmented reality. Ph.D.thesis."},{"issue":"1","key":"952_CR35","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/216585.216588","volume":"23","author":"WA Wulf","year":"1995","unstructured":"Wulf, W.A., & McKee, S.A. (1995). Hitting the memory wall: implications of the obvious. ACM SIGARCH Computer Architecture News, 23(1), 20\u201324.","journal-title":"ACM SIGARCH Computer Architecture News"},{"key":"952_CR36","unstructured":"Yamaguchi, K., & Masuda, S. (2008). A new exact algorithm for the maximum weight clique problem. In 23rd international conference on circuit\/systems, computers and communications (ITC-CSCC\u201908)."},{"key":"952_CR37","unstructured":"Zhang, J., Nezan, J.F., Pelcat, M., Cousin, J.G. (2013). Real-time gpu-based local stereo matching method. In IEEE conference on design and architectures for signal and image processing (DASIP)."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0952-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-014-0952-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-014-0952-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T23:28:21Z","timestamp":1565998101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-014-0952-6"}},"subtitle":["In-Depth Study of a Computer Vision Application"],"short-title":[],"issued":{"date-parts":[[2014,11,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["952"],"URL":"https:\/\/doi.org\/10.1007\/s11265-014-0952-6","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,1]]}}}