{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:13Z","timestamp":1775053453158,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0167-9260(95)00022-4","type":"journal-article","created":{"date-parts":[[2004,5,26]],"date-time":"2004-05-26T13:39:26Z","timestamp":1085578766000},"page":"139-159","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Resource-constrained scheduling of partitioned algorithms on processor arrays"],"prefix":"10.1016","volume":"20","author":[{"given":"Mich\u00e8le","family":"Dion","sequence":"first","affiliation":[]},{"given":"Tanguy","family":"Risset","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(95)00022-4_BIB1","series-title":"International Conference on Application Specific Array Processing","first-page":"591","article-title":"A design methodology for fixed-size systolic arrays","author":"Bu","year":"1990"},{"key":"10.1016\/0167-9260(95)00022-4_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-9260(91)90026-H","article-title":"Regular partitioning for synthesizing fixed-size systolic arrays","volume":"12","author":"Darte","year":"1991","journal-title":"INTEGRATION, VLSI J"},{"key":"10.1016\/0167-9260(95)00022-4_BIB3","series-title":"Proc. 15th Ann. ACM Symp. on Principles of Programming Languages","first-page":"319","article-title":"Supernode partitioning","author":"Irigoin","year":"1988"},{"key":"10.1016\/0167-9260(95)00022-4_BIB4","series-title":"IEEE Symp. on Circuits and Systems","article-title":"Optimal partitioning scheme for wavefront\/systolic array processors","author":"Jainandunsing","year":"1986"},{"key":"10.1016\/0167-9260(95)00022-4_BIB5","series-title":"VLSI Array Processors","author":"Kung","year":"1988"},{"issue":"1","key":"10.1016\/0167-9260(95)00022-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","article-title":"Partitioning and mapping algorithms into fixed-size systolic arrays","volume":"35","author":"Moldovan","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00022-4_BIB7","article-title":"Automatic blocking of nested loops","author":"Schreiber","year":"1990"},{"key":"10.1016\/0167-9260(95)00022-4_BIB8","series-title":"Proc. Supercomputing'92","first-page":"214","article-title":"Non-unimodular transformations of nested loops","author":"Ramanujam","year":"1992"},{"issue":"1","key":"10.1016\/0167-9260(95)00022-4_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/156668.156676","article-title":"On data dependence analysis for compiling programs on distributedmemory machines","volume":"28","author":"Sharma","year":"1993","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0167-9260(95)00022-4_BIB10","first-page":"179","article-title":"Tiling of iteration spaces for multicomputers","volume":"Vol. 2","author":"Ramanujam","year":"1990"},{"key":"10.1016\/0167-9260(95)00022-4_BIB11","first-page":"225","article-title":"Finding optimum wavefront of parallel computation","volume":"Vol. 2","author":"Sinharoy","year":"1993"},{"key":"10.1016\/0167-9260(95)00022-4_BIB12","series-title":"Scalable High Performance Computing Conference","first-page":"568","article-title":"(Pen)-ultimate tiling?","author":"Boulet","year":"1994"},{"key":"10.1016\/0167-9260(95)00022-4_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-9260(93)90021-4","article-title":"Example of combined algorithm development and architecture design","volume":"16","author":"Deprettere","year":"1993","journal-title":"INTEGRATION, VLSI J."},{"issue":"2","key":"10.1016\/0167-9260(95)00022-4_BIB14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S012915649300008X","article-title":"Model and methods for regular array design","volume":"4","author":"Deprettere","year":"1993","journal-title":"Internat. J. High Speed Electron. Systems"},{"key":"10.1016\/0167-9260(95)00022-4_BIB15","series-title":"Application Specific Array Processors ASAP 93","first-page":"53","article-title":"Scheduling partitioned algorithms with limited communication supports","author":"Chou","year":"1993"},{"key":"10.1016\/0167-9260(95)00022-4_BIB16","series-title":"Application Specific Array Processors ASAP 93","first-page":"29","article-title":"Resource constrained scheduling of uniform algorithms","author":"Thiele","year":"1993"},{"key":"10.1016\/0167-9260(95)00022-4_BIB17","article-title":"Resource-constrained scheduling of partitioned algorithms on processor arrays","author":"Dion","year":"1994"},{"key":"10.1016\/0167-9260(95)00022-4_BIB18","first-page":"136","article-title":"Generic scheduling polyhedra and new mixed-integer formulation for single-machine scheduling","author":"Lasserre","year":"1992","journal-title":"Integer Programming and Combinatorial Optimization"},{"key":"10.1016\/0167-9260(95)00022-4_BIB19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0377-2217(91)90304-E","article-title":"Mathematical programming formulations for machine scheduling: A survey","volume":"51","author":"Blazewicz","year":"1991","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0167-9260(95)00022-4_BIB20","article-title":"Partitioning for array processors","author":"Darte","year":"1990"},{"issue":"2","key":"10.1016\/0167-9260(95)00022-4_BIB21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S0129626491000021","article-title":"Linear scheduling is nearly optimal","volume":"1","author":"Darte","year":"1991","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/0167-9260(95)00022-4_BIB22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","article-title":"Parametric integer programming","volume":"22","author":"Feautrier","year":"1988","journal-title":"RAIRO Rech. Op\u00e9r."},{"key":"10.1016\/0167-9260(95)00022-4_BIB23","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/135226.135233","article-title":"The Omega test: a fast and practical integer programming algorithm for dependence analysis","volume":"8","author":"Pugh","year":"1992","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-9260(95)00022-4_BIB24","article-title":"Partitioning of parametrized dataflow graphs","author":"Martens","year":"1993"},{"key":"10.1016\/0167-9260(95)00022-4_BIB25","series-title":"Parallel and Distributed Algorithms","first-page":"165","article-title":"Task scheduling over distributed memory machines","author":"Chretienne","year":"1989"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:36Z","timestamp":1757453796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926095000224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167926095000224"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(95)00022-4","relation":{},"ISSN":["0167-9260"],"issn-type":[{"value":"0167-9260","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Resource-constrained scheduling of partitioned algorithms on processor arrays","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(95)00022-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}