{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:50:11Z","timestamp":1757541011522},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"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":[[1989,7]]},"DOI":"10.1016\/0167-8191(89)90065-3","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"93-106","source":"Crossref","is-referenced-by-count":6,"title":["Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays"],"prefix":"10.1016","volume":"11","author":[{"given":"David A","family":"Carlson","sequence":"first","affiliation":[]},{"given":"Binay","family":"Sugla","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90065-3_BIB1","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"issue":"2","key":"10.1016\/0167-8191(89)90065-3_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(89)90065-3_BIB3","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/T-C.1973.223757","article-title":"The parallel evaluation of arithmetic expressions without division","volume":"22","author":"Brent","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(89)90065-3_BIB4","series-title":"Proc. 4th International Conference on Distributed Computing Systems","first-page":"192","article-title":"Parallel processing of tree-like computations","author":"Carlson","year":"1984"},{"key":"10.1016\/0167-8191(89)90065-3_BIB5","series-title":"Proc. 1984 International Conference on Parallel Processing","first-page":"310","article-title":"Time and processor efficient parallel algorithms for recurrence equations and related problems","author":"Carlson","year":"1984"},{"issue":"7","key":"10.1016\/0167-8191(89)90065-3_BIB6","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/T-C.1975.224291","article-title":"Time and parallel processor bounds for linear recurrence systems","volume":"24","author":"Chen","year":"1975","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0167-8191(89)90065-3_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1981.1675755","article-title":"An algorithm for solving linear recurrence systems on parallel and pipelined machines","volume":"30","author":"Gajski","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(89)90065-3_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/MC.1982.1653824","article-title":"Networks and algorithms for very large scale parallel computation","volume":"15","author":"Gottlieb","year":"1982","journal-title":"Computer"},{"issue":"3","key":"10.1016\/0167-8191(89)90065-3_BIB9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0022-0000(83)90005-3","article-title":"A survey on new layouts for the shuffle-exchange graph","volume":"26","author":"Kleitman","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-8191(89)90065-3_BIB10","series-title":"The parallel solution of recurrence problems","author":"Kogge","year":"1972"},{"issue":"8","key":"10.1016\/0167-8191(89)90065-3_BIB11","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","article-title":"A parallel algorithm for the efficient solution of a general class of recurrence equations","volume":"22","author":"Kogge","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(89)90065-3_BIB12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/356683.356686","article-title":"A survey of parallel machine organization and programming","volume":"9","author":"Kuck","year":"1977","journal-title":"ACM Comput. Surveys"},{"issue":"1","key":"10.1016\/0167-8191(89)90065-3_BIB13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","article-title":"Why systolic architectures?","volume":"15","author":"Kung","year":"1982","journal-title":"Computer"},{"key":"10.1016\/0167-8191(89)90065-3_BIB14","series-title":"Proc. 1978 SIAM Sparse Matrix Symposium","first-page":"256","article-title":"Systolic arrays (for VLSI)","author":"Kung","year":"1979"},{"key":"10.1016\/0167-8191(89)90065-3_BIB15","series-title":"VLSI 81","first-page":"289","article-title":"Optimal layouts for small shuffle-exchange graphs","author":"Leighton","year":"1981"},{"issue":"2","key":"10.1016\/0167-8191(89)90065-3_BIB16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(73)80043-1","article-title":"Optimal algorithms for parallel polynomial evaluation","volume":"7","author":"Munro","year":"1973","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/0167-8191(89)90065-3_BIB17","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/0167-8191(89)90065-3_BIB18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(89)90065-3_BIB19","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"2","key":"10.1016\/0167-8191(89)90065-3_BIB20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900653?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900653?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:24:57Z","timestamp":1551086697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0167819189900653"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90065-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}