{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T07:17:45Z","timestamp":1694589465370},"reference-count":29,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0167-739x(96)00027-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:05:41Z","timestamp":1027595141000},"page":"421-429","source":"Crossref","is-referenced-by-count":1,"title":["Iteration space partitioning"],"prefix":"10.1016","volume":"12","author":[{"given":"Aart J.C.","family":"Bik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry A.G.","family":"Wijshoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(96)00027-1_BIB1","series-title":"Proc. of 3 ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming","first-page":"39","article-title":"Scanning polyhedra with DO loops","author":"Ancourt","year":"1991"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB2","author":"Banerjee","year":"1988"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB3","series-title":"Proc. of 3 Workshop on Languages and Compilers for Parallel Computing","article-title":"Unimodular transformations of double loops","author":"Banerjee","year":"1990"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB4","author":"Banerjee","year":"1993"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB5","author":"Banerjee","year":"1994"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB6","article-title":"Compiler Support for Sparse Matrix Computations","author":"Bik","year":"1996"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1006\/jpdc.1995.1141","article-title":"Advanced compiler optimizations for sparse computations","volume":"31","author":"Bik","year":"1995","journal-title":"J. Parallel and Distributed Comput."},{"issue":"2","key":"10.1016\/S0167-739X(96)00027-1_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/71.485501","article-title":"Automatic data structures selection and transformation for sparse matrix computations","volume":"7","author":"Bik","year":"1996","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1006\/jpdc.1996.0048","article-title":"The use of iteration space partitioning to construct representative simple sections","volume":"34","author":"Bik","year":"1996","journal-title":"J. Parallel and Distributed Comput."},{"key":"10.1016\/S0167-739X(96)00027-1_BIB10","author":"Borsuk","year":"1969"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB11","author":"Dantzig","year":"1963"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB12","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","article-title":"Fourier-Motzkin elimination and its dual","volume":"14","author":"Dantzig","year":"1973","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-8191(90)90055-E","article-title":"Optimal code parallelization using unimodular transformations","volume":"16","author":"Dowling","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-739X(96)00027-1_BIB14","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB15","series-title":"Proc. of the 5 Int. Workshop on Compilers for Parallel Computers","first-page":"200","article-title":"On reducing overhead in loops","author":"Knijnenburg","year":"1995"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/360827.360844","article-title":"The parallel execution of DO loops","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB17","series-title":"Proc. of the 5 Int. Conf. on Architectural Support for Programming Languages and Operating Systems","first-page":"285","article-title":"Access normalization: Loop restructuring for numa compilers","author":"Li","year":"1992"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB18","series-title":"Proc. of the 5 Workshop on Languages and Compilers for Parallel Computing","article-title":"A singular loop transformation framework based on non-singular matrices","author":"Li","year":"1992"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/321992.322000","article-title":"Program improvement by source-to-source transformations","volume":"24","author":"Loveman","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB20","author":"McMullen","year":"1971"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB21","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","article-title":"Advanced compiler optimizations for supercomputers","volume":"29","author":"Padua","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB22","author":"Polychronopoulos","year":"1988"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB23","author":"Preparata","year":"1985"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB24","author":"Towers","year":"1988"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB25","series-title":"Proc. ACM SIGPLAN Conf. on Programming Languages Design and Implementation","first-page":"30","article-title":"A data locality optimizing algorithm","author":"Wolf","year":"1991"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB26","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/71.97902","article-title":"A loop transformation theory and an algorithm to maximize parallelism","author":"Wolf","year":"1991","journal-title":"IEEE Trans. on Parallel and Distributed Algorithms"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB27","author":"Wolfe","year":"1989"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB28","author":"Wolfe","year":"1996"},{"key":"10.1016\/S0167-739X(96)00027-1_BIB29","author":"Zima","year":"1990"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X96000271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X96000271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T11:29:46Z","timestamp":1556364586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X96000271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0167739X96000271"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(96)00027-1","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}