{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:27Z","timestamp":1725490227601},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44681-8_32","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"207-220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Handling Irreducible Loops: Optimized Node Splitting vs. DJ-Graphs"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Unger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Mueller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"32_CR1","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers-Principles, Techniques, and Tools. Addison-Wesley, 1986."},{"issue":"7","key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"F. Allen","year":"1970","unstructured":"F. Allen. Control flow analysis. Sigplan Notices, 5(7):1\u201319, 1970.","journal-title":"Sigplan Notices"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"M. E. Benitez and J. W. Davidson. A portable global optimizer and linker. In ACM SIGPLAN Conf. on Programming Language Design and Impl., pages 329\u2013338, June 1988.","DOI":"10.1145\/960116.54023"},{"key":"32_CR4","unstructured":"J. Cocke and J. Miller. Some analysis techniques for optimizing computer programs. In 2nd Hawaii Conference on System Sciences, pages 143\u2013146, 1969."},{"issue":"4","key":"32_CR5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/262004.262005","volume":"19","author":"P. Havlak","year":"1997","unstructured":"P. Havlak. Nesting if reducible and irreducible loops. ACM Trans. Programming Languages and Systems, 19(4):557\u2013567, July 1997.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"32_CR6","unstructured":"J. Hoogerbrugge and L. Augusteijn. Instruction scheduling for trimedia. Journal of Instruction-Level Parallelsim, 1(1\u20132), 1999. \n                    http:\/\/www.jilp.org\n                    \n                  ."},{"issue":"6","key":"32_CR7","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1145\/267959.269971","volume":"19","author":"J. Janssen","year":"1997","unstructured":"J. Janssen and H. Corporaal. Making graphs reducible with controlled node splitting. ACM Trans. Programming Languages and Systems, 19(6):1031\u20131052, November 1997.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"F. Mueller and D. B. Whalley. Avoiding unconditional jumps by code replication. In ACM SIGPLAN Conf. on Programming Language Design and Impl., pages 322\u2013330, June 1992.","DOI":"10.1145\/143103.143144"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"F. Mueller and D. B. Whalley. Avoiding conditional branches by code replication. In ACM SIGPLAN Conf. on Programming Language Design and Impl., pages 56\u201366, June 1995.","DOI":"10.1145\/223428.207116"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"G. Ramalingam. On loop, dominators, and dominance frontier. In ACM SIGPLAN Conf. on Programming Language Design and Impl., pages 233\u2013241, June 2000.","DOI":"10.1145\/358438.349330"},{"issue":"6","key":"32_CR11","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/236114.236115","volume":"18","author":"V. Sreedhar","year":"1996","unstructured":"V. Sreedhar, G. Gao, and Y. Lee. Identifying loops using DJ graphs. ACM Trans. Programming Languages and Systems, 18(6):649\u2013658, November 1996.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"32_CR12","volume-title":"TR 146","author":"S. Unger","year":"2001","unstructured":"S. Unger and F. Mueller. Handling irreducible loops: Optimized node splitting vs. dj-graphs. TR 146, Inst. f. Informatik, Humbolt University Berlin, January 2001. \n                    http:\/\/www.informatik.hu-berlin.de\/~mueller\n                    \n                  ."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Nancy J. Warter, Grant E. Haab, Krishna Subramanian, and John W. Bockhaus. Enhanced modulo scheduling for loops with conditional branches. In 25th Annual International Symposium on Microarchitecture (MICRO-25), pages 170\u2013179, 1992.","DOI":"10.1145\/144965.145796"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:10:34Z","timestamp":1587341434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}