{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:10:58Z","timestamp":1740175858803,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642133732"},{"type":"electronic","value":"9783642133749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13374-9_29","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:15:59Z","timestamp":1276168559000},"page":"408-415","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Local Memory Allocation and Assignment through a Decoupled Approach"],"prefix":"10.1007","author":[{"given":"Boubacar","family":"Diouf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozcan","family":"Ozturk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Fabri, J.: Automatic storage optimization. In: ACM Symp. on Compiler Construction, pp. 83\u201391 (1979)","DOI":"10.1145\/800229.806957"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Appel, A.W., George, L.: Optimal spilling for CISC machines with few registers. In: PLDI 2001, Snowbird, Utah, USA, June 2001, pp. 243\u2013253 (2001)","DOI":"10.1145\/378795.378854"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Guillon, C., Rastello, F.: Register allocation: What does the NP-completeness proof of Chaitin et al. really prove? In: WDDD 2006, Boston, MA (2006)","DOI":"10.1007\/978-3-540-72521-3_21"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/11688839_20","volume-title":"Compiler Construction","author":"S. Hack","year":"2006","unstructured":"Hack, S., Grund, D., Goos, G.: Register allocation for programs in SSA-form. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 247\u2013262. Springer, Heidelberg (2006)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-72521-3_21","volume-title":"Languages and Compilers for Parallel Computing","author":"F. Bouchez","year":"2007","unstructured":"Bouchez, F., Darte, A., Guillon, C., Rastello, F.: Register allocation: What does the NP-completeness proof of Chaitin et al. really prove? or revisiting register allocation: Why and how. In: Alm\u00e1si, G.S., Ca\u015fcaval, C., Wu, P. (eds.) LCPC 2006. LNCS, vol.\u00a04382, pp. 283\u2013298. Springer, Heidelberg (2007)"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/1379022.1375609","volume":"43","author":"F.M. Quint\u00e1o Pereira","year":"2008","unstructured":"Quint\u00e1o Pereira, F.M., Palsberg, J.: Register allocation by puzzle solving. SIGPLAN Not.\u00a043(6), 216\u2013226 (2008)","journal-title":"SIGPLAN Not."},{"key":"29_CR7","unstructured":"ARM: Document No. ARM DDI 0084D, ARM Ltd. ARM7TDMI-S data sheet (1998)"},{"key":"29_CR8","unstructured":"Motorola: M-CORE \u2013 MMC 2001 reference manual, Motorola Corporation (1998)"},{"key":"29_CR9","unstructured":"Instruments, T.: TMS370Cx7x 8-bit microcontroller, Texas Instruments (1997)"},{"key":"29_CR10","unstructured":"NVIDIA: NVIDIA unified architecture GeForce 8800 GT (2008)"},{"key":"29_CR11","unstructured":"Burns, M., Prier, G., Mirkovic, J., Reiher, P.: Implementing address assurance in the Intel IXP (2003)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Kahle, J.A., Day, M.N., Hofstee, H.P., Johns, C.R., Maeurer, T.R., Shippy, D.: Introduction to the Cell multiprocessor. IBM Journal of Research and Development\u00a049(4\/5) (2005)","DOI":"10.1147\/rd.494.0589"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: On the complexity of register coalescing. In: CGO 2007 (2007)","DOI":"10.1109\/CGO.2007.26"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Bouchez, F., Darte, A., Rastello, F.: Advanced conservative and optimistic register coalescing. In: CASES 2008, pp. 147\u2013156 (2008)","DOI":"10.1145\/1450095.1450119"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Boissinot, B., Darte, A., de Dinechin, B.D., Guillon, C., Rastello, F.: Revisiting out-of-SSA translation for correctness, code quality and efficiency. In: CGO 2009, pp. 114\u2013125 (2009)","DOI":"10.1109\/CGO.2009.19"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Udayakumaran, S., Barua, R.: Compiler-decided dynamic memory allocation for scratch-pad based embedded systems. In: CASES 2003, pp. 276\u2013286 (2003)","DOI":"10.1145\/951710.951747"},{"issue":"2","key":"29_CR17","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1145\/1151074.1151085","volume":"5","author":"S. Udayakumaran","year":"2006","unstructured":"Udayakumaran, S., Dominguez, A., Barua, R.: Dynamic allocation for scratch-pad memory using compile-time decisions. ACM Trans. Embed. Comput. Syst.\u00a05(2), 472\u2013511 (2006)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Kandemir, M., Ramanujam, J., Irwin, J., Vijaykrishnan, N., Kadayif, I., Parikh, A.: Dynamic management of scratch-pad memory space. In: DAC 2001, pp. 690\u2013695 (2001)","DOI":"10.1145\/378239.379049"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Li, L., Gao, L., Xue, J.: Memory coloring: A compiler approach for scratchpad memory management. In: PACT 2005, pp. 329\u2013338 (2005)","DOI":"10.1109\/PACT.2005.27"},{"key":"29_CR20","unstructured":"Lee, C.G.: UTDSP benchmarks (1998)"},{"key":"29_CR21","volume-title":"High Performance Compilers for Parallel Computing","author":"M.J. Wolfe","year":"1995","unstructured":"Wolfe, M.J.: High Performance Compilers for Parallel Computing. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Dominguez, A., Nguyen, N., Barua, R.K.: Recursive function data allocation to scratch-pad memory. In: CASES 2007, pp. 65\u201374 (2007)","DOI":"10.1145\/1289881.1289897"},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1230800.1230807","volume":"12","author":"I. Issenin","year":"2007","unstructured":"Issenin, I., Brockmeyer, E., Miranda, M., Dutt, N.: DRDU: A data reuse analysis technique for efficient scratch-pad memory management. ACM Trans. Des. Autom. Electron. Syst.\u00a012(2), 15 (2007)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/581888.581891","volume":"1","author":"O. Avissar","year":"2002","unstructured":"Avissar, O., Barua, R., Stewart, D.: An optimal memory allocation scheme for scratch-pad-based embedded systems. ACM Trans. Embed. Comput. Syst.\u00a01(1), 6\u201326 (2002)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"issue":"1","key":"29_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.2004.1255787","volume":"53","author":"V. Luz De La","year":"2004","unstructured":"De La Luz, V., Kandemir, M.: Array regrouping and its use in compiling data-intensive embedded applications. IEEE Trans. Comput.\u00a053(1), 1\u201319 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Kodukula, I., Ahmed, N., Pingali, K.: Data-centric multi-level blocking. In: PLDI 1997, Las Vegas, Nevada, June 1997, pp. 346\u2013357 (1997)","DOI":"10.1145\/258915.258946"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Knobe, K., Sarkar, V.: Array SSA form and its use in parallelization. In: ACM Conf. on Principles of Programming Languages (PoPL 2008), San Diego, CA, January 1998, pp. 107\u2013120 (1998)","DOI":"10.1145\/268946.268956"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Rus, S., He, G., Alias, C., Rauchwerger, L.: Region array SSA. In: PACT 2006, pp. 43\u201352 (2006)","DOI":"10.1145\/1152154.1152165"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Belady, L.A.: A study of replacement algorithms for virtual storage computers. In: 9th Annual ACM-SIAM Symposium on Discrete Algorithms,","DOI":"10.1147\/sj.52.0078"},{"key":"29_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/109434208900300302","volume":"3","author":"M. Berry","year":"1988","unstructured":"Berry, M., et al.: The perfect club benchmarks: Effective performance evaluation of supercomputers. International Journal of Supercomputer Applications\u00a03, 5\u201340 (1988)","journal-title":"International Journal of Supercomputer Applications"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13374-9_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:42:19Z","timestamp":1740174139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13374-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642133732","9783642133749"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13374-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}