{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:23Z","timestamp":1757629463683,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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,6]]},"DOI":"10.1016\/0743-7315(87)90036-0","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"250-265","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Notes on the complexity of systolic programs"],"prefix":"10.1016","volume":"4","author":[{"given":"Stephen","family":"Taylor","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Hellerstein","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Safra","sequence":"additional","affiliation":[]},{"given":"Ehud","family":"Shapiro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-7315(87)90036-0_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(87)90036-0_BIB2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/322047.322057","article-title":"Some complexity results for matrix computations on parallel processors","volume":"25","author":"Gentleman","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"article-title":"An abstract machine for Flat Concurrent Prolog","year":"1986","author":"Houri","key":"10.1016\/0743-7315(87)90036-0_BIB3"},{"year":"1984","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","key":"10.1016\/0743-7315(87)90036-0_BIB4"},{"key":"10.1016\/0743-7315(87)90036-0_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","volume":"15","author":"Kung","year":"1982","journal-title":"IEEE Comput."},{"article-title":"The warp processor. A versatile systolic array for very high speed signal processing","year":"1984","author":"Kung","key":"10.1016\/0743-7315(87)90036-0_BIB6"},{"key":"10.1016\/0743-7315(87)90036-0_BIB7","series-title":"Introduction to VLSI Systems","first-page":"271","article-title":"Algorithms for VLSI processor arrays","author":"Kung","year":"1980"},{"article-title":"Communication issues in parallel algorithms and computers","year":"1979","author":"Lint","key":"10.1016\/0743-7315(87)90036-0_BIB8"},{"issue":"2","key":"10.1016\/0743-7315(87)90036-0_BIB9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TSE.1981.230833","article-title":"Communication issues in the design and analysis of parallel algorithms","volume":"SE-7","author":"Lint","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"year":"1980","series-title":"Mindstorms: Children, Computers, and Powerful Ideas","author":"Pappert","key":"10.1016\/0743-7315(87)90036-0_BIB10"},{"key":"10.1016\/0743-7315(87)90036-0_BIB11","unstructured":"Safra, S., and Shapiro, E. Meta-interpreters for real. Proc. IFIP-86."},{"article-title":"Partial evaluation of Concurrent Prolog and its implications","year":"1986","author":"Safra","key":"10.1016\/0743-7315(87)90036-0_BIB12"},{"key":"10.1016\/0743-7315(87)90036-0_BIB13","series-title":"Proc. International Conference on Fifth Generation Computer Systems","first-page":"458","article-title":"Systolic programming: A paradigm for parallel processing","author":"Shapiro","year":"1984"},{"key":"10.1016\/0743-7315(87)90036-0_BIB14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MC.1986.1663307","article-title":"Concurrent Prolog: A progress report","author":"Shapiro","year":"1986","journal-title":"IEEE Comput."},{"key":"10.1016\/0743-7315(87)90036-0_BIB15","series-title":"Proc. 1985 International Conference on Parallel Processing","first-page":"552","article-title":"A distributed unification scheme for systolic logic programs","author":"Tamaki","year":"1985"},{"key":"10.1016\/0743-7315(87)90036-0_BIB16","unstructured":"Taylor, S., Av-Ron, E., and Shapiro, E. A layered method for process and code mapping. Journal of New Generation Computing, in press."},{"year":"1986","series-title":"A parallel implementation of Flat Concurrent Prolog","author":"Taylor","key":"10.1016\/0743-7315(87)90036-0_BIB17"},{"issue":"4","key":"10.1016\/0743-7315(87)90036-0_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/359461.359481","article-title":"Sorting on a mesh-connected parallel computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. ACM"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731587900360?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:25Z","timestamp":1757514565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731587900360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0743731587900360"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(87)90036-0","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1987,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Notes on the complexity of systolic programs","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)90036-0","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"}]}}