{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:11:09Z","timestamp":1740175869719,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642133732"},{"type":"electronic","value":"9783642133749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13374-9_16","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:15:59Z","timestamp":1276168559000},"page":"233-246","source":"Crossref","is-referenced-by-count":1,"title":["Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing"],"prefix":"10.1007","author":[{"given":"Anna","family":"Beletska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Palkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/109625.109631","volume-title":"Proc. of the Third ACM\/SIGPLAN Symp. on Principles and Practice of Parallel Programming","author":"C. Ancourt","year":"1991","unstructured":"Ancourt, C., Irigoin, F.: Scanning polyhedra with DO loops. In: Proc. of the Third ACM\/SIGPLAN Symp. on Principles and Practice of Parallel Programming, pp. 39\u201350. ACM Press, New York (1991)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code Generation in the Polyhedral Model Is Easier Than You Think. In: Proc. of the PACT\u201913 IEEE Intl. Conf. on Parallel Architecture and Compilation Techniques, Juan-les-Pins, pp. 7\u201316 (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-642-02026-1_9","volume-title":"COCOA 2009","author":"A. Beletska","year":"2009","unstructured":"Beletska, A., Barthou, D., Bielecki, W., Cohen, A.: Computing the Transitive Closure of a Union of Affine Tuple Relations. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 98\u2013109. Springer, Heidelberg (2009)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-69848-7_69","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2008","author":"A. Beletska","year":"2008","unstructured":"Beletska, A., Bielecki, W., Siedlecki, K., San Pietro, P.: Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. In: Gervasi, O., Murgante, B., Lagan\u00e0, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2008, Part II. LNCS, vol.\u00a05073, pp. 871\u2013886. Springer, Heidelberg (2008)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Beletska, A., Bielecki, W., San Pietro, P.: Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. In: IEEE Proc. of ISPDC, p. 29 (2007)","DOI":"10.1109\/ISPDC.2007.21"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Beletska, A., San Pietro, P.: Extracting Coarse-Grained Parallelism with the Affine Transformation Framework and its Limitations. Electronic Modelling\u00a05 (2006)","DOI":"10.1109\/ISPDC.2007.21"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-69501-1_20","volume-title":"Algorithms and Architectures for Parallel Processing","author":"W. Bielecki","year":"2008","unstructured":"Bielecki, W., Beletska, A., San Pietro, P.: Finding Synchronization-Free Parallelism Represented with Trees of Dependent operations. In: Bourgeois, A.G., Zheng, S.Q. (eds.) ICA3PP 2008. LNCS, vol.\u00a05022, pp. 185\u2013195. Springer, Heidelberg (2008)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.endm.2009.03.002","volume":"33","author":"W. Bielecki","year":"2009","unstructured":"Bielecki, W., Klimek, T., Trifunovic, K.: Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation. Journal of Electronic Notes in Discrete Mathematics\u00a033, 7\u201314 (2009)","journal-title":"Journal of Electronic Notes in Discrete Mathematics"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-58179-0_43","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1994","unstructured":"Boigelot, B., Wolper, P.: Symbolic Verification With Periodic Sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 55\u201376. Springer, Heidelberg (1994)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0167-8191(98)00020-9","volume":"24","author":"P. Boulet","year":"1998","unstructured":"Boulet, P., Darte, A., Silber, G.A., Vivien, F.: Loop parallelization algorithms: from parallelism extraction to code generation. Parallel Computing\u00a024, 421\u2013444 (1998)","journal-title":"Parallel Computing"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-45306-7_9","volume-title":"Compiler Construction","author":"R.A. Engelen van","year":"2001","unstructured":"van Engelen, R.A.: Efficient symbolic analysis for optimizing compilers. In: Wilhelm, R. (ed.) CC 2001. LNCS, vol.\u00a02027, pp. 118\u2013132. Springer, Heidelberg (2001)"},{"key":"16_CR13","doi-asserted-by":"publisher","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\u00a0I, one dimensional time. Intl. Journal of Parallel Programming\u00a021, 313\u2013348 (1992)","journal-title":"Intl. Journal of Parallel Programming"},{"key":"16_CR14","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\u00a0II, multidimensional time. Intl. Journal of Parallel Programming\u00a021, 389\u2013420 (1992)","journal-title":"Intl. Journal of Parallel Programming"},{"key":"16_CR15","unstructured":"Feautrier, P., Boulet, P.: Scanning polyhedra without DO-loops. In: Parallel Architectures and Compilation Techniques, PACT 1998 (1998)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: A theory of hybrid automata. In: Symp. on Logic in Computer Science, LICS 1996 (1996)","DOI":"10.1109\/LICS.1996.561342"},{"key":"16_CR17","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega library interface guide, Technical Report CS-TR-3445, University of Maryland (1995)"},{"key":"16_CR18","unstructured":"Kelly, W.: Optimization within a Unified Transformation Framework, Technical Report CS-TR-3725, University of Maryland (1996)"},{"issue":"6","key":"16_CR19","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. Intl. J. of Parallel Programming\u00a024(6), 579\u2013598 (1996)","journal-title":"Intl. J. of Parallel Programming"},{"key":"16_CR20","unstructured":"Kelly, W., Pugh, W., Rosser, E.: Code generation for multiple mappings. In: Frontiers 1995 Symposium on the frontiers of massively parallel computation (1995)"},{"key":"16_CR21","volume-title":"UTDSP Benchmark Suite","author":"C.G. Lee","year":"1992","unstructured":"Lee, C.G., Stoodley, M.: UTDSP Benchmark Suite. Univ. of Toronto, Canada (1992), http:\/\/www.eecg.toronto.edu\/corinna\/DSP\/infrastructureUTDSP.html"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Lim, A.W., Lam, M.: Maximizing Parallelism and Minimizing Synchronization with Affine Transforms. In: Proc. of the Symp. on the Principles of Programming Languages, pp. 201\u2013214 (1997)","DOI":"10.1145\/263699.263719"},{"key":"16_CR23","unstructured":"NAS benchmarks suite, http:\/\/www.nas.nasa.gov"},{"key":"16_CR24","unstructured":"The Omega Project, http:\/\/www.cs.umd.edu\/projects\/omega"},{"key":"16_CR25","unstructured":"Piplib - A parametric integer linear programming solver, http:\/\/www.prism.uvsq.fr\/~cedb\/bastools\/piplib.html"},{"issue":"2","key":"16_CR26","first-page":"223","volume":"18","author":"D.-L. Pean","year":"2002","unstructured":"Pean, D.-L., Chua, H.-T., Chen, C.: A Release Combined Scheduling Scheme for Non-Uniform Dependence Loops. J. Inf. Sci. Eng. (JISE)\u00a018(2), 223\u2013255 (2002)","journal-title":"J. Inf. Sci. Eng. (JISE)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Prakash, S.R., Srikant, Y.N.: Hyperplane Partitioning: An Approach to Global Data Partitioning for Distributed Memory Machines. In: IPPS\/SPDP 1999, p. 744 (1999)","DOI":"10.1109\/IPPS.1999.760559"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-57659-2_31","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Pugh","year":"1994","unstructured":"Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1993. LNCS, vol.\u00a0768, pp. 546\u2013566. Springer, Heidelberg (1994)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration Space Slicing and Its Application to Communication Optimization. In: Proc. of the Intl. Conf. on Supercomputing, pp. 221\u2013228 (1997)","DOI":"10.1145\/263580.263637"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Quillere, F., Rajopadhye, S., Wilde, D.: Generation of efficient nested loops from polyhedra. Intl. Journal of Parallel Programming\u00a028 (2000)","DOI":"10.1023\/A:1007554627716"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/71.80162","volume":"1","author":"Z. Shen","year":"1990","unstructured":"Shen, Z., Li, Z., Yew, P.-C.: An Empirical Study of Fortran Programs for Parallelizing Compilers. IEEE Trans. Parallel Distributed Syst.\u00a01, 356\u2013364 (1990)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/11688839_16","volume-title":"Compiler Construction","author":"N. Vasilache","year":"2006","unstructured":"Vasilache, N., Bastoul, C., Cohen, A.: Polyhedral code generation in the real world. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 185\u2013201. Springer, Heidelberg (2006)"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Wolfe, M.J.: Beyond induction variables. In: Symp. on Programming Languages and Implementation (PLDI 1992), pp. 162\u2013174 (1992)","DOI":"10.1145\/143095.143131"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Yu, Y., D\u2019Hollander, E.H.: Non-Uniform Dependences Partitioned by Recurrence Chains. In: Proc. the 2004 International Conference on Parallel Processing (ICPP 2004), pp. 100\u2013107 (2004)","DOI":"10.1109\/ICPP.2004.1327909"}],"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-13374-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:42:42Z","timestamp":1740174162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13374-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642133732","9783642133749"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13374-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}