{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:51Z","timestamp":1750307811949,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T00:00:00Z","timestamp":1212796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,7]]},"DOI":"10.1145\/1375527.1375564","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"245-255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic SIMD vectorization of chains of recurrences"],"prefix":"10.1145","author":[{"given":"Yixin","family":"Shou","sequence":"first","affiliation":[{"name":"Florida State University, Tallahassee, FL, USA"}]},{"given":"Robert A.","family":"van Engelen","sequence":"additional","affiliation":[{"name":"Florida State University, Tallahassee, FL, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"SWI-Prolog's Home. Available from http:\/\/www.swi-prolog.org\/.]]  SWI-Prolog's Home. Available from http:\/\/www.swi-prolog.org\/.]]"},{"key":"e_1_3_2_1_2_1","unstructured":"Intel Math Kernel Library Reference Manual March 2007. Intel Document number: 630813-025US.]]  Intel Math Kernel Library Reference Manual March 2007. Intel Document number: 630813-025US.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"Compilers: Principles, Techniques and Tools","author":"Aho A.","year":"1985","unstructured":"A. Aho , R. Sethi and J. Ullman . Compilers: Principles, Techniques and Tools . Addison-Wesley Publishing Company , Reading MA , 1985 .]] A. Aho, R. Sethi and J. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, Reading MA, 1985.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/212094.212131"},{"key":"e_1_3_2_1_5_1","volume-title":"Morgan Kaufmann","author":"Allen R.","year":"2002","unstructured":"R. Allen and K. Kennedy . Optimizing Compilers for Modern Architectures . Morgan Kaufmann , 2002 .]] R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan Kaufmann, 2002.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190423"},{"key":"e_1_3_2_1_8_1","volume-title":"Applying Intel Multimedia Extensions for Maximum Performance","author":"Bik A. J. C.","year":"2004","unstructured":"A. J. C. Bik . Software Vectorization Handbook, The : Applying Intel Multimedia Extensions for Maximum Performance . Intel Press , 2004 .]] A. J. C. Bik. Software Vectorization Handbook, The: Applying Intel Multimedia Extensions for Maximum Performance. Intel Press, 2004.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Intel","author":"Kylex L.","year":"2004","unstructured":"L. Kylex . How to Avoid Bottlenecks in Simple Math Functions. Available from http:\/\/softwarecommunity.intel.com\/articles\/eng\/3524.htm , Intel 2004 .]] L. Kylex. How to Avoid Bottlenecks in Simple Math Functions. Available from http:\/\/softwarecommunity.intel.com\/articles\/eng\/3524.htm, Intel 2004.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"TR-000102, Computer Science Dept.","author":"van Engelen R.","year":"2000","unstructured":"R. van Engelen . Symbolic Evaluation of Chains of Recurrences for Loop Optimization. Technical report , TR-000102, Computer Science Dept. , Florida State University , 2000 .]] R. van Engelen. Symbolic Evaluation of Chains of Recurrences for Loop Optimization. Technical report, TR-000102, Computer Science Dept., Florida State University, 2000.]]"},{"key":"e_1_3_2_1_11_1","first-page":"118","volume-title":"Efficient Symbolic Analysis for Optimizing Compilers. In proceedings of the ETAPS Conference on Compiler Construction 2001, LNCS 2027","author":"van Engelen R.","year":"2001","unstructured":"R. van Engelen . Efficient Symbolic Analysis for Optimizing Compilers. In proceedings of the ETAPS Conference on Compiler Construction 2001, LNCS 2027 , pages 118 -- 132 , 2001 .]] R. van Engelen. Efficient Symbolic Analysis for Optimizing Compilers. In proceedings of the ETAPS Conference on Compiler Construction 2001, LNCS 2027, pages 118--132, 2001.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1006209.1006226"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"R. van Engelen and K. Gallivan. An Efficient Algorithm for Pointer-to-Array Access Conversion for Compiling and Optimizing DSP Applications. In proceedings of the International Workshop on Innovative Architectures for Future Generation High--Performance Processors and Systems (IWIA) 2001 pages 80--89 Maui Hawaii 2001.]]   R. van Engelen and K. Gallivan. An Efficient Algorithm for Pointer-to-Array Access Conversion for Compiling and Optimizing DSP Applications. In proceedings of the International Workshop on Innovative Architectures for Future Generation High--Performance Processors and Systems (IWIA) 2001 pages 80--89 Maui Hawaii 2001.]]","DOI":"10.1109\/IWIA.2001.955200"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/237578.237589"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222693"},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"Conference Record","author":"Yuen A. K.","year":"1988","unstructured":"A. K. Yuen . Intel's Floating--Point Processors. In Electro\/88 Conference Record , pages 48\/5\/ 1 -- 7 , 1988 .]] A. K. Yuen. Intel's Floating--Point Processors. In Electro\/88 Conference Record, pages 48\/5\/1--7, 1988.]]"},{"key":"e_1_3_2_1_17_1","first-page":"152","volume-title":"proceedings of DISCO'92","author":"Zima E. V.","year":"1992","unstructured":"E. V. Zima . Recurrent Relations and Speed-up of Computations using Computer Algebra Systems . In proceedings of DISCO'92 , pages 152 -- 161 . LNCS 721, 1992 .]] E. V. Zima. Recurrent Relations and Speed-up of Computations using Computer Algebra Systems. In proceedings of DISCO'92, pages 152--161. LNCS 721, 1992.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"USSR Computational Mathematics and Mathematical Physics, 24(11--12):193--197","author":"Zima E. V.","year":"1986","unstructured":"E. V. Zima . Automatic construction of systems of recurrence relations. USSR Computational Mathematics and Mathematical Physics, 24(11--12):193--197 , 1986 .]] E. V. Zima. Automatic construction of systems of recurrence relations. USSR Computational Mathematics and Mathematical Physics, 24(11--12):193--197, 1986.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/384101.384148"},{"key":"e_1_3_2_1_20_1","first-page":"620","volume-title":"Mapping Techniques for Parallel Evaluation of Chains of Recurrences. In IPPS '96: Proceedings of the 10th International Parallel Processing Symposium","author":"Zima E. V.","year":"1996","unstructured":"E. V. Zima , K. R. Vadivelu and T. L. Casavant . Mapping Techniques for Parallel Evaluation of Chains of Recurrences. In IPPS '96: Proceedings of the 10th International Parallel Processing Symposium , pages 620 -- 624 , Washington, DC, USA , 1996 . IEEE Computer Society.]] E. V. Zima, K. R. Vadivelu and T. L. Casavant. Mapping Techniques for Parallel Evaluation of Chains of Recurrences. In IPPS '96: Proceedings of the 10th International Parallel Processing Symposium, pages 620--624, Washington, DC, USA, 1996. IEEE Computer Society.]]"}],"event":{"name":"ICS08: International Conference on Supercomputing","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Island of Kos Greece","acronym":"ICS08"},"container-title":["Proceedings of the 22nd annual international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375527.1375564","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1375527.1375564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:37Z","timestamp":1750255057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375527.1375564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,7]]},"references-count":19,"alternative-id":["10.1145\/1375527.1375564","10.1145\/1375527"],"URL":"https:\/\/doi.org\/10.1145\/1375527.1375564","relation":{},"subject":[],"published":{"date-parts":[[2008,6,7]]},"assertion":[{"value":"2008-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}