{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:10:31Z","timestamp":1649146231230},"reference-count":18,"publisher":"Elsevier BV","issue":"8-10","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1383-7621(03)00002-x","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T16:29:22Z","timestamp":1046795362000},"page":"255-265","source":"Crossref","is-referenced-by-count":3,"title":["Efficient communication sets generation for block\u2013cyclic distribution on distributed-memory machines"],"prefix":"10.1016","volume":"48","author":[{"given":"Tsung-Chuan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang-Cheng","family":"Shiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S1383-7621(03)00002-X_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1155\/1997\/195689","article-title":"A linear algebra framework for static HPF code distribution","volume":"6","author":"Ancourt","year":"1997","journal-title":"Scientific Programming"},{"issue":"1","key":"10.1016\/S1383-7621(03)00002-X_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1155\/1992\/258136","article-title":"Programming in Vienna Fortran","volume":"1","author":"Chapman","year":"1992","journal-title":"Scientific Programming"},{"issue":"1","key":"10.1016\/S1383-7621(03)00002-X_BIB3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jpdc.1995.1049","article-title":"Generating local addresses and communication sets for data parallel programs","volume":"26","author":"Chatterjee","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB4","unstructured":"G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C.W. Tseng, M.Y. Wu, Fortran D language specification, Technical Report CRPC-TR90079, Rice University, December 1990"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB5","doi-asserted-by":"crossref","unstructured":"High Performance Fortran Forum, High performance Fortran language specification Version 1.1, Technical Report CRPC-TR92225, Rice University, November 1994","DOI":"10.1145\/190783.1041310"},{"issue":"12","key":"10.1016\/S1383-7621(03)00002-X_BIB6","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/71.895789","article-title":"A generalized Basic-Cycle calculation method for array redistribution","volume":"11","author":"Hsu","year":"2000","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB7","unstructured":"T.C. Huang, L.C. Shiu, C.H. Yu, Efficient communication sets generation for parallelizing compiler on distributed-memory machines, in: The 11th Annual International Symposium on high performance computing systems, Winnipeg, Canada, July 1997, pp. 473\u2013482"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB8","doi-asserted-by":"crossref","unstructured":"T.C. Huang, L.C. Shiu, C.H. Yu, Generating communication sets efficiently on data parallel programs, in: The IEEE Third International Conference on Algorithms And Architectures For Parallel Processing, Melbourne, Australia, December 1997, pp. 367\u2013380","DOI":"10.1109\/ICAPP.1997.651505"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB9","doi-asserted-by":"crossref","unstructured":"K. Kennedy, N. Nedeljkovic, A. Sethi, A linear-time algorithm for computing the memory access sequence in data parallel programs, in: Proceedings of Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, July 1995","DOI":"10.1145\/209936.209948"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB10","series-title":"Languages, Compilers, and Run-Time Systems for Scalable Computers","article-title":"Communication generation for cyclic(k) distributions","author":"Kennedy","year":"1995"},{"issue":"12","key":"10.1016\/S1383-7621(03)00002-X_BIB11","first-page":"201","article-title":"Algorithmic redistribution methods for block cyclic decompositions","volume":"7","author":"Petitet","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Computing"},{"issue":"9","key":"10.1016\/S1383-7621(03)00002-X_BIB12","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1109\/71.536935","article-title":"An implementation framework for HPF distributed arrays on message-passing parallel computer systems","volume":"7","author":"Reeuwijk","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB13","unstructured":"A. Sethi, Communication generation for data-parallel programs, Ph.D. Thesis, Department of Computer Science, Rice University, December 1996"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/jpdc.1999.1601","article-title":"Efficient index generation for compiling two-level mappings in data-parallel programs","volume":"24","author":"Shih","year":"2000","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB15","doi-asserted-by":"crossref","unstructured":"J.M. Stichnoth, Efficient compilation of array statements for private memory multicomputers, Technical Report CMU-CS-93-109, School of Computer Science, Carnegie\u2013Mellon University, February 1993","DOI":"10.21236\/ADA266595"},{"issue":"2","key":"10.1016\/S1383-7621(03)00002-X_BIB16","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1006\/jpdc.1996.0140","article-title":"Efficient computation of address sequences in data parallel programs using closed forms for basis vectors","volume":"38","author":"Thirumalai","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S1383-7621(03)00002-X_BIB17","doi-asserted-by":"crossref","unstructured":"A. Thirumalai, J. Ramanujam, Fast address sequence generation for data-parallel programs using integer lattices, in: Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, vol. 1033, Springer-Verlag, 1996, pp. 291\u2013308","DOI":"10.1007\/BFb0014200"},{"issue":"2","key":"10.1016\/S1383-7621(03)00002-X_BIB18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1142\/S0129626497000206","article-title":"Communication generation for block\u2013cyclic distributions","volume":"7","author":"Venkatachar","year":"1997","journal-title":"Parallel Processing Letters"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138376210300002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138376210300002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T05:51:09Z","timestamp":1553665869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138376210300002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":18,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S138376210300002X"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(03)00002-x","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}