{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:25:53Z","timestamp":1762295153730,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990,1]]},"DOI":"10.1016\/0743-7315(90)90073-x","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"89-95","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Solving linear recurrence systems on mesh-connected computers with multiple global buses"],"prefix":"10.1016","volume":"8","author":[{"given":"David A.","family":"Carlson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0743-7315(90)90073-X_BIB1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","article-title":"Optimal bounds for finding maximum on array of processors with k global buses","volume":"C-35","author":"Aggarwal","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(90)90073-X_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","article-title":"Finding maximum on an array processor with a global bus","volume":"C-33","author":"Bokhari","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(90)90073-X_BIB3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","article-title":"A regular layout for parallel adders","volume":"C-31","author":"Brent","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90073-X_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\/0743-7315(90)90073-X_BIB5","series-title":"Proc. 1985 International Conference on Parallel Processing","first-page":"715","article-title":"Performing tree and prefix computations of modified mesh-connected parallel computers","author":"Carlson","year":"1985"},{"key":"10.1016\/0743-7315(90)90073-X_BIB6","series-title":"Proc. 1st International Conference on Supercomputing Systems","first-page":"618","article-title":"The mesh with a global mesh: A flexible, high-speed organization for parallel computation","author":"Carlson","year":"1985"},{"issue":"10","key":"10.1016\/0743-7315(90)90073-X_BIB7","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1109\/12.5998","article-title":"Modified mesh-connected parallel computers","volume":"C-37","author":"Carlson","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90073-X_BIB8","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":"1","key":"10.1016\/0743-7315(90)90073-X_BIB9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-8191(89)90065-3","article-title":"Adapting shuffle-exchange like parallel processing architectures to work as systolic arrays","volume":"11","author":"Carlson","year":"1989","journal-title":"Parallel Comput."},{"issue":"7","key":"10.1016\/0743-7315(90)90073-X_BIB10","first-page":"707","article-title":"Time and parallel processor bounds for linear recurrence systems","volume":"C-24","author":"Chen","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90073-X_BIB11","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/355791.355797","article-title":"Practical parallel band triangular system solvers","volume":"4","author":"Chen","year":"1978","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0743-7315(90)90073-X_BIB12","series-title":"Proc. 15th ACM Symposium on Theory of Computing","first-page":"100","article-title":"New bounds for parallel prefix circuits","author":"Fich","year":"1983"},{"key":"10.1016\/0743-7315(90)90073-X_BIB13","series-title":"Proc. 1978 International Conference on Parallel Processing","first-page":"246","article-title":"Processor arrays for computing linear recurrence systems","author":"Gajski","year":"1978"},{"issue":"3","key":"10.1016\/0743-7315(90)90073-X_BIB14","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":"C-30","author":"Gajski","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(90)90073-X_BIB15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(82)90081-3","article-title":"Efficient parallel algorithms for linear recurrence computation","volume":"15","author":"Greenberg","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(90)90073-X_BIB16","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1147\/rd.182.0138","article-title":"Parallel solution of recurrence problems","volume":"18","author":"Kogge","year":"1974","journal-title":"IBM J. Res. Develop."},{"issue":"8","key":"10.1016\/0743-7315(90)90073-X_BIB17","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":"C-22","author":"Kogge","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(90)90073-X_BIB18","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0743-7315(90)90073-X_BIB19","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":"1","key":"10.1016\/0743-7315(90)90073-X_BIB20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","article-title":"Array processor with multiple broadcasting","volume":"4","author":"Prasanna-Kumar","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"10.1016\/0743-7315(90)90073-X_BIB21","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"1","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0743-7315(90)90073-X_BIB22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1145\/321738.321741","article-title":"An efficient algorithm for the solution of a tridiagonal linear system on equations","volume":"20","author":"Stone","year":"1973","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0743-7315(90)90073-X_BIB23","doi-asserted-by":"crossref","first-page":"153","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."},{"issue":"9","key":"10.1016\/0743-7315(90)90073-X_BIB24","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/TC.1983.1676331","article-title":"Mesh-connected computers with broadcasting","volume":"C-32","author":"Stout","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90073-X_BIB25","series-title":"Proc. 27th Symposium on Foundations of Computer Science","first-page":"264","article-title":"Meshes with multiple buses","author":"Stout","year":"1986"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090073X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090073X?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:30:04Z","timestamp":1757514604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090073X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["074373159090073X"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90073-x","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving linear recurrence systems on mesh-connected computers with multiple global buses","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(90)90073-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}