{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T10:22:58Z","timestamp":1794392578330,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"value":"9781461359791","type":"print"},{"value":"9781461523154","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/978-1-4615-2315-4_14","type":"book-chapter","created":{"date-parts":[[2011,8,6]],"date-time":"2011-08-06T18:44:28Z","timestamp":1312656268000},"page":"185-197","source":"Crossref","is-referenced-by-count":6,"title":["Communication Generation for Cyclic(K) Distributions"],"prefix":"10.1007","author":[{"given":"Ken","family":"Kennedy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nenad","family":"Nedeljkovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajay","family":"Sethi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Generating local addresses and communication sets for data-parallel programs","author":"S Chatterjee","year":"1993","unstructured":"S. Chatterjee, J. Gilbert, F. Long, R. Schreiber, and S. Teng. Generating local addresses and communication sets for data-parallel programs. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, May 1993."},{"key":"14_CR2","volume-title":"Communication optimizations for irregular scientific computations on distributed memory architectures","author":"R Das","year":"1993","unstructured":"R. Das, M. Uysal, J. Saitz, and Y-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Technical Report CS-TR3163, Dept. of Computer Science, Univ. of Maryland, College Park, October 1993."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/cpe.4330020303","volume":"2","author":"M Gerndt","year":"1990","unstructured":"M. Gerndt. Updating distributed variables in local computations. Concurrency: Practice and Experience, 2(3):171\u2013193, September 1990.","journal-title":"Concurrency: Practice and Experience"},{"key":"14_CR4","volume-title":"On compiling array expressions for efficient execution on distributed-memory machines","author":"SKS Gupta","year":"1994","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. Technical Report OSU-CISRC-4\/94-TR19, Department of Computer and Information Science, The Ohio State University, April 1994."},{"key":"14_CR5","volume-title":"Compiler optimizations for Fortran D on MIMD distributed-memory machines","author":"S Hiranandani","year":"1991","unstructured":"S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiler optimizations for Fortran D on MIMD distributed-memory machines. In Proceedings of Supercomputing \u201881, Albuquerque, NM, November 1991."},{"key":"14_CR6","volume-title":"Private communication","author":"SD Kaushik","year":"1995","unstructured":"S. D. Kaushik. Private communication, April 1995."},{"key":"14_CR7","volume-title":"Efficient address generation for block-cyclic distributions","author":"K Kennedy","year":"1995","unstructured":"K. Kennedy, N. Nedeljkovi\u0107, and A. Sethi. Efficient address generation for block-cyclic distributions. In Proceedings of the 1995 ACM International Conference on Supercomputing, Barcelona, Spain, July 1995."},{"key":"14_CR8","volume-title":"A linear-time algorithm for computing the memory access sequence in data-parallel programs","author":"K Kennedy","year":"1995","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 SIGPLANSymposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, July 1995."},{"key":"14_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/ADA266595","volume-title":"Efficient compilation of array statements for private memory multicomputers","author":"J Stichnoth","year":"1993","unstructured":"J. Stichnoth. Efficient compilation of array statements for private memory multicomputers. Technical Report CMU-CS-93\u2013109, School of Computer Science, Carnegie Mellon University, February 1993."}],"container-title":["Languages, Compilers and Run-Time Systems for Scalable Computers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4615-2315-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T06:52:03Z","timestamp":1619851923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4615-2315-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9781461359791","9781461523154"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4615-2315-4_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4615-2315-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[1996]]}}}