{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:39Z","timestamp":1750307619914,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004084","name":"Korea Science and Engineering Foundation","doi-asserted-by":"publisher","award":["R11-2008-007-01001-0"],"award-info":[{"award-number":["R11-2008-007-01001-0"]}],"id":[{"id":"10.13039\/501100004084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["R0A-2008-000-20110-0"],"award-info":[{"award-number":["R0A-2008-000-20110-0"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>Optimistic coalescing has been proven as an elegant and effective technique that provides better chances of safely coloring more registers in register allocation than other coalescing techniques. Its algorithm originally assumes homogeneous registers, which are all gathered in the same register file. Although this register architecture is still common in most general-purpose processors, embedded processors often contain heterogeneous registers, which are scattered in physically different register files dedicated for each dissimilar purpose and use. In this work, we show that optimistic coalescing is also useful for an embedded processor to better handle such heterogeneity of the register architecture, and developed a modified algorithm for optimal coalescing that helps a register allocator. In the experiment, an existing register allocator was able to achieve up to 13.0% reduction in code size through our coalescing, and avoid many spills that would have been generated without our scheme.<\/jats:p>","DOI":"10.1145\/1457255.1457263","type":"journal-article","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T16:42:19Z","timestamp":1234284139000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Register coalescing techniques for heterogeneous register architecture with copy sifting"],"prefix":"10.1145","volume":"8","author":[{"given":"Minwook","family":"Ahn","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunheung","family":"Paek","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,9]]},"reference":[{"volume-title":"Proceedings of the 11th Annual Workshop on the Interaction between Compilers and Computer Architecture. IEEE","author":"Ahn M.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/290833.290837"},{"key":"e_1_2_1_3_1","unstructured":"Bergner P. E. 1997. Spill Code Minimization Techniques for Graph Coloring Register Allocators. PhD thesis Minnesota University Minneapolis Minnesota.   Bergner P. E. 1997. Spill Code Minimization Techniques for Graph Coloring Register Allocators. PhD thesis Minnesota University Minneapolis Minnesota."},{"key":"e_1_2_1_4_1","unstructured":"Briggs P. 1992. Register allocation via graph coloring. PhD thesis Rice University Houston TX.   Briggs P. 1992. Register allocation via graph coloring. PhD thesis Rice University Houston TX."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800230.806984"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/997163.997192"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/62504.62674"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229546"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.4"},{"volume-title":"Proceedings of the 31th Annual ACM\/IEEE International Symposium on Microarchitecture. ACM","author":"Kong T.","key":"e_1_2_1_10_1"},{"volume-title":"Proceedings of the 30th Annual ACM\/IEEE International Symposium on Microarchitecture. IEEE","author":"Lee C.","key":"e_1_2_1_11_1"},{"volume-title":"Proceedings of the 19th International Workshop on Languages and Compilers for Parallel Computing (LCPC). Springer","author":"Lee J. K.","key":"e_1_2_1_12_1"},{"volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design. IEEE","author":"Liem C.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011508.1011512"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02406469"},{"key":"e_1_2_1_16_1","unstructured":"Stallman R. M. 1994. Using and Porting GNU CC. Free Software Foundation Cambridge MA.  Stallman R. M. 1994. Using and Porting GNU CC. Free Software Foundation Cambridge MA."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/513829.513854"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996875"},{"volume-title":"Proceedings of the International Conference on Signal Processing and Technology. IEEE","author":"Zivojnovic V.","key":"e_1_2_1_19_1"},{"volume-title":"Proceedings of the 9th International Symposium on System Synthesis. IEEE","author":"Zivojnovic V.","key":"e_1_2_1_20_1"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1457255.1457263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1457255.1457263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:48Z","timestamp":1750250748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1457255.1457263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1145\/1457255.1457263"],"URL":"https:\/\/doi.org\/10.1145\/1457255.1457263","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2009,1]]},"assertion":[{"value":"2007-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}