{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:06:48Z","timestamp":1747886808242,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319151465"},{"type":"electronic","value":"9783319151472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15147-2_34","type":"book-chapter","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T14:46:02Z","timestamp":1426776362000},"page":"409-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["TRACO Parallelizing Compiler"],"prefix":"10.1007","author":[{"given":"Marek","family":"Palkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"key":"34_CR1","unstructured":"Amini, M., et al.: PIPS Is not (just) Polyhedral Software. In: International Workshop on Polyhedral Compilation Techniques (IMPACT\u201911). Chamonix, France April 2011"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT\u201913 IEEE International Conference on Parallel Architecture and Compilation Techniques. pp. 7\u201316. Juan-les-Pins September 2004","DOI":"10.1109\/PACT.2004.1342537"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.parco.2010.12.005","volume":"37","author":"A Beletska","year":"2011","unstructured":"Beletska, A., Bielecki, W., Cohen, A., Palkowski, M., Siedlecki, K.: Coarse-grained loop parallelization: Iteration space slicing vs affine transformations. Parallel Comput. 37, 479\u2013497 (2011)","journal-title":"Parallel Comput."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science, LNCS 7174","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-30397-5_7","volume-title":"Facing the Multicore - Challenge II","author":"W Bielecki","year":"2012","unstructured":"Bielecki, W., Palkowski, M.: Using free scheduling for programming graphic cards. In: Keller, R., Kramer, D., Weiss, J.P. (eds.) Facing the Multicore - Challenge II. Lecture Notes in Computer Science, LNCS 7174, pp. 72\u201383. Springer, Berlin (2012)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. In: Proceedings of SIGPLAN Not. 43(6), 101\u2013113 (June 2008), http:\/\/pluto-compiler.sourceforge.net","DOI":"10.1145\/1379022.1375595"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science, LNCS 4959","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-78791-4_9","volume-title":"Compiler Constructure","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula, U., et al.: Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Hendren, L. (ed.) Compiler Constructure. Lecture Notes in Computer Science, LNCS 4959, pp. 132\u2013146. Springer, Heidelberg (2008)"},{"key":"34_CR7","unstructured":"Chen, C.: Omega+ library. School of Computing University of Utah, (February 2011), http:\/\/www.cs.utah.edu\/chunchen\/omega\/"},{"key":"34_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1362-8","volume-title":"Scheduling and Automatic Parallelization","author":"A Darte","year":"2000","unstructured":"Darte, A., Robert, Y., Vivien, F.: Scheduling and Automatic Parallelization. Birkhauser, Boston (2000)"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1109\/MC.2009.385","volume":"42","author":"C Dave","year":"2009","unstructured":"Dave, C., Bae, H., Min, S.J., Lee, S., Eigenmann, R., Midkiff, S.: Cetus: A source-to-source compiler infrastructure for multicores. Computer 42, 36\u201342 (2009)","journal-title":"Computer"},{"key":"34_CR10","unstructured":"Intel $${}^{\\textregistered }$$ Compilers (2013), http:\/\/software.intel.com\/en-us\/intel-compilers"},{"key":"34_CR11","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The omega library interface guide. Technical report, College Park (1995)"},{"issue":"6","key":"34_CR12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W Kelly","year":"1996","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive closure of infinite graphs and its applications. Int. J. Parallel Program. 24(6), 579\u2013598 (1996)","journal-title":"Int. J. Parallel Program."},{"key":"34_CR13","volume-title":"Optimizing compilers for modern architectures: a dependence-based approach","author":"K Kennedy","year":"2002","unstructured":"Kennedy, K., Allen, J.R.: Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann Publishers Inc., CA (2002)"},{"key":"34_CR14","unstructured":"Mehdi, A.: Par4All User Guide (2012), http:\/\/www.par4all.org"},{"key":"34_CR15","unstructured":"NAS benchmarks suite. http:\/\/www.nas.nasa.gov"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Padua, D.A. (ed.): Encyclopedia of Parallel Computing. Springer (2011)","DOI":"10.1007\/978-0-387-09766-4"},{"key":"34_CR17","unstructured":"Polylib - a library of polyhedral functions, http:\/\/icps.u-strasbg.fr\/polylib"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing. Springer, Berlin (1993)","DOI":"10.1007\/3-540-57659-2_31"},{"key":"34_CR19","unstructured":"The Polyhedral Benchmark suite (2012), http:\/\/www.cse.ohio-state.edu\/pouchet\/software\/polybench\/"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Cohen, A., Beletska, A.: Transitive closures of affine integer tuple relations and their overapproximations. In: Proceedings of the 18th international conference on Static analysis, SAS\u201911. pp. 216\u2013232. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-23702-7_18"}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing in Computer and Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15147-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:13:32Z","timestamp":1747800812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15147-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319151465","9783319151472"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15147-2_34","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}