{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:27:52Z","timestamp":1762154872801,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0167-8191(96)00019-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"701-724","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved schemes for mapping arbitrary algorithms onto processor meshes"],"prefix":"10.1016","volume":"22","author":[{"given":"Borut","family":"Robi\u010d","sequence":"first","affiliation":[]},{"given":"Bo\u0161tjan","family":"Vilfan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-8191(96)00019-1_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0167-8191(96)00019-1_BIB2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1006\/jpdc.1993.1117","article-title":"Efficient algorithms for mapping and partitioning a class of parallel computations","volume":"19","author":"Choi","year":"1993","journal-title":"J. Parallel Distributed Comput."},{"issue":"11","key":"10.1016\/0167-8191(96)00019-1_BIB3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MC.1980.1653418","article-title":"Dataflow supercomputers","volume":"13","author":"Dennis","year":"1980","journal-title":"IEEE Computer"},{"issue":"7","key":"10.1016\/0167-8191(96)00019-1_BIB4","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/TC.1987.1676984","article-title":"Assignment of job modules onto array processors","volume":"36","author":"Fukunaga","year":"1987","journal-title":"IEEE Trans. Comput."},{"year":"1979","author":"Garey","key":"10.1016\/0167-8191(96)00019-1_BIB5"},{"key":"10.1016\/0167-8191(96)00019-1_BIB6","series-title":"Proc. 1983 Int. Conf. Parallel Processing","first-page":"335","article-title":"A direct mapping of algorithms onto VLSI processing arrays based on the data flow approach","author":"Koren","year":"1983"},{"issue":"10","key":"10.1016\/0167-8191(96)00019-1_BIB7","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/2.7055","article-title":"A data-driven VLSI array for arbitrary algorithms","volume":"21","author":"Koren","year":"1988","journal-title":"IEEE Computer"},{"issue":"2","key":"10.1016\/0167-8191(96)00019-1_BIB8","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-8191(89)90129-4","article-title":"Mapping strategies in message-based multiprocessor systems","volume":"9","author":"Kraemer","year":"1988","journal-title":"Parallel Comput."},{"year":"1987","author":"van Laarhoven","key":"10.1016\/0167-8191(96)00019-1_BIB9"},{"key":"10.1016\/0167-8191(96)00019-1_BIB10","series-title":"Proc. 3rd Annual Parallel Proc. Symp.","first-page":"671","article-title":"Comparing quenching and slow simulated annealing on the mapping problem","author":"Lee","year":"1989"},{"issue":"3","key":"10.1016\/0167-8191(96)00019-1_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TC.1986.1676747","article-title":"Design and performance evaluation of EXMAN: An Extended MANchester data flow computer","volume":"35","author":"Patnaik","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0167-8191(96)00019-1_BIB12","first-page":"339","article-title":"Algorithm mapping with parallel simulated annealing","volume":"14","author":"Robi\u010d","year":"1995","journal-title":"Comput. Artif. Intell."},{"issue":"3","key":"10.1016\/0167-8191(96)00019-1_BIB13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0167-8191(92)90098-R","article-title":"Area optimization of dataflow-graph mappings","volume":"18","author":"Robi\u010d","year":"1992","journal-title":"Parallel Comput."},{"issue":"12","key":"10.1016\/0167-8191(96)00019-1_BIB14","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TC.1987.5009494","article-title":"Nearest-neighbor mapping of finite element graphs onto processor meshes","volume":"36","author":"Sadayappan","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0167-8191(96)00019-1_BIB15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1006\/jpdc.1993.1114","article-title":"Architectural improvements for a data-driven VLSI processing array","volume":"19","author":"Weiss","year":"1993","journal-title":"J. Parallel Distributed Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819196000191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819196000191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:21:50Z","timestamp":1762154510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819196000191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0167819196000191"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(96)00019-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1996,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved schemes for mapping arbitrary algorithms onto processor meshes","name":"articletitle","label":"Article Title"},{"value":"Parallel Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-8191(96)00019-1","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"}]}}