{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:48Z","timestamp":1755220968757,"version":"3.43.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":[[2002,2]]},"DOI":"10.1023\/a:1013683521693","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:11:47Z","timestamp":1040663507000},"page":"191-211","source":"Crossref","is-referenced-by-count":8,"title":["Skewed Data Partition and Alignment Techniques for Compiling Programs on Distributed Memory Multicomputers"],"prefix":"10.1007","volume":"21","author":[{"given":"Tzung-Shi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Yung","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"392097_CR1","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'93 Conference on Programming Language Design and Implementation, Albuquerque, NM, pp. 112-125, 1993.","DOI":"10.1145\/155090.155101"},{"key":"392097_CR2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0167-8191(98)00025-8","volume":"24","author":"E. Ayguad\u00e9","year":"1998","unstructured":"E. Ayguad\u00e9, J. Garcia, and U. Kremer. Tools and techniquesfor automatic data layout: a case study. Parallel Computing, 24:557-578, 1998.","journal-title":"Parallel Computing"},{"key":"392097_CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1006\/jpdc.2000.1683","volume":"61","author":"V. Boudet","year":"2001","unstructured":"V. Boudet, F. Rastello, and Y. Robert. Alignment and distribution is not (always) NP-hard. Journal of Parallel and Distributed Computing, 61:501-519, 2001.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"392097_CR4","doi-asserted-by":"crossref","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 techniquesfor parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 5:924-938, 1994.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR5","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1016\/S0167-8191(96)00049-X","volume":"22","author":"M. Dion","year":"1996","unstructured":"M. Dion and Y. Robert. Mapping affine loop nests. Parallel Computing, 22:1372-1397, 1996.","journal-title":"Parallel Computing"},{"key":"392097_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"J. J. Dongarra","year":"1990","unstructured":"J. J. Dongarra, J. D. Croz, S. Hammarling, and I. Duff. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software, 16:1-7, 1990.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"392097_CR7","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1109\/71.920590","volume":"12","author":"J. Garcia","year":"2001","unstructured":"J. Garcia, E. Ayguad\u00e9, and J. Labarta. A framework for integrating data alignment, distribution, and redistribution in distributed memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 12:416-431, 2001.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR8","doi-asserted-by":"crossref","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 compilerson multicomputers. IEEE Transactions on Parallel and Distributed Systems, 3:179-193, 1992.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/71.752779","volume":"10","author":"M. Kandemir","year":"1999","unstructured":"M. Kandemir, A. Choudhary, N. Shenoy, P. Banerjee, and J. Ramanujam, A linear algebra framework for automatic determination of optimal data layouts. IEEE Transactions on Parallel and Distributed Systems, 10:115-135, 1999.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR10","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1016\/0167-8191(95)00052-6","volume":"21","author":"P.-Z. Lee","year":"1995","unstructured":"P.-Z. Lee. Techniques for compiling parallel programson distributed memory multicomputers. Parallel Computing, 21:1895-1923, 1995.","journal-title":"Parallel Computing"},{"key":"392097_CR11","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/71.605769","volume":"8","author":"P.-Z. Lee","year":"1997","unstructured":"P.-Z. Lee. Efficient algorithms for data distribution on distributed memory parallel computers. IEEE Transactions on Parallel and Distributed Systems, 8:825-839, 1997.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0743-7315(91)90090-V","volume":"13","author":"J. Li","year":"1991","unstructured":"J. Li and M. Chen. The data alignment phase in compiling programs for distributed-memory machines. Journal of Parallel and Distributed Computing, 13:213-221, 1991.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"392097_CR13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0167-8191(98)00021-0","volume":"24","author":"A. W. Lim","year":"1998","unstructured":"A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24:445-475, 1998.","journal-title":"Parallel Computing"},{"key":"392097_CR14","doi-asserted-by":"crossref","unstructured":"A. W. Lim, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. In 13th ACM International Conference on Supercomputing, Rhodes, Greece, pp. 228-237, June 1999.","DOI":"10.1145\/305138.305197"},{"key":"392097_CR15","unstructured":"S. R. Prakash and Y. N. Srikant. Communication cost estimation and global data partitioning for distributed memory machines. In Proceedings of 1997 International Conference on High-Performance Computing, India, December 1997."},{"key":"392097_CR16","doi-asserted-by":"crossref","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:472-482, 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR17","first-page":"185","volume":"9","author":"J.-P. Sheu","year":"1995","unstructured":"J.-P. Sheu and T.-S. Chen. Partitioning and mapping of nested loops for linear array multicomputers. The Journal of Supercomputing, 9:185-204, 1995.","journal-title":"The Journal of Supercomputing"},{"key":"392097_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1008112110494","volume":"15","author":"K.-P. Shih","year":"2000","unstructured":"K.-P. Shih, J.-P. Sheu, and C.-H. Huang. Statement-level communication-free partitioning techniques for parallelizing compilers. The Journal of Supercomputing, 15:243-269, 2000.","journal-title":"The Journal of Supercomputing"},{"key":"392097_CR19","doi-asserted-by":"crossref","unstructured":"E. Su, A. Lain, S. Ramaswamy, D. J. Palermo, E. W. Hodges IV, and P. Banerjee. Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers. In Proceedings of 1995 International Conference on Supercomputing, Barcelona, Spain, pp. 424-433, July 1995.","DOI":"10.1145\/224538.224650"},{"key":"392097_CR20","doi-asserted-by":"crossref","unstructured":"S. Tandri and T. S. Abdelrahman. Automatic partitioning of data and computationson scalable shared memory multiprocessors. In Proceedings of 1997 International Conference on Parallel Processing, Bloomingdale, IL, pp. 64-73, August 1997.","DOI":"10.1109\/ICPP.1997.622557"},{"key":"392097_CR21","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1109\/71.879777","volume":"11","author":"P. Tsanakas","year":"2000","unstructured":"P. Tsanakas, N. Koziris, and G. Papakonstantinou. Chain grouping: A method for partitioning loops onto mesh-connected processor arrays. IEEE Transactions on Parallel and Distributed Systems, 11:941-955, 2000.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"392097_CR22","doi-asserted-by":"crossref","unstructured":"M. Wolfe. More iteration space tiling. In Proceedings of the ACM International Conference on Supercomputing, Crete, Greece, pp. 655-664, 1989.","DOI":"10.1145\/76263.76337"},{"key":"392097_CR23","volume-title":"High Performance Compilers for Parallel Computing","author":"M. Wolfe","year":"1996","unstructured":"M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, Inc., Reading, MA, 1996."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013683521693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013683521693\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013683521693.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:21:35Z","timestamp":1754630495000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013683521693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["392097"],"URL":"https:\/\/doi.org\/10.1023\/a:1013683521693","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}