{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T11:40:54Z","timestamp":1687952454378},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11265-022-01826-8","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T07:45:00Z","timestamp":1675237500000},"page":"571-584","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating OpenVX through Halide and MLIR"],"prefix":"10.1007","volume":"95","author":[{"given":"Song-Lin","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xiang-Yu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ming-Yi","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Shih-Wei","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,1]]},"reference":[{"issue":"6","key":"1826_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2017","unstructured":"Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017). Imagenet classification with deep convolutional neural networks. Communications of the ACM, 60(6), 84\u201390. https:\/\/doi.org\/10.1145\/3065386","journal-title":"Communications of the ACM"},{"key":"1826_CR2","doi-asserted-by":"crossref","unstructured":"Baghdadi, R., Ray, J., Romdhane, M. B., Sozzo, E. D., Akkas, A., Zhang, Y., Suriana, P., Kamil, S., & Amarasinghe, S. (2018).\u00a0Tiramisu: A polyhedral compiler for expressing fast and portable code.","DOI":"10.1109\/CGO.2019.8661197"},{"key":"1826_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-11970-5_16","volume-title":"Compiler Construction","author":"M-W Benabderrahmane","year":"2010","unstructured":"Benabderrahmane, M.-W., Pouchet, L.-N., Cohen, A., & Bastoul, C. (2010). The polyhedral model is more widely applicable than you think. In R. Gupta (Ed.), Compiler Construction (pp. 283\u2013303). Berlin, Heidelberg: Springer."},{"key":"1826_CR4","doi-asserted-by":"publisher","unstructured":"Hartono, A., Baskaran, M. M., Bastoul, C., Cohen, A., Krishnamoorthy, S., Norris, B., Ramanujam, J., & Sadayappan, P. (2009).\u00a0Parametric multi-level tiling of imperfectly nested loops. In Proceedings of the 23rd International Conference on Supercomputing. ICS \u201909 (pp. 147\u2013157). Association for Computing Machinery, New York, NY, USA.\u00a0https:\/\/doi.org\/10.1145\/1542275.1542301","DOI":"10.1145\/1542275.1542301"},{"key":"1826_CR5","unstructured":"Tavarageri, S., Hartono, A., Baskaran, M., Pouchet, L.-N., Ramanujam, J., & Sadayappan, P. (2010). Parametric tiling of affine loop nests. In\u00a0Proceedings of the\u00a015th Workshop on Compilers for Parallel Computers, Vienna, Austria."},{"key":"1826_CR6","doi-asserted-by":"publisher","unstructured":"Maleki, S., Gao, Y., Garzar\u2019n, M. J., Wong, T., & Padua, D. A. (2011).\u00a0An evaluation of vectorizing compilers. In\u00a02011 International Conference on Parallel Architectures and Compilation Techniques (pp. 372\u2013382).\u00a0https:\/\/doi.org\/10.1109\/PACT.2011.68","DOI":"10.1109\/PACT.2011.68"},{"key":"1826_CR7","doi-asserted-by":"crossref","unstructured":"Giduthuri, R., & Pulli, K. (2016). OpenVX: A framework for accelerating computer vision. In SIGGRAPH ASIA 2016 Courses. https:\/\/doi.org\/10.1145\/2988458.2988513","DOI":"10.1145\/2988458.2988513"},{"key":"1826_CR8","doi-asserted-by":"publisher","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., & Amarasinghe, S. (2013).\u00a0Halide: A language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 519\u2013530). PLDI \u201913. Association for Computing Machinery, New York, NY, USA.\u00a0https:\/\/doi.org\/10.1145\/2491956.2462176","DOI":"10.1145\/2491956.2462176"},{"key":"1826_CR9","unstructured":"Abadi, M., Barham, P., Chen, J., Chen, Z., Davis, A., Dean, J., Devin, M., Ghemawat, S., Irving, G., Isard, M., Kudlur, M., Levenberg, J., Monga, R., Moore, S., Murray, D. G., Steiner, B., Tucker, P., Vasudevan, V., Warden, P., Wicke, M., Yu, Y., & Zheng, X. (2016). Tensorflow: A system for large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16) (pp. 265\u2013283). Retrieved September 20, 2021, from https:\/\/www.usenix.org\/conference\/osdi16\/technical-sessions\/presentation\/abadi"},{"key":"1826_CR10","doi-asserted-by":"publisher","unstructured":"Lattner, C., Amini, M., Bondhugula, U., Cohen, A., Davis, A., Pienaar, J., Riddle, R., Shpeisman, T., Vasilache, N., & Zinenko, O. (2021).\u00a0MLIR: Scaling compiler infrastructure for domain specific computation. In\u00a02021 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO) (pp. 2\u201314).\u00a0https:\/\/doi.org\/10.1109\/CGO51591.2021.9370308","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"1826_CR11","unstructured":"Bondhugula, U. (2020).\u00a0High performance code generation in MLIR: An early case study with GEMM. CoRR abs\/2003.00532.\u00a0arXiv:2003.00532"},{"key":"1826_CR12","doi-asserted-by":"crossref","unstructured":"Wang, E., et al. (2014). Intel Math Kernel Library. In High-performance computing on the Intel\u00ae Xeon Phi\u2122. Springer, Cham. Retrieved September 1, 2021, from https:\/\/doi.org\/10.1007\/978-3-319-06486-4_7","DOI":"10.1007\/978-3-319-06486-4_7"},{"key":"1826_CR13","doi-asserted-by":"publisher","unstructured":"Wang, Q., Zhang, X., Zhang, Y., & Yi, Q. (2013).\u00a0AUGEM: Automatically generate high performance dense linear algebra Kernels on x86 CPUS. In\u00a0SC \u201913: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (pp. 1\u201312).\u00a0https:\/\/doi.org\/10.1145\/2503210.2503219","DOI":"10.1145\/2503210.2503219"},{"key":"1826_CR14","doi-asserted-by":"publisher","unstructured":"Xianyi, Z., Qian, W., & Yunquan, Z. (2012).\u00a0Model-driven level 3 BLAS performance optimization on Loongson 3A processor. In\u00a02012 IEEE 18th International Conference on Parallel and Distributed Systems (pp. 684\u2013691).\u00a0https:\/\/doi.org\/10.1109\/ICPADS.2012.97","DOI":"10.1109\/ICPADS.2012.97"},{"key":"1826_CR15","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S. (2010).\u00a0ISL: An integer set library for the polyhedral model. In Proceedings of the Third International Congress Conference on Mathematical Software\u00a0(pp. 299\u2013302). ICMS\u201910. Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-15582-6_49"},{"key":"1826_CR16","doi-asserted-by":"crossref","unstructured":"Bastoul, C. (2004).\u00a0Code generation in the polyhedral model is easier than you think. In PACT\u201913 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, France (pp. 7\u201316).","DOI":"10.1109\/PACT.2004.1342537"},{"key":"1826_CR17","doi-asserted-by":"publisher","unstructured":"Goto, K., & Geijn, R. A. V. D. (2008).\u00a0Anatomy of high-performance matrix multiplication.\u00a0ACM Transactions on Mathematical Software, 34(3).\u00a0https:\/\/doi.org\/10.1145\/1356052.1356053","DOI":"10.1145\/1356052.1356053"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-022-01826-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01826-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T11:20:19Z","timestamp":1687951219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-022-01826-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,1]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1826"],"URL":"https:\/\/doi.org\/10.1007\/s11265-022-01826-8","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,1]]},"assertion":[{"value":"8 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare relevant to this article\u2019s content.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}