{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:40:47Z","timestamp":1783035647994,"version":"3.54.6"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T00:00:00Z","timestamp":1361404800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10766-013-0241-1","type":"journal-article","created":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T12:37:04Z","timestamp":1361363824000},"page":"704-750","source":"Crossref","is-referenced-by-count":40,"title":["Predictive Modeling in a Polyhedral Optimization Space"],"prefix":"10.1007","volume":"41","author":[{"given":"Eunjung","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Cavazos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9dric","family":"Bastoul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,2,21]]},"reference":[{"key":"241_CR1","doi-asserted-by":"crossref","unstructured":"Agakov, F., Bonilla, E., Cavazos, J., Franke, B., Fursin, G., O\u2019Boyle, M., Thomson, J., Toussaint, M., Williams, C.: Using machine learning to focus iterative optimization. In: Proceedings of the International Symposium on Code Generation and Optimization (CGO) (2006)","DOI":"10.1109\/CGO.2006.37"},{"key":"241_CR2","first-page":"37","volume":"6","author":"DW Aha","year":"1991","unstructured":"Aha, D.W., Kibler, D., Albert, M.K.: Instance-based learning algorithms. Int. J. Mach. Learn. 6, 37\u201366 (1991)","journal-title":"Int. J. Mach. Learn."},{"key":"241_CR3","doi-asserted-by":"crossref","unstructured":"Almagor, L., Cooper, K., Grosul, A., Harvey, T., Reeves, S., Subramanian, D., Torczon, L., Waterman, T.: Finding effective compilation sequences. In: Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), pp. 231\u2013239. New York (2004)","DOI":"10.1145\/997163.997196"},{"key":"241_CR4","unstructured":"Anderson, E., Bai, Z., Dongarra, J., Greenbaum, A., McKenney, A., Du Croz, J., Hammerling, S., Demmel, J., Bischof, C., Sorensen, D.: Lapack: a portable linear algebra library for high-performance computers. In: Proceedings of the 1990 ACM\/IEEE conference on Supercomputing, Supercomputing \u201990, pp. 2\u201311. IEEE Computer Society Press, Los Alamitos, CA, USA (1990) http:\/\/dl.acm.org\/citation.cfm?id=110382.110385"},{"key":"241_CR5","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"241_CR6","doi-asserted-by":"crossref","unstructured":"Baumgartner, G., Bernholdt, D., Cociorva, D., Harrison, R., Hirata, S., Lam, C.C., Nooijen, M., Pitzer, R., Ramanujam, J., Sadayappan, P.: A high-level approach to synthesis of high-performance codes for quantum chemistry. In: Supercomputing (2002)","DOI":"10.1109\/SC.2002.10056"},{"key":"241_CR7","doi-asserted-by":"crossref","unstructured":"Benabderrahmane, M.W., Pouchet, L.N., Cohen, A., Bastoul, C.: The polyhedral model is more widely applicable than you think. In: Proceedings of the International Conference on Compiler Construction (ETAPS CC), LNCS 6011, pp. 283\u2013303 (2010)","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"241_CR8","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Baskaran, M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., Sadayappan, P.: Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Proceedings of the International Conference on Compiler Construction (ETAPS CC) (2008)","DOI":"10.1007\/978-3-540-78791-4_9"},{"key":"241_CR9","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral program optimization system. In: Proceedings of the International Conference on Programming Language Design and Implementation (PLDI) (2008)"},{"key":"241_CR10","first-page":"2533","volume":"11","author":"RR Bouckaert","year":"2010","unstructured":"Bouckaert, R.R., Frank, E., Hall, M.A., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: WEKA-experiences with a java open-source project. J. Mach. Learn. Res. 11, 2533\u20132541 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"241_CR11","doi-asserted-by":"crossref","unstructured":"Cavazos, J., Dubach, C., Agakov, F., Bonilla, E., O\u2019Boyle, M.F., Fursin, G., Temam, O.: Automatic performance model construction for the fast software exploration of new hardware designs. In: International Conference on Compilers, Architectures and Synthesis of Embedded Systems (CASES) (2006)","DOI":"10.1145\/1176760.1176765"},{"key":"241_CR12","doi-asserted-by":"crossref","unstructured":"Cavazos, J., Fursin, G., Agakov, F.V., Bonilla, E.V., O\u2019Boyle, M.F.P., Temam, O.: Rapidly selecting good compiler optimizations using performance counters. In: Proceedings of the International Symposium on Code Generation and Optimization (CGO) (2007)","DOI":"10.1109\/CGO.2007.32"},{"key":"241_CR13","unstructured":"Chen, C., Chame, J., Hall, M.: CHiLL: A framework for composing high-level loop transformations. Tech. Rep. 08\u2013897, U. of Southern California (2008)"},{"key":"241_CR14","unstructured":"Chen, Y., Huang, Y., Eeckhout, L., Fursin, G., Peng, L., Temam, O., Wu, C.: Evaluating iterative optimization across 1000 datasets. In: Proceedings of the 2010 ACM SIGPLAN Conference on Programming language design and implementation, PLDI \u201910, pp. 448\u2013459. ACM, New York, NY, USA (2010). 10.1145\/1806596.1806647"},{"key":"241_CR15","doi-asserted-by":"crossref","unstructured":"Cleary, J.G., Trigg, L.E.: K*: an instance-based learner using an entropic distance measure. In: In Proceedings of the 12th International Conference on Machine Learning, pp. 108\u2013114. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50022-0"},{"key":"241_CR16","doi-asserted-by":"crossref","unstructured":"Cooper, K.D., Grosul, A., Harvey, T.J., Reeves, S., Subramanian, D., Torczon, L., Waterman, T.: Acme: adaptive compilation made efficient. In: Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), pp. 69\u201377. ACM Press, New York, NY, USA (2005). doi: 10.1145\/1065910.1065921","DOI":"10.1145\/1065910.1065921"},{"key":"241_CR17","doi-asserted-by":"crossref","unstructured":"Cooper, K.D., Schielke, P.J., Subramanian, D.: Optimizing for reduced code space using genetic algorithms. In: Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), pp. 1\u20139. ACM Press (1999)","DOI":"10.1145\/314403.314414"},{"issue":"1","key":"241_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1015729001611","volume":"23","author":"KD Cooper","year":"2002","unstructured":"Cooper, K.D., Subramanian, D., Torczon, L.: Adaptive optimizing compilers for the 21st century. J. Supercomput. 23(1), 7\u201322 (2002)","journal-title":"J. Supercomput."},{"key":"241_CR19","doi-asserted-by":"crossref","unstructured":"Datta, K., Kamil, S., Williams, S., Oliker, L., Shalf, J., Yelick, K.: Optimization and performance modeling of stencil computations on modern microprocessors. SIAM Review 51(1) (2009) doi: 10.1137\/070693199 . http:\/\/link.aip.org\/link\/?SIR\/51\/129\/1","DOI":"10.1137\/070693199"},{"key":"241_CR20","doi-asserted-by":"crossref","unstructured":"Dubach, C., Cavazos, J., Franke, B., O\u2019Boyle, M., Fursin, G., Temam, O.: Fast compiler optimisation evaluation using code-feature based performance prediction. In: Proceedings of the International Conference on Computing Frontiers (CF) (2007)","DOI":"10.1145\/1242531.1242553"},{"key":"241_CR21","doi-asserted-by":"crossref","unstructured":"Dubach, C., Jones, T.M., Bonilla, E.V., Fursin, G., O\u2019Boyle, M.F.: Portable compiler optimization across embedded programs and microarchitectures using machine learning. In: Proceedings of the International Symposium on Microarchitecture (MICRO) (2009)","DOI":"10.1145\/1669112.1669124"},{"issue":"5","key":"241_CR22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem, part I: one dimensional time. Int. J. Parallel Program (IJPP) 21(5), 313\u2013348 (1992)","journal-title":"Int. J. Parallel Program (IJPP)"},{"issue":"6","key":"241_CR23","doi-asserted-by":"crossref","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. Int. J. Parallel Program. (IJPP) 21(6), 389\u2013420 (1992)","journal-title":"Int. J. Parallel Program. (IJPP)"},{"key":"241_CR24","doi-asserted-by":"crossref","unstructured":"Franke, B., O\u2019Boyle, M., Thomson, J., Fursin, G.: Probabilistic source-level optimisation of embedded programs. In: Proceedings of the International Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES), pp. 78\u201386. ACM Press (2005)","DOI":"10.1145\/1065910.1065922"},{"key":"241_CR25","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. In: Proceedings of the IEEE 93(2), 216\u2013231 (2005) Special issue on \u201cProgram Generation, Optimization, and Platform Adaptation\u201d","DOI":"10.1109\/JPROC.2004.840301"},{"key":"241_CR26","doi-asserted-by":"crossref","unstructured":"Fursin, G., Cavazos, J., Temam, O.: Midatasets: creating the conditions for a more realistic evaluation of iterative optimization. In: In Proceedings of the International Conference on High Performance Embedded Architectures and Compilers (HiPEAC), pp. 245\u2013260. Springer LNCS (2007)","DOI":"10.1007\/978-3-540-69338-3_17"},{"key":"241_CR27","unstructured":"Fursin, G., Miranda, C., Temam, O., Namolaru, M., Yom-Tov, E., Zaks, A., Mendelson, B., Barnard, P., Ashton, E., Courtois, E., Bodin, F., Bonilla, E., Thomson, J., Leather, H., Williams, C., O\u2019Boyle, M.: MILEPOST GCC: machine learning based research compiler. In: Proceedings of the GCC Developers\u2019 Summit (2008)"},{"issue":"3","key":"241_CR28","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10766-006-0012-3","volume":"34","author":"S Girbal","year":"2006","unstructured":"Girbal, S., Vasilache, N., Bastoul, C., Cohen, A., Parello, D., Sigler, M., Temam, O.: Semi-automatic composition of loop transformations. Int. J. Parallel Program. (IJPP) 34(3), 261\u2013317 (2006)","journal-title":"Int. J. Parallel Program. (IJPP)"},{"key":"241_CR29","doi-asserted-by":"crossref","unstructured":"Haneda, M., Knijnenburg, P.M.W., Wijshoff, H.A.G.: Automatic selection of compiler options using non-parametric inferential statistics. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), pp. 123\u2013132 (2005)","DOI":"10.1109\/PACT.2005.9"},{"key":"241_CR30","unstructured":"INRIA, The Ohio State University: Polybench, the polyhedral benchmark suite. http:\/\/polybench.sourceforge.net"},{"key":"241_CR31","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: Supernode partitioning. In: ACM SIGPLAN Principles of Programming Languages, pp. 319\u2013329 (1988)","DOI":"10.1145\/73560.73588"},{"key":"241_CR32","doi-asserted-by":"crossref","unstructured":"Kelly, W., Pugh, W.: A unifying framework for iteration reordering transformations. In: IEEEInternational Conference on Algorithms and Architectures for Parallel Processing (ICAPP\u201995), pp. 153\u2013162 (1995)","DOI":"10.1109\/ICAPP.1995.472180"},{"key":"241_CR33","doi-asserted-by":"crossref","unstructured":"Kisuki, T., Knijnenburg, P.M.W., O\u2019Boyle, M.F.P.: Combined selection of tile sizes and unroll factors using iterative compilation. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), p. 237 (2000)","DOI":"10.1109\/PACT.2000.888348"},{"key":"241_CR34","doi-asserted-by":"crossref","unstructured":"Kulkarni, P., Hines, S., Hiser, J., Whalley, D., Davidson, J., Jones, D.: Fast searches for effective optimization phase sequences. In: Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), pp. 171\u2013182. ACM Press (2004)","DOI":"10.1145\/996841.996863"},{"key":"241_CR35","doi-asserted-by":"crossref","unstructured":"Lim, A.W., Lam, M.S.: Maximizing parallelism and minimizing synchronization with affine transforms. In: Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 201\u2013214. ACM Press (1997)","DOI":"10.1145\/263699.263719"},{"key":"241_CR36","unstructured":"Long, S., Fursin, G.: A heuristic search algorithm based on unified transformation framework. In: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), pp. 137\u2013144 (2005)"},{"key":"241_CR37","doi-asserted-by":"crossref","unstructured":"Monsifrot, A., Bodin, F., Quiniou, R.: A machine learning approach to automatic production of compiler heuristics. In: Proceedings of the International Conference on Artificial Intelligence: Methodology, Systems, and Applications (AIMSA), pp. 41\u201350 Springer, Berlin (2002)","DOI":"10.1007\/3-540-46148-5_5"},{"key":"241_CR38","unstructured":"Mucci, P.: Papi\u2014the performance application programming interface. http:\/\/icl.cs.utk.edu\/papi\/index.html (2000)"},{"key":"241_CR39","doi-asserted-by":"crossref","unstructured":"Namolaru, M., Cohen, A., Fursin, G., Zaks, A., Freund, A.: Practical aggregation of semantical program properties for machine learning based optimization. In: International Conference on Compilers, Architectures and Synthesis of Embedded Systems (CASES) (2010)","DOI":"10.1145\/1878921.1878951"},{"key":"241_CR40","doi-asserted-by":"crossref","unstructured":"Orozco, D., Gao, G.R.: Mapping the FDTD application to many-core chip architectures. In: ICPP (2009)","DOI":"10.1109\/ICPP.2009.44"},{"key":"241_CR41","doi-asserted-by":"crossref","unstructured":"Parello, D., Temam, O., Cohen, A., Verdun, J.M.: Towards a systematic, pragmatic and architecture-aware program optimization process for complex processors. In: Proceedings of the ACM\/IEEE conference on Supercomputing (SC), p. 15. IEEE Computer Society (2004)","DOI":"10.1109\/SC.2004.61"},{"key":"241_CR42","doi-asserted-by":"crossref","unstructured":"Park, E., Cavazos, J., Alvarez, M.A.: Using graph-based program characterization for predictive modeling. In: 10th IEEE\/ACM International Symposium on Code Generation and Optimization (CGO\u201912). IEEE Computer Society press, San Jose (2012)","DOI":"10.1145\/2259016.2259042"},{"key":"241_CR43","doi-asserted-by":"crossref","unstructured":"Park, E., Pouchet, L.N., Cavazos, J., Cohen, A., Sadayappan, P.: Predictive modeling in a polyhedral optimization space. In: 9th IEEE\/ACM International Symposium on Code Generation and Optimization (CGO\u201911), pp. 119\u2013129. IEEE Computer Society press, Chamonix, France (2011)","DOI":"10.1109\/CGO.2011.5764680"},{"key":"241_CR44","doi-asserted-by":"crossref","unstructured":"Pouchet, L.N., Bastoul, C., Cohen, A., Cavazos, J.: Iterative optimization in the polyhedral model: Part II, multidimensional time. In: Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), pp. 90\u2013100. ACM Press (2008)","DOI":"10.1145\/1375581.1375594"},{"key":"241_CR45","doi-asserted-by":"crossref","unstructured":"Pouchet, L.N., Bastoul, C., Cohen, A., Vasilache, N.: Iterative optimization in the polyhedral model: Part I, one-dimensional time. In: Proceedings of the International Symposium on Code Generation and Optimization (CGO), pp. 144\u2013156. IEEE Computer Society Press (2007)","DOI":"10.1109\/CGO.2007.21"},{"key":"241_CR46","unstructured":"Pouchet, L.N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P.: Combined iterative and model-driven optimization in an automatic parallelization framework. In: Proceedings of the ACM\/IEEE Conference on Supercomputing (SC) (2010). p. 11"},{"key":"241_CR47","doi-asserted-by":"crossref","unstructured":"Pouchet, L.N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P., Vasilache, N.: Loop transformations: Convexity, pruning and optimization. In: 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL\u201911), pp. 549\u2013562. ACM Press, Austin (2011)","DOI":"10.1145\/1926385.1926449"},{"key":"241_CR48","doi-asserted-by":"crossref","unstructured":"Puschel, M., Moura, J., Johnson, J., Padua, D., Veloso, M., Singer, B., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., Chen, K., Johnson, R.W., Rizzolo, N.: Spiral: code generation for dsp transforms. In: Proceedings of the IEEE 93(2), 232\u2013275 (2005) Special issue on \u201cProgram Generation, Optimization, and Platform Adaptation\u201d","DOI":"10.1109\/JPROC.2004.840306"},{"issue":"2","key":"241_CR49","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0743-7315(92)90027-K","volume":"16","author":"J Ramanujam","year":"1992","unstructured":"Ramanujam, J., Sadayappan, P.: Tiling multidimensional iteration spaces for multicomputers. J. Parallel Distrib. Comput. 16(2), 108\u2013230 (1992)","journal-title":"J. Parallel Distrib. Comput."},{"key":"241_CR50","volume-title":"Numerical Solution of Partial Differential Equations: Finite Difference Methods","author":"G Smith","year":"2004","unstructured":"Smith, G.: Numerical Solution of Partial Differential Equations: Finite Difference Methods. Oxford University Press, Oxford (2004)"},{"key":"241_CR51","doi-asserted-by":"crossref","unstructured":"Stephenson, M., Amarasinghe, S.: Predicting unroll factors using supervised classification. In: CGO \u201905: Proceedings of the International Symposium on Code Generation and Optimization, pp. 123\u2013134. IEEE Computer Society, Washington (2005). doi: 10.1109\/CGO.2005.29","DOI":"10.1109\/CGO.2005.29"},{"key":"241_CR52","doi-asserted-by":"crossref","unstructured":"Stephenson, M., Amarasinghe, S., Martin, M., O\u2019Reilly, U.M.: Meta optimization: improving compiler heuristics with machine learning. SIGPLAN Not. 38(5):77\u201390 (2003) doi: 10.1145\/780822.781141","DOI":"10.1145\/780822.781141"},{"key":"241_CR53","doi-asserted-by":"crossref","unstructured":"Tiwari, A., Chen, C., Chame, J., Hall, M., Hollingsworth, J.K.: A scalable auto-tuning framework for compiler optimization. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201312. IEEE Computer Society (2009)","DOI":"10.1109\/IPDPS.2009.5161054"},{"key":"241_CR54","doi-asserted-by":"crossref","unstructured":"Trifunovic, K., Nuzman, D., Cohen, A., Zaks, A., Rosen, I.: Polyhedral-model guided loop-nest auto-vectorization. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT) (2009)","DOI":"10.1109\/PACT.2009.18"},{"key":"241_CR55","doi-asserted-by":"crossref","unstructured":"Voronenko, Y., de Mesmay, F., P\u00fcschel, M.: Computer generation of general size linear transform libraries. In: Proceedings of the International Symposium on Code Generation and Optimization (CGO), pp. 102\u2013113 (2009)","DOI":"10.1109\/CGO.2009.33"},{"issue":"1","key":"241_CR56","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1177\/1094342004041293","volume":"18","author":"R Vuduc","year":"2004","unstructured":"Vuduc, R., Demmel, J.W., Bilmes, J.A.: Statistical models for empirical search-based performance tuning. Int. J. High Perform. Comput. Appl. 18(1), 65\u201394 (2004)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"241_CR57","doi-asserted-by":"crossref","unstructured":"Whaley, R.C., Dongarra, J.J.: Automatically tuned linear algebra software. In: Proceedings of the ACM\/IEEE Conference on Supercomputing (SC), pp. 1\u201327. IEEE Computer Society (1998)","DOI":"10.1109\/SC.1998.10004"},{"key":"241_CR58","unstructured":"Whaley, R.C., Petitet, A., Dongarra, J.J.: Automated empirical optimizations of software and the atlas project. Parallel Comput. (2000)"},{"key":"241_CR59","doi-asserted-by":"crossref","unstructured":"Wolf, M., Lam, M.: A data locality optimizing algorithm. In: ACM SIGPLAN\u201991 Conference on Programming Language Design and Implementation, pp. 30\u201344. New York (1991)","DOI":"10.1145\/113446.113449"},{"key":"241_CR60","doi-asserted-by":"crossref","unstructured":"Yotov, K., Li, X., Ren, G., Cibulskis, M., DeJong, G., Garzaran, M., Padua, D., Pingali, K., Stodghill, P., Wu, P.: A comparison of empirical and model-driven optimization. In: Proceedings of the International Conference on Programming Language Design and Implementation (PLDI) (2003)","DOI":"10.1145\/781131.781140"},{"key":"241_CR61","doi-asserted-by":"crossref","unstructured":"Yotov, K., Pingali, K., Stodghill, P.: Think globally, search locally. In: ICS \u201905: Proceedings of the 19th Annual International Conference on Supercomputing, pp. 141\u2013150. ACM Press, New York (2005). doi: 10.1145\/1088149.1088168","DOI":"10.1145\/1088149.1088168"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0241-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-013-0241-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0241-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:46:45Z","timestamp":1745963205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-013-0241-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,21]]},"references-count":61,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["241"],"URL":"https:\/\/doi.org\/10.1007\/s10766-013-0241-1","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,21]]}}}