{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:15:37Z","timestamp":1759133737106,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"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":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1016\/0743-7315(87)90018-9","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"439-458","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":93,"title":["On mapping parallel algorithms into parallel architectures"],"prefix":"10.1016","volume":"4","author":[{"given":"Francine","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Snyder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1975","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(87)90018-9_BIB1"},{"key":"10.1016\/0743-7315(87)90018-9_BIB2","series-title":"Proc. 1983 Allerton Conference","article-title":"Edge grammars and parallel computation","author":"Berman","year":"1983"},{"issue":"3","key":"10.1016\/0743-7315(87)90018-9_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"article-title":"The tree machine: A highly concurrent programming environment","year":"1980","author":"Browning","key":"10.1016\/0743-7315(87)90018-9_BIB4"},{"key":"10.1016\/0743-7315(87)90018-9_BIB5","article-title":"A guide to the poker mapping preprocessor","author":"Berman","year":"1984","journal-title":"Purdue Tech. Rep. 488"},{"key":"10.1016\/0743-7315(87)90018-9_BIB6","series-title":"Proc. 1984 Allerton Conference","article-title":"Edge grammars: Decidability results and formal language issues","author":"Berman","year":"1984"},{"key":"10.1016\/0743-7315(87)90018-9_BIB7","article-title":"Graph Grammars and Their Application to Computer Science and Biology","volume":"Vol. 73","author":"Claus","year":"1979"},{"key":"10.1016\/0743-7315(87)90018-9_BIB8","unstructured":"DeGroot, D. Partitioning job structures for SW-Banyan networks. Proc. 1983 International Conference on Parallel Processing."},{"key":"10.1016\/0743-7315(87)90018-9_BIB9","unstructured":"DeGroot, D. Expanding and contracting SW-Banyan networks. Proc. 1983 International Conference on Parallel Processing."},{"issue":"3","key":"10.1016\/0743-7315(87)90018-9_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/359361.359447","article-title":"Preserving average proximity in arrays","volume":"21","author":"DeMillo","year":"1978","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0743-7315(87)90018-9_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/TC.1982.1675994","article-title":"Quotient networks","volume":"C-31","author":"Fishburn","year":"1982","journal-title":"IEEE Trans. Comput."},{"article-title":"New heuristics for the mapping problem","year":"1983","author":"Iqbal","key":"10.1016\/0743-7315(87)90018-9_BIB12"},{"issue":"6","key":"10.1016\/0743-7315(87)90018-9_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(71)80016-8","article-title":"Pair grammars, graph languages and string-to-graph translations","volume":"5","author":"Pratt","year":"1971","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0743-7315(87)90018-9_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Systems Theory"},{"year":"1973","series-title":"Formal Languages","author":"Salomaa","key":"10.1016\/0743-7315(87)90018-9_BIB15"},{"issue":"4","key":"10.1016\/0743-7315(87)90018-9_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"1","key":"10.1016\/0743-7315(87)90018-9_BIB17","doi-asserted-by":"crossref","DOI":"10.1109\/MC.1982.1653826","article-title":"Introduction to the configurable, highly parallel computer","volume":"15","author":"Snyder","year":"1982","journal-title":"Computer"},{"issue":"2","key":"10.1016\/0743-7315(87)90018-9_BIB18","doi-asserted-by":"crossref","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900189?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900189?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:04Z","timestamp":1757514544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731587900189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0743731587900189"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(87)90018-9","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1987,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On mapping parallel algorithms into parallel architectures","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(87)90018-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1987 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}