{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:00:03Z","timestamp":1725577203103},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669074"},{"type":"electronic","value":"9783540466420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-46642-0_17","type":"book-chapter","created":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T13:35:26Z","timestamp":1296221726000},"page":"120-124","source":"Crossref","is-referenced-by-count":0,"title":["An Interprocedural Framework for the Data and Loops Partitioning in the SIMD Machines"],"prefix":"10.1007","author":[{"given":"Jin","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruliang","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningning","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Li, J., Chen, M.: Index Domain Alignment: Minimizing Cost of Cross-Referencing between Distributed Arrays. In: Proc. of the 3rd Symposium on the Frontiers of Massively Parallel Computation, College Park MD, pp. 424\u2013433 (1990)","DOI":"10.1109\/FMPC.1990.89493"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Kremer, U.: Automatic Data Layout for Distributed Memory Machines. Ph.D. thesis, Rice University (1995)","DOI":"10.1007\/978-3-322-87865-6_8"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, S.K.S., Krishnamurthy, S.: An Interprocedural Framework for Determining Efficient Data Redistributions in Distributed Memory Machines. In: Proc. of the 6th Symposium on the Frontiers of Massively Parallel Computing, Annapolis Maryland, pp. 233\u2013240 (1996)","DOI":"10.1109\/FMPC.1996.558091"},{"key":"17_CR4","unstructured":"Anderson, J.: Automatic Computation and Data Decomposition for Multiprocessors. Ph.D. thesis, Stanford University (1997)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1006\/jpdc.1996.0139","volume":"38","author":"M. Dion","year":"1996","unstructured":"Dion, M., Randriamro, C., Robert, Y.: Compiling Affine Nested Loop: How to Optimize the Residual Communications after the Alignment Phase. J. of Parallel and Distributed Computing\u00a038, 176\u2013187 (1996)","journal-title":"J. of Parallel and Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46642-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T01:57:57Z","timestamp":1559959077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46642-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669074","9783540466420"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46642-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}