{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:21:45Z","timestamp":1755220905404,"version":"3.43.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1023\/a:1008190606079","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:17:47Z","timestamp":1040545067000},"page":"205-227","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Address Generation for Affine Subscripts in Data-Parallel Programs"],"prefix":"10.1007","volume":"17","author":[{"given":"Kuei-Ping","family":"Shih","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jang-Ping","family":"Sheu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Yung","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271249_CR1","unstructured":"C. Ancourt, F. Coelho, F. Irigoin, and R. Keryell. A linear algebra framework for static HPF code distribution. In The Fourth International Workshop on Compilers for Parallel Computers, pp. 117-132, Delft, The Netherlands, December 1993."},{"key":"271249_CR2","doi-asserted-by":"crossref","unstructured":"B. M. Chapman, P. Mehrotra, and H. P. Zima. Programming in Vienna Fortran. Scientific Programming, 1(1), 1992.","DOI":"10.1155\/1992\/258136"},{"key":"271249_CR3","doi-asserted-by":"crossref","unstructured":"B. M. Chapman, P. Mehrotra, and H. P. Zima. Vienna Fortran\u2013\u2013a Fortran language extension for distributed memory multiprocessors. In J. Saltz and P. Mehrotra, ed., Language, Compilers and Runtime Environments for Distributed Memory Machines, pp. 39-62, 1992.","DOI":"10.1016\/B978-0-444-88712-2.50007-X"},{"issue":"1","key":"271249_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jpdc.1995.1049","volume":"26","author":"S. Chatterjee","year":"1995","unstructured":"S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber, and S.-H. Teng. Generating local addresses and communication sets for data parallel programs. Journal of Parallel and Distributed Computing, 26(1):72-84, 1995.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"271249_CR5","unstructured":"G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. W. Tseng, and M. Wu. Fortran D language specification. Technical Report TR-91-170, Department of Computer Science, Rice University, December 1991."},{"key":"271249_CR6","unstructured":"M. Gerndt. Automatic parallelization for distributed-memory multiprocessing systems. Ph.D. thesis, University of Bonn, December 1989."},{"key":"271249_CR7","volume-title":"Concrete Mathematics","author":"R. L. Graham","year":"1989","unstructured":"R. L. Graham, D. E. Knuth, and O. Patashink. Concrete Mathematics. Addison Wesley, Reading, Mass., 1989."},{"issue":"2","key":"271249_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/jpdc.1996.0011","volume":"32","author":"S. K. S. Gupta","year":"1996","unstructured":"S. K. S. Gupta, S. D. Kaushik, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. Journal of Parallel and Distributed Computing, 32(2):155-172, 1996.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"271249_CR9","doi-asserted-by":"crossref","unstructured":"High Performance Fortran Forum. High Performance Fortran Language Specification, November 1994. (Version 1.1).","DOI":"10.1145\/190783.1041310"},{"key":"271249_CR10","doi-asserted-by":"crossref","unstructured":"S. Hiranandani, K. Kennedy, J. Mellor-Crummey, and A. Sethi. Compilation techniques for blockcyclic distributions. In Proceedings of ACM International Conference on Supercomputing, pp. 392-403, July 1994.","DOI":"10.1145\/181181.181572"},{"key":"271249_CR11","doi-asserted-by":"crossref","unstructured":"K. Kennedy, N. Nedeljkovi\u0107, and A. Sethi. Efficient address generation for block-cyclic distributions. In Proceedings of ACM International Conference on Supercomputing, pp. 180-184, July 1995.","DOI":"10.1145\/224538.224558"},{"key":"271249_CR12","doi-asserted-by":"crossref","unstructured":"K. Kennedy, N. Nedeljkovi\u0107, and A. Sethi. A linear-time algorithm for computing the memory access sequence in data-parallel programs. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 102-111, July 1995.","DOI":"10.1145\/209936.209948"},{"key":"271249_CR13","doi-asserted-by":"crossref","unstructured":"C. Koelbel. Compile-time generation of regular communication patterns. In Proceedings of Supercomputing'91, pp. 101-110, Albuquerque, NM, November 1991.","DOI":"10.1145\/125826.125890"},{"key":"271249_CR14","volume-title":"The High Performance Fortran Handbook","author":"C. Koelbel","year":"1994","unstructured":"C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr., and M. Zosel. The High Performance Fortran Handbook. MIT Press, Cambridge, Mass., 1994."},{"issue":"4","key":"271249_CR15","doi-asserted-by":"crossref","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-451, 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"271249_CR16","first-page":"77","volume":"II","author":"S. P. Midkiff","year":"1995","unstructured":"S. P. Midkiff. Local iteration set computation for block-cyclic distributions. In Proceedings of International Conference on Parallel Processing, Vol. II, pp. 77-84, August 1995.","journal-title":"Proceedings of International Conference on Parallel Processing"},{"key":"271249_CR17","unstructured":"S. P. Midkiff. Computing the local iteration set of a block-cyclically distributed reference with affine subscripts. In Proceedings of the sixth Workshop on Compilers for Parallel Computers, Aachen, Germany, December 1996."},{"key":"271249_CR18","doi-asserted-by":"crossref","unstructured":"J. Ramanujam, S. Dutta, and A. Venkatachar. Code generation for complex subscripts in dataparallelprograms. In Languages and Compilers for Parallel Computing, Minneapolis, MN, August 1997.","DOI":"10.1007\/BFb0032683"},{"issue":"3","key":"271249_CR19","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/71.80162","volume":"1","author":"Z. Shen","year":"1992","unstructured":"Z. Shen, Z. Li, and P.-C. Yew. An empirical study of Fortran programs for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems, 1(3):356-364, 1992.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"271249_CR20","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1006\/jpdc.1994.1048","volume":"21","author":"J. M. Stichnoth","year":"1994","unstructured":"J. M. Stichnoth, D. O'Hallaron, and T. Gross. Generating communication for array statements: Design, implementation, and evaluation. Journal of Parallel and Distributed Computing, 21:150-159, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"271249_CR21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1006\/jpdc.1996.0140","volume":"38","author":"A. Thirumalai","year":"1996","unstructured":"A. Thirumalai and J. Ramanujam. Efficient computation of address sequences in data parallel programs using closed forms for basis vectors. Journal of Parallel and Distributed Computing, 38(2):188-203, 1996.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"271249_CR22","unstructured":"C. W. Tseng. An optimizing Fortran D compiler for MIMD distributed-memory machines. Ph.D. thesis, Rice University, 1993."},{"issue":"4","key":"271249_CR23","first-page":"695","volume":"14","author":"W.-H. Wei","year":"1997","unstructured":"W.-H. Wei, K.-P. Shih, and J.-P. Sheu. Compiling array references with affine functions for dataparallel programs. Journal of Information Science and Engineering, 14(4):695-723, 1997.","journal-title":"Journal of Information Science and Engineering"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008190606079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008190606079\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008190606079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:23:30Z","timestamp":1754630610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008190606079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["271249"],"URL":"https:\/\/doi.org\/10.1023\/a:1008190606079","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}