{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:08:34Z","timestamp":1773796114790,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0167-8191(02)00098-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"915-939","source":"Crossref","is-referenced-by-count":12,"title":["Time-minimal tiling when rise is larger than zero"],"prefix":"10.1016","volume":"28","author":[{"given":"Jingling","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentong","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00098-4_BIB1","unstructured":"R. Andonov, P.Y. Calland, S. Niar, S. Rajopadhye, N. Yaney, First steps towards optimal oblique tile sizing, 8th International Workshop on Compilers for parallel computers, Aussois, January 2000, pp. 351\u2013366"},{"issue":"2","key":"10.1016\/S0167-8191(02)00098-4_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/jpdc.1997.1371","article-title":"Optimal orthogonal tiling of 2-D iterations","volume":"45","author":"Andonov","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB3","doi-asserted-by":"crossref","unstructured":"R. Andonov, S. Rajopadhye, N. Yanev, Optimal orthogonal tiling, in: D. Pritchard, J. Reeve (Eds.), 1998 European Parallel Processing Conference, Lecture Notes in Computer Science, September 1998, pp. 480\u2013490","DOI":"10.1007\/BFb0057891"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-9260(94)90019-1","article-title":"(Pen)-ultimate tiling","volume":"17","author":"Boulet","year":"1994","journal-title":"Integration, the VLSI Journal"},{"issue":"3","key":"10.1016\/S0167-8191(02)00098-4_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1096-9128(199903)11:3<139::AID-CPE370>3.0.CO;2-X","article-title":"Tiling on systems with communication\/computation overlap","volume":"11","author":"Calland","year":"1999","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB6","doi-asserted-by":"crossref","unstructured":"P.Y. Calland, T. Risset, Precise tiling for uniform loop nests, in: P. Cappello (Ed.), International Conference on Application Specific Array Processors, IEEE Computer Society Press, 1995, pp. 330\u2013337","DOI":"10.1109\/ASAP.1995.522937"},{"issue":"1","key":"10.1016\/S0167-8191(02)00098-4_BIB7","first-page":"167","article-title":"Determining the idle time of a tiling: new results","volume":"14","author":"Desprez","year":"1998","journal-title":"Journal of Information Science and Engineering (Special Issue on Compiler Techniques for High-Performance Computing)"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB8","series-title":"Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering","author":"Foster","year":"1994"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB9","series-title":"Introduction to the Theory of Equations","author":"Griffiths","year":"1947"},{"issue":"5","key":"10.1016\/S0167-8191(02)00098-4_BIB10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/71.679213","article-title":"On suprenode transformation with minimized total running time","volume":"9","author":"Hod\u017ei\u0107","year":"1998","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB11","doi-asserted-by":"crossref","unstructured":"K. H\u00f6gstedt, L. Carter, J. Ferrante, Determining the idle time of a tiling, 24th Annual ACM Symposium on Principles of Programming Languages, Paris, January 1997, pp. 160\u2013173","DOI":"10.1145\/263699.263716"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB12","doi-asserted-by":"crossref","unstructured":"K. H\u00f6gstedt, L. Carter, J. Ferrante, Selecting tile shape for minimal execution time, 11th ACM Symposium on Parallel Algorithms and Architectures, June 1999, pp. 201\u2013211","DOI":"10.1145\/305619.305641"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB13","doi-asserted-by":"crossref","unstructured":"F. Irigoin, R. Triolet, Supernode partitioning, 15th Annual ACM Symposium on Principles of Programming Languages, San Diego, California, January 1988, pp. 319\u2013329","DOI":"10.1145\/73560.73588"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB14","doi-asserted-by":"crossref","unstructured":"H. Ohta, Y. Saito, M. Kainaga, H. Ono, Optimal tile size adjustment in compiling for general DOACROSS loop nests, 1995 ACM International Conference on Supercomputing, ACM Press, 1995, pp. 270\u2013279","DOI":"10.1145\/224538.224571"},{"issue":"2","key":"10.1016\/S0167-8191(02)00098-4_BIB15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0743-7315(92)90027-K","article-title":"Tiling multidimensional iteration spaces for multicomputers","volume":"16","author":"Ramanujam","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB16","doi-asserted-by":"crossref","unstructured":"G. Rivera, C.-W. Tseng, A comparison of compiler tiling algorithms, 8th International Conference on Compiler Construction, Armsterdam, the Netherlands, March 1999","DOI":"10.1007\/978-3-540-49051-7_12"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB17","unstructured":"R. Schreiber, J.J. Dongarra, Automatic blocking of nested loops, Technical Report 90.38, RIACS, May 1990"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB18","doi-asserted-by":"crossref","unstructured":"Y. Song, Z. Li, New tiling techniques to improve cache temporal locality, ACM SIGPLAN'99 Conference on Programming Language Design and Implementation, May 1999, pp. 215\u2013228","DOI":"10.1145\/301618.301668"},{"issue":"11","key":"10.1016\/S0167-8191(02)00098-4_BIB19","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1016\/S0167-8191(00)00040-5","article-title":"Generating efficient tiled code for distributed memory machines","volume":"26","author":"Tang","year":"2000","journal-title":"Parallel Computing"},{"issue":"4","key":"10.1016\/S0167-8191(02)00098-4_BIB20","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/71.97902","article-title":"A loop transformation theory and an algorithm to maximize parallelism","volume":"2","author":"Wolf","year":"1991","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00098-4_BIB21","doi-asserted-by":"crossref","unstructured":"M.J. Wolfe, More iteration space tiling, Supercomputing '88, November 1989, pp. 655\u2013664","DOI":"10.1145\/76263.76337"},{"issue":"1","key":"10.1016\/S0167-8191(02)00098-4_BIB22","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1006\/jpdc.1997.1310","article-title":"Communication-minimal tiling of uniform dependence loops","volume":"42","author":"Xue","year":"1997","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"10.1016\/S0167-8191(02)00098-4_BIB23","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S0129626497000401","article-title":"On tiling as a loop transformation","volume":"7","author":"Xue","year":"1997","journal-title":"Parallel Processing Letters"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000984?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000984?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:59:21Z","timestamp":1555178361000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102000984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0167819102000984"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00098-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}