{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:18:16Z","timestamp":1770279496355,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642376573","type":"print"},{"value":"9783642376580","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37658-0_2","type":"book-chapter","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T10:20:22Z","timestamp":1365157222000},"page":"17-31","source":"Crossref","is-referenced-by-count":19,"title":["AlphaZ: A System for Design Space Exploration in the Polyhedral Model"],"prefix":"10.1007","author":[{"given":"Tomofumi","family":"Yuki","sequence":"first","affiliation":[]},{"given":"Gautam","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"DaeGon","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Tanveer","family":"Pathan","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Rajopadhye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: Proceedings of the 13th IEEE International Conference on Parallel Architecture and Compilation Techniques, PACT 2004, Washington, DC, USA, pp. 7\u201316 (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1375581.1375595","volume-title":"Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2008","author":"U. Bondhugula","year":"2008","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. In: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2008, pp. 101\u2013113. ACM, New York (2008)"},{"key":"2_CR3","unstructured":"Chen, C., Chame, J., Hall, M.: Chill: A framework for composing high-level loop transformations. U. of Southern California, Tech. Rep., pp. 08\u2013897 (2008)"},{"issue":"10","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/TC.2005.167","volume":"54","author":"A. Darte","year":"2005","unstructured":"Darte, A., Schreiber, R., Villard, G.: Lattice-based memory allocation. IEEE Transactions on Computers\u00a054(10), 1242\u20131257 (2005)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. International Journal of Parallel Programming\u00a020(1), 23\u201353 (1991)","journal-title":"International Journal of Parallel Programming"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1111037.1111041","volume-title":"POPL 2006: Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"G. Gautam","year":"2006","unstructured":"Gautam, G., Rajopadhye, S.: Simplifying reductions. In: POPL 2006: Conference Record of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 30\u201341. ACM, New York (2006)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/1542275.1542301","volume-title":"Proceedings of the 23rd International Conference on Supercomputing","author":"A. Hartono","year":"2009","unstructured":"Hartono, A., Baskaran, M.M., Bastoul, C., Cohen, A., Krishnamoorthy, S., Norris, B., Ramanujam, J., Sadayappan, P.: Parametric multi-level tiling of imperfectly nested loops. In: Proceedings of the 23rd International Conference on Supercomputing, pp. 147\u2013157. ACM, New York (2009)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Jouvelot, P., Triolet, R.: Semantical interprocedural parallelization: An overview of the pips project. In: Proceedings of the 5th International Conference on Supercomputing, pp. 244\u2013251. ACM (1991)","DOI":"10.1145\/109025.109086"},{"key":"2_CR9","unstructured":"Irisa, C.: The MMAlpha environment"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kelly, W., Pugh, W., Rosser, E.: Code generation for multiple mappings. In: Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation, pp. 332\u2013341. IEEE (1995)","DOI":"10.1109\/FMPC.1995.380437"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-13374-9_20","volume-title":"Languages and Compilers for Parallel Computing","author":"D. Kim","year":"2010","unstructured":"Kim, D., Rajopadhye, S.: Efficient Tiled Loop Generation: D-Tiling. In: Gao, G.R., Pollock, L.L., Cavazos, J., Li, X. (eds.) LCPC 2009. LNCS, vol.\u00a05898, pp. 293\u2013307. Springer, Heidelberg (2010)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-55599-4_101","volume-title":"PARLE \u201992. Parallel Architectures and Languages Europe","author":"H. Le Verge","year":"1992","unstructured":"Le Verge, H.: Reduction Operators in Alpha. In: Etiemble, D., Syre, J.-C. (eds.) PARLE 1992. LNCS, vol.\u00a0605, pp. 397\u2013411. Springer, Heidelberg (1992), see also, Le Verge Thesis (in French)"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/15.6.440","volume":"15","author":"R. Lyngs","year":"1999","unstructured":"Lyngs, R., Zuker, M., Pedersen, C., et al.: Fast evaluation of internal loops in rna secondary structure prediction. Bioinformatics\u00a015(6), 440\u2013445 (1999)","journal-title":"Bioinformatics"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-1-60327-429-6_1","volume":"453","author":"N. Markham","year":"2008","unstructured":"Markham, N., Zuker, M.: Software for nucleic acid folding and hybridization. Methods Mol. Biol.\u00a0453, 3\u201331 (2008)","journal-title":"Methods Mol. Biol."},{"key":"2_CR15","unstructured":"Mauras, C.: ALPHA: un langage \u00e9quationnel pour la conception et la programmation d\u2019architectures parall\u00e8les synchrones. Ph.D. thesis, L\u2019Universit\u00e9 de Rennes I, IRISA, Campus de Beaulieu, Rennes, France (December 1989)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Maydan, D., Amarasinghe, S., Lam, M.: Array-data flow analysis and its use in array privatization. In: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 2\u201315. ACM (1993)","DOI":"10.1145\/158511.158515"},{"key":"2_CR17","unstructured":"Meister, B., Leung, A., Vasilache, N., Wohlford, D., Bastoul, C., Lethin, R.: Productivity via automatic code generation for PGAS platforms with the R-Stream compiler. In: Workshop on Asynchrony in the PGAS Programming Model (2009)"},{"key":"2_CR18","unstructured":"Pathan, T.: RNA Secondary Structure Prediction using AlphaZ. Master\u2019s thesis, Colorado State University, Computer Science Department (August 2010)"},{"key":"2_CR19","unstructured":"Pop, S., Cohen, A., Bastoul, C., Girbal, S., Silber, G., Vasilache, N.: Graphite: Loop optimizations based on the polyhedral model for gcc (2006)"},{"key":"2_CR20","unstructured":"Pouchet, L.N.: PolyBench, http:\/\/www.cs.ucla.edu\/~pouchet\/software\/polybench\/"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/CGO.2007.21","volume-title":"IEEE\/ACM Fifth International Symposium on Code Generation and Optimization (CGO 2007)","author":"L.N. Pouchet","year":"2007","unstructured":"Pouchet, L.N., Bastoul, C., Cohen, A., Vasilache, N.: Iterative optimization in the polyhedral model: Part I, one-dimensional time. In: IEEE\/ACM Fifth International Symposium on Code Generation and Optimization (CGO 2007), pp. 144\u2013156. IEEE Computer Society Press, San Jose (2007)"},{"key":"2_CR22","unstructured":"Pouchet, L.N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P.: Hybrid iterative and model-driven optimization in the polyhedral model. Tech. Rep. 6962, INRIA Research Report (June 2009)"},{"issue":"5","key":"2_CR23","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1145\/365151.365152","volume":"22","author":"F. Quiller\u00e9","year":"2000","unstructured":"Quiller\u00e9, F., Rajopadhye, S.: Optimizing memory usage in the polyhedral model. ACM Trans. Program. Lang. Syst.\u00a022(5), 773\u2013815 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR24","unstructured":"Shen, T., Wonnacott, D.: Code generation for memory mappings. In: Proceedings of the 1998 Mid-Atlantic Student Workshop on Programming Languages and Systems (1998)"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/384265.291015","volume":"32","author":"M. Strout","year":"1998","unstructured":"Strout, M., Carter, L., Ferrante, J., Simon, B.: Schedule-independent storage mapping for loops. ACM SIGOPS Operating Systems Review\u00a032(5), 24\u201333 (1998)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"5","key":"2_CR26","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/381694.378852","volume":"36","author":"W. Thies","year":"2001","unstructured":"Thies, W., Vivien, F., Sheldon, J., Amarasinghe, S.: A unified framework for schedule and storage optimization. ACM SIGPLAN Notices\u00a036(5), 232\u2013242 (2001)","journal-title":"ACM SIGPLAN Notices"},{"key":"2_CR27","unstructured":"Vasilache, N., Meister, B., Hartono, A., Baskaran, M., Wohlford, D., Lethin, R.: Trading off memory for parallelism quality. In: International Workshop on Polyhedral Compilation Techniques, IMPACT (2012)"},{"key":"2_CR28","unstructured":"Vasilache, N.: Scalable Program Optimization Technique. The Polyhedral Model. Ph.D. thesis, University of Paris-Sud 11 (2007)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-15582-6_49","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S. Verdoolaege","year":"2010","unstructured":"Verdoolaege, S.: isl: An Integer Set Library for the Polyhedral Model. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol.\u00a06327, pp. 299\u2013302. Springer, Heidelberg (2010)"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1015460304860","volume":"30","author":"D. Wonnacott","year":"2002","unstructured":"Wonnacott, D.: Achieving scalable locality with time skewing. International Journal of Parallel Programming\u00a030(3), 181\u2013221 (2002)","journal-title":"International Journal of Parallel Programming"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Yi, Q.: Poet: a scripting language for applying parameterized source-to-source program transformations. Software: Practice and Experience (2011)","DOI":"10.1002\/spe.1089"},{"key":"2_CR32","unstructured":"Yuki, T., Basupalli, V., Gupta, G., Iooss, G., Kim, D., Pathan, T., Srinivasa, P., Zou, Y., Rajopadhye, S.: Alphaz: A system for analysis, transformation, and code generation in the polyhedral equational model. Tech. rep., CS-12-101, Colorado State University (2012)"},{"key":"2_CR33","unstructured":"Yuki, T., Gupta, G., Pathan, T., Rajopadhye, S.: Systematic implementation of fast-i-loop in UNAfold using AlphaZ. Tech. rep., CS-12-102, Colorado State University (2012)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37658-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T03:19:14Z","timestamp":1745983154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37658-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376573","9783642376580"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37658-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}