{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:29:11Z","timestamp":1768069751471,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725206","type":"print"},{"value":"9783540725213","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72521-3_13","type":"book-chapter","created":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T16:53:29Z","timestamp":1181494409000},"page":"158-172","source":"Crossref","is-referenced-by-count":3,"title":["An Effective Heuristic for Simple Offset Assignment with Variable Coalescing"],"prefix":"10.1007","author":[{"given":"Hassan","family":"Salamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ramanujam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45574-4_11","volume-title":"Languages and Compilers for Parallel Computing","author":"S. Atri","year":"2001","unstructured":"Atri, S., Ramanujam, J., Kandemir, M.: Improving Offset Assignment for Embedded Processors. In: Midkiff, S.P., et al. (eds.) LCPC 2000. LNCS, vol.\u00a02017, Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR2","first-page":"102","volume":"22","author":"D.H. Bartley","year":"1992","unstructured":"Bartley, D.H.: Optimizing Stack Frame Accesses for Processors with Restricted Addressing Modes. Software-Practice and Experience\u00a022(2), 102\u2013111 (1992)","journal-title":"Software-Practice and Experience"},{"issue":"4598","key":"13_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"13_CR4","first-page":"330","volume-title":"Proc. IEEE International Symposium on Microarchitecture","author":"C. Lee","year":"1997","unstructured":"Lee, C., Potkonjak, M., Mangione-Smith, W.: MediaBench: A Tool for Evaluating and Synthesizing Multimedia and Communications Systems. In: Proc. IEEE International Symposium on Microarchitecture, pp. 330\u2013335. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Leupers, R.: Code Generation for Embedded Processors. In: Proc. 13th International System Synthesis Symposium (ISSS) (2000)","DOI":"10.1109\/ISSS.2000.874046"},{"key":"13_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3169-9","volume-title":"Code Optimization Techniques for Embedded Processors","author":"R. Leupers","year":"2000","unstructured":"Leupers, R.: Code Optimization Techniques for Embedded Processors. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36579-6_21","volume-title":"Compiler Construction","author":"R. Leupers","year":"2003","unstructured":"Leupers, R.: Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms. In: Hedin, G. (ed.) CC 2003 and ETAPS 2003. LNCS, vol.\u00a02622, Springer, Heidelberg (2003)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Leupers, R., David, F.: A Uniform Optimization Technique for Offset Assignment Problems. In: Proc. 11th International System Synthesis Symposium (ISSS) (1998)","DOI":"10.1109\/ISSS.1998.730589"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Leupers, R., Marwedel, P.: Algorithms for Address Assignment in DSP Code Generation. In: Proc. International Conference on Computer-Aided Design (ICCAD) (1996)","DOI":"10.1109\/ICCAD.1996.569409"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Li, B., Gupta, R.: Simple Offset Assignment in Presence of Subword Data. In: Proc. International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES 2003), pp. 12\u201323 (2003)","DOI":"10.1145\/951710.951715"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Liao, S.: Code Generation and Optimization for Embedded Digital Signal Processors. Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1996)","DOI":"10.1007\/978-94-009-0187-2_7"},{"key":"13_CR12","volume-title":"Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"S. Liao","year":"1995","unstructured":"Liao, S., et al.: Storage Assignment to Decrease Code Size. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), ACM Press, New York (1995)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-540-39920-9_20","volume-title":"Software and Compilers for Embedded Systems","author":"D. Ottoni","year":"2003","unstructured":"Ottoni, D., et al.: Improving Offset Assignment through simultaneous Variable Coalescing. In: Krall, A. (ed.) SCOPES 2003. LNCS, vol.\u00a02826, pp. 285\u2013297. Springer, Heidelberg (2003)"},{"key":"13_CR14","unstructured":"OffsetStone. http:\/\/www.address-code-optimization.org"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-45306-7_19","volume-title":"Compiler Construction","author":"G. Ottoni","year":"2001","unstructured":"Ottoni, G., et al.: Optimal Live Range Merge for Address Register Allocation in Embedded Programs. In: Wilhelm, R. (ed.) CC 2001 and ETAPS 2001. LNCS, vol.\u00a02027, pp. 274\u2013288. Springer, Heidelberg (2001)"},{"key":"13_CR16","first-page":"128","volume-title":"Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"A. Rao","year":"1999","unstructured":"Rao, A., Pande, S.: Storage Assignment Optimizations to Generate Compact and Efficient Code on Embedded DSPs. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 128\u2013138. ACM Press, New York (1999)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Sudarsanam, A., Liao, S., Devadas, S.: Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures. In: Proc. Design Automation Conference, pp. 287\u2013292 (1997)","DOI":"10.1109\/DAC.1997.597159"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Udayanarayanan, S., Chakrabarti, C.: Address Code Generation for Digital Signal Processors. In: Proc. 38th Design Automation Conference (DAC) (2001)","DOI":"10.1145\/378239.378521"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Wess, B., Gotschlich, M.: Optimal DSP Memory Layout Generation as a Quadratic Assignment Problem. In: Proc, International Symposium on Circuits and Systems (ISCAS) (1997)","DOI":"10.1109\/ISCAS.1997.621465"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Wess, B., Zeitlhofer, T.: Optimum Address pointer Assignment for Digital Signal Processors. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2004)","DOI":"10.1109\/ICASSP.2004.1327062"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1145\/780732.780763","volume-title":"Proc. ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems (LCTES)","author":"X. Zhuang","year":"2003","unstructured":"Zhuang, X., Lau, C., Pande, S.: Storage Assignment Optimizations Through Variable Coalescence for Embedded Processors. In: Proc. ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems (LCTES), pp. 220\u2013231. ACM Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72521-3_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:11Z","timestamp":1605764051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72521-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725206","9783540725213"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72521-3_13","relation":{},"subject":[]}}