{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:57:45Z","timestamp":1725490665166},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419457"},{"type":"electronic","value":"9783540454038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45403-9_10","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T20:34:51Z","timestamp":1188765291000},"page":"339-383","source":"Crossref","is-referenced-by-count":0,"title":["Communication-Free Partitioning of Nested Loops"],"prefix":"10.1007","author":[{"given":"Kuei-Ping","family":"Shih","sequence":"first","affiliation":[]},{"given":"Chua-Huang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jang-Ping","family":"Sheu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In Proceedings of the 3rd ACM\/SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 39\u201350, April 1991.","DOI":"10.1145\/109625.109631"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"J. M. Anderson and M. S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In Proceedings of the ACM SIGPLAN\u201993 Conference on Programming Language Design and Implementation, pages 112\u2013125, June 1993.","DOI":"10.1145\/155090.155101"},{"key":"10_CR3","unstructured":"U. Banerjee. Unimodular transformations of double loops. In Proceedings of the 3rd Workshop on Languages and Compilers for Parallel Computing, pages 192\u2013219, July 1990."},{"key":"10_CR4","volume-title":"Compiling Nested Loops for Communication-Efficient Execution on Distributed Memory Multicomputers","author":"T. S. Chen","year":"1994","unstructured":"T. S. Chen. Compiling Nested Loops for Communication-Efficient Execution on Distributed Memory Multicomputers. PhD thesis, Department of Computer Science and Information Engineering, National Central University, Taiwan, June 1994."},{"issue":"9","key":"10_CR5","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1109\/71.308531","volume":"5","author":"T. S. Chen","year":"1994","unstructured":"T. S. Chen and J. P. Sheu. Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 5(9):924\u2013938, September 1994.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jpdc.1995.1105","volume":"29","author":"A. Darte","year":"1995","unstructured":"A. Darte and Y. Robert. Affine-by-statement scheduling of uniform and affine loop nests over parametric domains. Journal of Parallel and Distributed Computing, 29:43\u201359, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"M. Dion, C. Randriamaro, and Y. Robert. How to optimize residual communications? In Proceedings of International Parallel Processing Symposium, April 1996.","DOI":"10.1109\/IPPS.1996.508085"},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0046628","volume-title":"High-Performance Computing and Networking, International Conference and Exhibition","author":"M. Dion","year":"1995","unstructured":"M. Dion and Y. Robert. Mapping affine loop nests: New results. In B. Hertzberger and G. Serazzi, editors, High-Performance Computing and Networking, International Conference and Exhibition, volume LNCS 919, pages 184\u2013189. Springer-Verlag, May 1995."},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier. Some efficient solution to the affine scheduling problem, part I, one dimensional time. International Journal of Parallel Programming, 21(5):313\u2013348, October 1992.","journal-title":"International Journal of Parallel Programming"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier. Some efficient solution to the affine scheduling problem, part II, multidimensional time. International Journal of Parallel Programming, 21(6):389\u2013420, December 1992.","journal-title":"International Journal of Parallel Programming"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/71.127259","volume":"3","author":"M. Gupta","year":"1992","unstructured":"M. Gupta and P. Banerjee. Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 3(2):179\u2013193, March 1992.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"7","key":"10_CR12","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/71.508249","volume":"7","author":"M. Gupta","year":"1996","unstructured":"M. Gupta, E. Schonberg, and H. Srinivasan. A unified framework for optimizing communication in data-parallel programs. IEEE Transactions on Parallel and Distributed Systems, 7(7):689\u2013704, July 1996.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"10_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/135226.135230","volume":"35","author":"S. Hiranandani","year":"1992","unstructured":"S. Hiranandani, K. Kennedy, and C. W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66\u201380, August 1992.","journal-title":"Communications of the ACM"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jpdc.1994.1040","volume":"21","author":"S. Hiranandani","year":"1994","unstructured":"S. Hiranandani, K. Kennedy, and C. W. Tseng. Evaluating compiler optimizations for Fortran D. Journal of Parallel and Distributed Computing, 21:27\u201345, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR15","volume-title":"Linear Algebra","author":"K. Hoffman","year":"1971","unstructured":"K. Hoffman and R. Kunze. Linear Algebra. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, second edition, 1971.","edition":"second edition"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jpdc.1993.1094","volume":"19","author":"C.-H. Huang","year":"1993","unstructured":"C.-H. Huang and P. Sadayappan. Communication-free hyperplane partitioning of nested loops. Journal of Parallel and Distributed Computing, 19:90\u2013102, 1993.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet. Supernode partitioning. In Proceedings of the 15th Annual ACM Symposium Principle of Programming Languages, pages 319\u2013329, January 1988.","DOI":"10.1145\/73560.73588"},{"issue":"5","key":"10_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MC.1987.1663563","volume":"20","author":"A. H. Karp","year":"1987","unstructured":"A. H. Karp. Programming for parallelism. IEEE Comput. Mag., 20(5):43\u201357, May 1987.","journal-title":"IEEE Comput. Mag."},{"key":"10_CR19","unstructured":"C. Koelbel. Compiling Programs for Nonshared Memory Machines. PhD thesis, Department of Computer Science, Purdue University, November 1990."},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/71.97901","volume":"2","author":"C. Koelbel","year":"1991","unstructured":"C. Koelbel and P. Mehrotra. Compiling global name-space parallel loops for distributed execution. IEEE Transactions on Parallel and Distributed Systems, 2(4):440\u2013451, October 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L. Lamport","year":"1974","unstructured":"L. Lamport. The parallel execution of do loops. Communications of the ACM, 17(2):83\u201393, February 1974.","journal-title":"Communications of the ACM"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"A. W. Lim and M. S. Lam. Communication-free parallelization via affine transformations. In Proceedings of the 7th Workshop on Languages and Compilers for Parallel Computing, August 1994.","DOI":"10.1007\/BFb0025873"},{"key":"10_CR23","first-page":"119","volume":"II","author":"L. S. Liu","year":"1990","unstructured":"L. S. Liu, C. W. Ho, and J. P. Sheu. On the parallelism of nested for-loops using index shift method. In Proceedings of International Conference on Parallel Processing, volume II, pages 119\u2013123, August 1990.","journal-title":"Proceedings of International Conference on Parallel Processing"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"D. A. Padua","year":"1986","unstructured":"D. A. Padua and M. J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29:1184\u20131201, December 1986.","journal-title":"Communications of the ACM"},{"key":"10_CR25","unstructured":"J. Ramanujam. Compile-Time Techniques for Parallel Execution of Loops on Distributed Memory Multiprocessors. PhD thesis, Department of Computer and Information Science, Ohio State University, September 1990."},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1109\/71.97903","volume":"2","author":"J. Ramanujam","year":"1991","unstructured":"J. Ramanujam and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. IEEE Transactions on Parallel and Distributed Systems, 2(4):472\u2013482, October 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"A. Rogers and K. Pingali. Process decomposition through locality of reference. In Proceedings of the ACM SIGPLAN\u201989 Conference on Programming Language Design and Implementation, pages 69\u201380, June 1989.","DOI":"10.1145\/73141.74824"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0743-7315(91)90107-K","volume":"13","author":"M. Rosing","year":"1991","unstructured":"M. Rosing, R. B. Schnabel, and R. P. Weaver. The DINO parallel programming language. Journal of Parallel and Distributed Computing, 13:30\u201342, 1991.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"10_CR29","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/71.97900","volume":"2","author":"J. P. Sheu","year":"1991","unstructured":"J. P. Sheu and T. H. Tai. Partitioning and mapping nested loops on multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems, 2(4):430\u2013439, October 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"K.-P. Shih, J.-P. Sheu, and C.-H. Huang. Statement-level communication-free partitioning techniques for parallelizing compilers. In Proceedings of the 9th Workshop on Languages and Compilers for Parallel Computing, August 1996.","DOI":"10.1007\/BFb0017265"},{"key":"10_CR31","unstructured":"C.-W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Department of Computer Science, Rice University, January 1993."},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In Proceedings of the ACM SIGPLAN\u201991 Conference on Programming Language Design and Implementation, pages 30\u201344, June 1991.","DOI":"10.1145\/113445.113449"},{"issue":"4","key":"10_CR33","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/71.97902","volume":"2","author":"M. E. Wolf","year":"1991","unstructured":"M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, 2(4):452\u2013471, October 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"M. J. Wolfe. More iteration space tiling. In Proceedings of ACM International Conference on Supercomputing, pages 655\u2013664, 1989.","DOI":"10.1145\/76263.76337"},{"key":"10_CR35","volume-title":"Optimizing Supercompilers for Supercomputers","author":"M. J. Wolfe","year":"1989","unstructured":"M. J. Wolfe. Optimizing Supercompilers for Supercomputers. London and Cambridge, MA: Pitman and the MIT Press, 1989."},{"key":"10_CR36","unstructured":"M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1996."},{"issue":"2","key":"10_CR37","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01379099","volume":"16","author":"M. J. Wolfe","year":"1987","unstructured":"M. J. Wolfe and U. Banerjee. Data dependence and its application to parallel processing. International Journal of Parallel Programming, 16(2):137\u2013178, April 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"10_CR38","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1016\/0167-8191(94)90052-3","volume":"20","author":"H. P. Zima","year":"1994","unstructured":"H. P. Zima, P. Brezany, and B. M. Chapman. SUPERB and Vienna Fortran. Parallel Computing, 20:1487\u20131517, 1994.","journal-title":"Parallel Computing"},{"key":"10_CR39","volume-title":"Supercompilers for Parallel and Vector Computers","author":"H. P. Zima","year":"1991","unstructured":"H. P. Zima and B. Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1991."}],"container-title":["Lecture Notes in Computer Science","Compiler Optimizations for Scalable Parallel Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45403-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:40:55Z","timestamp":1556811655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45403-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419457","9783540454038"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-45403-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}