{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:22Z","timestamp":1725516382069},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698401"},{"type":"electronic","value":"9783540698487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69848-7_69","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"871-886","source":"Crossref","is-referenced-by-count":4,"title":["Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops"],"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":"Krzysztof","family":"Siedlecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","first-page":"790","volume-title":"Optimizing Compilers for Modern Architectures","author":"R. Allen","year":"2001","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures, p. 790. Morgan Kaufmann, San Francisco (2001)"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Amarasinghe, S.P., Lam, M.S.: Communication optimization and code generation for distributed memory machines. In: Proceedings of the SIGPLAN 1993, pp. 126\u2013138 (1993)","DOI":"10.1145\/173262.155102"},{"key":"69_CR3","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":"69_CR4","unstructured":"Banerjee, U.: Unimodular transformations of double loops. In: Proceedings of the Third Workshop on Languages and Compilers for Parallel Computing, pp. 192\u2013219 (1990)"},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"Bastoul, C., Cohen, A., Girbal, S., Sharma, S., Temam, O.: Putting polyhedral loop transformations to work. In: LCPC 16 Intern.l Workshop on Languages and Compilers for Parallel Computing. LNCS, vol.\u00a02958, pp. 209\u2013225. College Station (September 2003)","DOI":"10.1007\/978-3-540-24644-2_14"},{"key":"69_CR6","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code Generation in the Polyhedral Model Is Easier Than You Think. In: Proceedings of the PACT 13 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, pp. 7\u201316 (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"69_CR7","unstructured":"Beletska, A., Bielecki, W., San Pietro, P.: Extracting Synchronization-Free Slices of Operations in Perfectly-Nested Loops. In: Proceedings of PDCS 2007 (2007)"},{"key":"69_CR8","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":"69_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-27866-5_38","volume-title":"Euro-Par 2004 Parallel Processing","author":"A. Cohen","year":"2004","unstructured":"Cohen, A., Girbal, S., Temam, O.: A polyhedral approach to ease the composition of program transformations. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol.\u00a03149, pp. 292\u2013303. Springer, Heidelberg (2004)"},{"key":"69_CR10","doi-asserted-by":"crossref","unstructured":"Darte, A., Robert, Y., Vivien, F.: Scheduling and Automatic Parallelization. Birkh\u00e4user Boston (2000)","DOI":"10.1007\/978-1-4612-1362-8"},{"key":"69_CR11","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 i, one dimensional time. International Journal of Parallel Programming\u00a021, 313\u2013348 (1992)","journal-title":"International Journal of Parallel Programming"},{"key":"69_CR12","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":"69_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1142\/S0129626494000235","volume":"4","author":"P. Feautrier","year":"1994","unstructured":"Feautrier, P.: Toward automatic distribution. Journal of Parallel Processing Letters\u00a04, 233\u2013244 (1994)","journal-title":"Journal of Parallel Processing Letters"},{"key":"69_CR14","unstructured":"Gavald\u00e0, R., Ayguad\u00e9, E., Torres, J.: Obtaining Synchronization-Free Code with Maximum Parallelism, Technical Report LSI-96-23-R, Universitat Polit\u00e8cnica de Catalunya (1996)"},{"key":"69_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-61626-8_64","volume-title":"Proceedings of the Euro-Par","author":"M. Griebl","year":"1996","unstructured":"Griebl, M., Lengauer, C.: Classifying Loops for Space-Time Mapping. In: Proceedings of the Euro-Par. LNCS, pp. 467\u2013474. Springer, Heidelberg (1996)"},{"key":"69_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jpdc.1993.1094","volume":"19","author":"C. Huang","year":"1993","unstructured":"Huang, C., Sadayappan, P.: Communication-free hyperplane partitioning of nested loops. Journal of Parallel and Distributed Computing\u00a019, 90\u2013102 (1993)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"69_CR17","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. International Journal of Parallel Programming\u00a024(6), 579\u2013598 (1996)","journal-title":"International Journal of Parallel Programming"},{"key":"69_CR18","doi-asserted-by":"crossref","unstructured":"Kelly, W., Pugh, W.: Minimizing communication while preserving parallelism. In: Proc. of the 1996 ACM International Conference on Supercomputing, pp. 52\u201360 (1996)","DOI":"10.1145\/237578.237585"},{"key":"69_CR19","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":"69_CR20","doi-asserted-by":"crossref","unstructured":"Lim, W., Lam, M.S.: Communication-free parallelization via affine transformations. In: Proc. of the 7th workshop on languages and compilers for parallel computing, pp. 92\u2013106 (1994)","DOI":"10.1007\/BFb0025873"},{"key":"69_CR21","doi-asserted-by":"crossref","unstructured":"Lim, W., Cheong, G.I., Lam, M.S.: An affine partitioning algorithm to maximize parallelism and minimize communication. In: Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing (1999)","DOI":"10.1145\/305138.305197"},{"key":"69_CR22","doi-asserted-by":"crossref","unstructured":"Lim, W., Liao, S.W., Lam, M.: Blocking and Array Contraction Across Arbitrarily Nested Loops Using Affine Partitioning. In: Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (2001)","DOI":"10.1145\/379539.379586"},{"key":"69_CR23","doi-asserted-by":"crossref","unstructured":"Pugh, W., Wonnacott, D.: Constraint-based array dependence analysis. ACM Trans. on Programming Languages and Systems (1998)","DOI":"10.1145\/291889.291900"},{"key":"69_CR24","doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration Space Slicing and Its Application to Communication Optimization. In: Proc. of the International Conf. on Supercomputing, pp. 221\u2013228 (1997)","DOI":"10.1145\/263580.263637"},{"key":"69_CR25","doi-asserted-by":"crossref","unstructured":"Quillere, F., Rajopadhye, S., Wilde, D.: Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming\u00a028 (2000)","DOI":"10.1023\/A:1007554627716"},{"key":"69_CR26","unstructured":"Weiser, M.: Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, PhD thesis, University of Michigan, Ann Arbor, MI (1979)"},{"issue":"7","key":"69_CR27","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"SE-10","author":"M. Weiser","year":"1984","unstructured":"Weiser, M.: Program Slicing. IEEE Transactions on Software Engineering\u00a0SE-10(7), 352\u2013357 (1984)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"69_CR28","unstructured":"Wolf, M.E.: Improving locality and parallelism in nested loops, Ph.D. Dissertation CSL-TR-92-538, Stanford University, Dept. Computer Science (1992)"},{"key":"69_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/11688839_16","volume-title":"Proceedings of the International Conference on Compiler Construction (ETAPS CC 2006)","author":"N. Vasilache","year":"2006","unstructured":"Vasilache, N., Bastoul, C., Cohen, A.: Polyhedral code generation in the real world. In: Proceedings of the International Conference on Compiler Construction (ETAPS CC 2006). LNCS, pp. 185\u2013201. Springer, Vienna (2006)"},{"key":"69_CR30","unstructured":"Netlib Repository at UTK and ORNL, http:\/\/www.netlib.org\/benchmark\/livermorec"},{"key":"69_CR31","unstructured":"http:\/\/www.nas.nasa.gov"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69848-7_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:03:45Z","timestamp":1605744225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69848-7_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698401","9783540698487"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69848-7_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}