{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:49Z","timestamp":1725514249213},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695004"},{"type":"electronic","value":"9783540695011"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69501-1_20","type":"book-chapter","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T07:20:45Z","timestamp":1212391245000},"page":"185-195","source":"Crossref","is-referenced-by-count":4,"title":["Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations"],"prefix":"10.1007","author":[{"given":"Wlodzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Anna","family":"Beletska","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Palkowski","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_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":"20_CR2","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":"20_CR3","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":"20_CR4","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":"20_CR5","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":"20_CR6","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":"20_CR7","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":"20_CR8","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":"20_CR9","doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration Space Slicing and Its Application to Communication Optimization. In: Proceedings of the International Conference on Supercomputing, pp. 221\u2013228 (1997)","DOI":"10.1145\/263580.263637"},{"issue":"6","key":"20_CR10","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":"20_CR11","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":"20_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/109625.109631","volume-title":"Proceedings of the Third ACM\/SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"C. Ancourt","year":"1991","unstructured":"Ancourt, C., Irigoin, F.: Scanning polyhedra with do loops. In: Proceedings of the Third ACM\/SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 39\u201350. ACM Press, New York (1991)"},{"key":"20_CR13","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":"20_CR14","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":"20_CR15","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":"20_CR16","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, Austria (2006)"},{"key":"20_CR17","unstructured":"Gupta, G., DaeGon, Kim, Sanjay, Rajopadhye, V.: Scheduling in the Z-Polyhedral Model. In: Proceedings of IPDPS 2007 (2007)"},{"key":"20_CR18","unstructured":"www.openmp.org"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Lim, W., Lam, M.S.: Communication-free parallelization via affine transformations. In: Proceedings of the Seventh workshop on languages and compilers for parallel computing, pp. 92\u2013106 (1994)","DOI":"10.1007\/BFb0025873"},{"key":"20_CR20","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":"20_CR21","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":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-45209-6_44","volume-title":"Euro-Par 2003 Parallel Processing","author":"V. Beletskyy","year":"2003","unstructured":"Beletskyy, V., Siedlecki, K.: Finding Free Schedules for Non-uniform Loops. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 297\u2013302. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69501-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:41:58Z","timestamp":1620016918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69501-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540695004","9783540695011"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69501-1_20","relation":{},"subject":[]}}