{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:22Z","timestamp":1763468122603},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642376573"},{"type":"electronic","value":"9783642376580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37658-0_5","type":"book-chapter","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T10:20:22Z","timestamp":1365157222000},"page":"61-75","source":"Crossref","is-referenced-by-count":8,"title":["Set and Relation Manipulation for the Sparse Polyhedral Framework"],"prefix":"10.1007","author":[{"given":"Michelle Mills","family":"Strout","sequence":"first","affiliation":[]},{"given":"Geri","family":"Georg","sequence":"additional","affiliation":[]},{"given":"Catherine","family":"Olschanowsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","first-page":"140","volume-title":"ICS 1988: Proceedings of the 2nd International Conference on Supercomputing","author":"R. Mirchandaney","year":"1988","unstructured":"Mirchandaney, R., Saltz, J.H., Smith, R.M., Nico, D.M., Crowley, K.: Principles of runtime support for parallel processors. In: ICS 1988: Proceedings of the 2nd International Conference on Supercomputing, pp. 140\u2013152. ACM, New York (1988)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0065-2458(08)60707-X","volume":"45","author":"J. Saltz","year":"1997","unstructured":"Saltz, J., Chang, C., Edjlali, G., Hwang, Y.S., Moon, B., Ponnusamy, R., Sharma, S., Sussman, A., Uysal, M., Agrawal, G., Das, R., Havlak, P.: Programming irregular applications: Runtime support, compilation and tools. Advances in Computers\u00a045, 105\u2013153 (1997)","journal-title":"Advances in Computers"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/S0167-8191(98)00024-6","volume":"24","author":"L. Rauchwerger","year":"1998","unstructured":"Rauchwerger, L.: Run-time parallelization: Its time has come. Parallel Computing\u00a024, 527\u2013556 (1998)","journal-title":"Parallel Computing"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF02577866","volume":"23","author":"L. Rauchwerger","year":"1995","unstructured":"Rauchwerger, L., Amato, N.M., Padua, D.A.: A scalable method for run-time loop parallelization. International Journal of Parallel Programming\u00a023, 537\u2013576 (1995)","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR5","first-page":"229","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"C. Ding","year":"1999","unstructured":"Ding, C., Kennedy, K.: Improving cache performance in dynamic applications through data and computation reorganization at run time. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 229\u2013241. ACM, New York (1999)"},{"key":"5_CR6","first-page":"192","volume-title":"Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT)","author":"N. Mitchell","year":"1999","unstructured":"Mitchell, N., Carter, L., Ferrante, J.: Localizing non-affine array references. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), pp. 192\u2013202. IEEE Computer Society, Los Alamitos (1999)"},{"key":"5_CR7","unstructured":"Im, E.J.: Optimizing the Performance of Sparse Matrix-Vector Multiply. Ph.d. thesis, University of California, Berkeley (2000)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1011119519789","volume":"29","author":"J. Mellor-Crummey","year":"2001","unstructured":"Mellor-Crummey, J., Whalley, D., Kennedy, K.: Improving memory hierarchy performance for irregular applications using data and computation reorderings. International Journal of Parallel Programming\u00a029, 217\u2013247 (2001)","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1024556711058","volume":"31","author":"V.K. Pingali","year":"2003","unstructured":"Pingali, V.K., McKee, S.A., Hsieh, W.C., Carter, J.B.: Restructuring computations for temporal data cache locality. International Journal of Parallel Programming\u00a031, 305\u2013338 (2003)","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/1122971.1122990","volume-title":"Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"A. Basumallik","year":"2006","unstructured":"Basumallik, A., Eigenmann, R.: Optimizing irregular shared-memory applications for distributed-memory systems. In: Proceedings of the Eleventh ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 119\u2013128. ACM Press, New York (2006)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Ravishankar, M., Eisenlohr, J., Pouchet, L.N., Ramanujam, J., Rountev, A., Sadayappan, P.: Code generation for parallel execution of a class of irregular loops on distributed memory systems. In: The International Conference for High Performance Computing, Networking, Storage, and Analysis, SC (2012)","DOI":"10.1109\/SC.2012.30"},{"key":"5_CR12","unstructured":"Douglas, C.C., Hu, J., Kowarschik, M., R\u00fcde, U., Wei\u00df., C.: Cache Optimization for Structured and Unstructured Grid Multigrid. Electronic Transaction on Numerical Analysis, 21\u201340 (2000)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1177\/1094342004041294","volume":"18","author":"M.M. Strout","year":"2004","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Kreaseck, B.: Sparse tiling for stationary iterative methods. International Journal of High Performance Computing Applications\u00a018, 95\u2013114 (2004)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"5_CR14","volume-title":"Supercomputing","author":"M. Mohiyuddin","year":"2009","unstructured":"Mohiyuddin, M., Hoemmen, M., Demmel, J., Yelick, K.: Minimizing communication in sparse matrix solvers. In: Supercomputing, ACM, New York (2009)"},{"key":"5_CR15","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"M.M. Strout","year":"2003","unstructured":"Strout, M.M., Carter, L., Ferrante, J.: Compile-time composition of run-time data and iteration reorderings. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), ACM, New York (2003)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"LaMielle, A., Strout, M.M.: Enabling code generation within the sparse polyhedral framework. Technical report, Technical Report CS-10-102 Colorado State University (2010)","DOI":"10.2172\/982358"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/71.97902","volume":"2","author":"M.E. Wolf","year":"1991","unstructured":"Wolf, M.E., Lam, M.S.: Loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems\u00a02, 452\u2013471 (1991)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem. part II. multidimensional time. International Journal of Parallel Programming\u00a021, 389\u2013420 (1992)","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR19","first-page":"175","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"V. Sarkar","year":"1992","unstructured":"Sarkar, V., Thekkath, R.: A general framework for iteration-reordering loop transformations. In: Fraser, C.W. (ed.) Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 175\u2013187. ACM, New York (1992)"},{"key":"5_CR20","unstructured":"Kelly, W., Pugh, W.: A unifying framework for iteration reordering transformations. Technical Report CS-TR-3430, University of Maryland, College Park (1995)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.scico.2005.10.013","volume":"62","author":"A. Cohen","year":"2006","unstructured":"Cohen, A., Donadio, S., Garzaran, M.J., Herrmann, C., Kiselyov, O., Padua, D.: In search of a program generator to implement generic transformations for high-performance computing. Sci. Comput. Program.\u00a062, 25\u201346 (2006)","journal-title":"Sci. Comput. Program."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","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.: The Polyhedral Model Is More Widely Applicable Than You Think. In: Gupta, R. (ed.) CC 2010. LNCS, vol.\u00a06011, pp. 283\u2013303. Springer, Heidelberg (2010)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0167-8191(95)00069-0","volume":"22","author":"J. Xue","year":"1996","unstructured":"Xue, J.: Transformations of nested loops with non-convex iteration spaces. Parallel Computing\u00a022, 339\u2013368 (1996)","journal-title":"Parallel Computing"},{"key":"5_CR24","unstructured":"Pugh, B., Wonnacott, D.: Nonlinear array dependence analysis. Technical Report CS-TR-3372, Dept. of Computer Science, Univ. of Maryland (1994)"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/358438.349322","volume":"35","author":"Y. Lin","year":"2000","unstructured":"Lin, Y., Padua, D.: Compiler analysis of irregular memory accesses. SIGPLAN Notices\u00a035, 157\u2013168 (2000)","journal-title":"SIGPLAN Notices"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jpdc.1996.1261","volume":"40","author":"D. Barthou","year":"1997","unstructured":"Barthou, D., Collard, J.F., Feautrier, P.: Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing\u00a040, 210\u2013226 (1997)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"5_CR27","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The omega calculator and library, version 1.1.0 (1996)"},{"key":"5_CR28","unstructured":"Chen, C., Hall, M., Venkat, A.: Omega+ (2012), \n                    \n                      http:\/\/ctop.cs.utah.edu\/ctop\/?page_id=21"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/2254064.2254123","volume-title":"Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012","author":"C. Chen","year":"2012","unstructured":"Chen, C.: Polyhedra scanning revisited. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, pp. 499\u2013508. ACM, New York (2012)"},{"key":"5_CR30","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"U. Bondhugula","year":"2008","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral program optimization system. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), ACM, New York (2008)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Hartono, A., Norris, B., Ponnuswamy, S.: Annotation-based empirical performance tuning using Orio. In: 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Rome, Italy (2009)","DOI":"10.1109\/IPDPS.2009.5161004"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-13374-9_4","volume-title":"Languages and Compilers for Parallel Computing","author":"M. Hall","year":"2010","unstructured":"Hall, M., Chame, J., Chen, C., Shin, J., Rudy, G., Khan, M.M.: Loop Transformation Recipes for Code Generation and Auto-Tuning. In: Gao, G.R., Pollock, L.L., Cavazos, J., Li, X. (eds.) LCPC 2009. LNCS, vol.\u00a05898, pp. 50\u201364. Springer, Heidelberg (2010)"},{"key":"5_CR33","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. Technical report, Colorado State University CS-12-101 (2012)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Yi, Q., Seymour, K., You, H., Vuduc, R., Quinlan, D.: Poet: Parameterized optimizations for empirical tuning. In: Proceedings of the Parallel and Distributed Processing Symposium (2007)","DOI":"10.1109\/IPDPS.2007.370637"},{"key":"5_CR35","unstructured":"Wood, S., Strout, M.M., Wonnacott, D.G., Eaton, E.: Smores: Sparse matrix omens of reordering success. Winning Poster at the PLDI Student Research Competition (2011)"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11596110_7","volume-title":"Languages and Compilers for Parallel Computing","author":"M.M. Strout","year":"2005","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Freeman, J., Kreaseck, B.: Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling. In: Pugh, B., Tseng, C.-W. (eds.) LCPC 2002. LNCS, vol.\u00a02481, pp. 90\u2013110. Springer, Heidelberg (2005)"},{"key":"5_CR37","unstructured":"Verdoolaege, S.: An integer set library for program analysis. In: Advances in the Theory of Integer Linear Optimization and its Extensions, AMS 2009 Spring Western Section Meeting, San Francisco, California (2009)"},{"key":"5_CR38","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: Proceedings of the 13th Interntional Conference on Parallel Architecture and Compilation Techniques, PACT (2004)"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37658-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T03:57:49Z","timestamp":1557633469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37658-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376573","9783642376580"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37658-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}