{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T01:09:27Z","timestamp":1723943367203},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,11,12]],"date-time":"2014-11-12T00:00:00Z","timestamp":1415750400000},"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":["Int J Parallel Prog"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10766-014-0338-1","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:29:47Z","timestamp":1415982587000},"page":"1103-1128","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["List Scheduling in Embedded Systems Under Memory Constraints"],"prefix":"10.1007","volume":"43","author":[{"given":"Paul-Antoine","family":"Arras","sequence":"first","affiliation":[]},{"given":"Didier","family":"Fuin","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Jeannot","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Stoutchinin","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Thibault","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,12]]},"reference":[{"issue":"12","key":"338_CR1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"TL Adam","year":"1974","unstructured":"Adam, T.L., Chandy, K., Dickson, J.: Comparison of list schedules for parallel processing systems. Commun. ACM 17(12), 685\u2013690 (1974)","journal-title":"Commun. ACM"},{"key":"338_CR2","doi-asserted-by":"crossref","unstructured":"Baker, T.P.: Stack-based scheduling for realtime processes. Real-Time Syst. 3(1), 84\u201388 (1991)","DOI":"10.1007\/BF00365393"},{"key":"338_CR3","doi-asserted-by":"crossref","unstructured":"Batat, A., Feitelson, D.: Gang scheduling with memory considerations. In: Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International, pp. 109\u2013114. IEEE (2000)","DOI":"10.1109\/IPDPS.2000.845971"},{"key":"338_CR4","doi-asserted-by":"crossref","unstructured":"Benini, L., Flamand, E., Fuin, D., Melpignano, D.: P2012: building an ecosystem for a scalable, modular and high-efficiency embedded computing accelerator. In: Design, Automation Test in Europe Conference Exhibition (DATE), 2012, pp. 983\u2013987 (2012)","DOI":"10.1109\/DATE.2012.6176639"},{"key":"338_CR5","doi-asserted-by":"crossref","unstructured":"Buck, J., Lee, E.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. In: 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-93), vol. 1, pp. 429\u2013432. IEEE (1993)","DOI":"10.1109\/ICASSP.1993.319147"},{"key":"338_CR6","doi-asserted-by":"crossref","unstructured":"Canon, L.C., Jeannot, E., Sakellariou, R., Zheng, W.: Comparative evaluation of the robustness of dag scheduling heuristics. In: Gorlatch, S., Fragopoulou, P., Priol, T. (eds.) Grid Computing, pp. 73\u201384. Springer, US (2008). doi: 10.1007\/978-0-387-09457-1_7","DOI":"10.1007\/978-0-387-09457-1_7"},{"key":"338_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"GJ Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Comput. Lang. 6, 47\u201357 (1981)","journal-title":"Comput. Lang."},{"key":"338_CR8","doi-asserted-by":"crossref","unstructured":"Fradet, P., Girault, A., Poplavkoy, P.: SPDF: a schedulable parametric data-flow MoC. In: Design, Automation & Test in Europe Conference & Exhibition (DATE), 2012, p. 769774 (2012)","DOI":"10.1109\/DATE.2012.6176572"},{"issue":"12","key":"338_CR9","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1587\/transinf.E93.D.3223","volume":"E93\u2013D","author":"T Geng","year":"2010","unstructured":"Geng, T., et al.: Parallelization of computing-intensive tasks of the h.264 high profile decoding algorithm on a reconfigurable multimedia system. IEICE Trans. Inf. Syst. E93\u2013D(12), 3223\u20133231 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"338_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0209038","volume":"9","author":"J Gilbert","year":"1980","unstructured":"Gilbert, J., Lengauer, T., Tarjan, R.: The pebbling problem is complete in polynomial space. SIAM J. Comput. 9(3), 513\u2013524 (1980)","journal-title":"SIAM J. Comput."},{"key":"338_CR11","doi-asserted-by":"crossref","unstructured":"Guermouche, A., L\u2019Excellent, J.Y.: Memory-based scheduling for a parallel multifrontal solver. In: Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, p. 71. IEEE (2004)","DOI":"10.1109\/IPDPS.2004.1303001"},{"key":"338_CR12","doi-asserted-by":"crossref","unstructured":"Herrmann, J., Marchal, L., Robert, Y.: Model and complexity results for tree traversals on hybrid platforms. In: Euro-Par 2013 Parallel Processing, pp. 647\u2013658. Springer (2013)","DOI":"10.1007\/978-3-642-40047-6_65"},{"key":"338_CR13","unstructured":"Herrmann, J., Marchal, L., Robert, Y.: Memory-aware list scheduling for hybrid platforms. Rapport de recherche RR-8461, INRIA (2014). http:\/\/hal.inria.fr\/hal-00944336"},{"key":"338_CR14","doi-asserted-by":"crossref","unstructured":"Jian, G.A., Chu, J.C., Huang, T.Y., Chang, T.C., Guo, J.I.: A system architecture exploration on the configurable HW\/SW co-design for h.264 video decoder. In: Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on, pp. 2237\u20132240 (2009). doi: 10.1109\/ISCAS.2009.5118243","DOI":"10.1109\/ISCAS.2009.5118243"},{"issue":"4","key":"338_CR15","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31(4), 406\u2013471 (1999). doi: 10.1145\/344588.344618","journal-title":"ACM Comput. Surv."},{"key":"338_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Handb. Oper. Res. Manag. Sci. 4, 445\u2013522 (1993)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"9","key":"338_CR17","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.: Synchronous data flow. Proc. IEEE 75(9), 1235\u20131245 (1987)","journal-title":"Proc. IEEE"},{"key":"338_CR18","unstructured":"Lee, E.A., Ha, S.: Scheduling strategies for multiprocessor real-time DSP. IEEE Global Telecommunications inproceedings and Exhibition 2 (1989)"},{"issue":"3","key":"338_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/7921.11325","volume":"12","author":"JW Liu","year":"1986","unstructured":"Liu, J.W.: On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. TOMS 12(3), 249\u2013264 (1986)","journal-title":"ACM Trans. Math. Softw. TOMS"},{"key":"338_CR20","doi-asserted-by":"crossref","unstructured":"Marchal, L., Sinnen, O., Vivien, F.: Scheduling tree-shaped task graphs to minimize memory and makespan. In: Parallel & Distributed Processing (IPDPS), 2013 IEEE 27th International Symposium on, pp. 839\u2013850. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.55"},{"key":"338_CR21","unstructured":"Melpignano, D., Benini, L., Flamand, E., Jego, B., Lepley, T., Haugou, G., Clermidy, F., Dutoit, D.: Platform 2012, a many-core computing accelerator for embedded socs: performance evaluation of visual analytics applications. In: Design Automation Conference (DAC), 2012 49th ACM\/EDAC\/IEEE, pp. 1137\u20131142 (2012)"},{"issue":"2","key":"338_CR22","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1155\/S111086570431019X","volume":"2004","author":"S Saponara","year":"2004","unstructured":"Saponara, S., et al.: Performance and complexity co-evaluation of the advanced video coding standard for cost-effective multimedia communications. EURASIP J. Appl. Signal Process. 2004(2), 220\u2013235 (2004)","journal-title":"EURASIP J. Appl. Signal Process."},{"issue":"3","key":"338_CR23","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R Sethi","year":"1975","unstructured":"Sethi, R.: Complete register allocation problems. SIAM J. Comput. 4(3), 226\u2013248 (1975)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"338_CR24","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/j.future.2005.11.002","volume":"22","author":"Z Shi","year":"2006","unstructured":"Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilities. Futur. Gener. Comput. Syst. 22(6), 665\u2013675 (2006). doi: 10.1016\/j.future.2005.11.002","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"2","key":"338_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"GC Sih","year":"1993","unstructured":"Sih, G.C., Lee, E.A.: Compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parallel Distrib. Syst. 4(2), 175\u2013187 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"338_CR26","doi-asserted-by":"crossref","unstructured":"Sullivan, G., Ohm, J.R.: Recent developments in standardization of high efficiency video coding (HEVC). In: Proceedings of SPIE: The International Society for Optical Engineering, vol. 7798 (2010)","DOI":"10.1117\/12.863486"},{"key":"338_CR27","doi-asserted-by":"crossref","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Task scheduling algorithms for heterogeneous processors. In: 8th IEEE Heterogeneous Computing Workshop (HCW\u201999), pp. 3\u201314. San Juan, Puerto Rico (1999)","DOI":"10.1109\/HCW.1999.765092"},{"issue":"1","key":"338_CR28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s11265-005-6253-3","volume":"41","author":"SH Wang","year":"2005","unstructured":"Wang, S.H., et al.: A software-hardware co-implementation of mpeg-4 advanced video coding (AVC) decoder with block level pipelining. J. VLSI Signal Process. Syst. Signal Image Video Technol. 41(1), 93\u2013110 (2005)","journal-title":"J. VLSI Signal Process. Syst. Signal Image Video Technol."},{"issue":"7","key":"338_CR29","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TCSVT.2003.815165","volume":"13","author":"T Wiegand","year":"2003","unstructured":"Wiegand, T., et al.: Overview of the h.264\/AVC video coding standard. IEEE Trans. Circuits Syst. Video Technol. 13(7), 560\u2013576 (2003)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0338-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-014-0338-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0338-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T08:05:11Z","timestamp":1650614711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-014-0338-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,12]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["338"],"URL":"https:\/\/doi.org\/10.1007\/s10766-014-0338-1","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,12]]}}}