{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:05:05Z","timestamp":1753880705347,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p> The prefix sums problem for an array [Formula: see text] is to compute all sums [Formula: see text], [Formula: see text]. In this paper, we introduce an improvement for the best previous algorithm that runs in [Formula: see text] time using [Formula: see text] processors on a Sum Concurrent Read Concurrent Write, Parallel Random Access Machine (Sum-CRCW PRAM). The improvements include (1)\u00a0reducing the total number of operations and (2)\u00a0reducing the amount of storage required by the algorithm. <\/jats:p>","DOI":"10.1142\/s0129626422500086","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T15:16:29Z","timestamp":1663082189000},"source":"Crossref","is-referenced-by-count":1,"title":["An Improved Parallel Prefix Sums Algorithm"],"prefix":"10.1142","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9448-6168","authenticated-orcid":false,"given":"Hazem M.","family":"Bahig","sequence":"first","affiliation":[{"name":"Information and Computer Science Department, College of Computer Science and Engineering, University of Hail, Hail, Kingdom of Saudi Arabia"},{"name":"Computer Science Division, Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled A.","family":"Fathy","sequence":"additional","affiliation":[{"name":"Mathematics Department, Faculty of Science, Al-Azhar University, Cairo, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"volume-title":"Parallel Computation: Models and Methods","year":"1997","author":"Akl S.","key":"S0129626422500086BIB002"},{"key":"S0129626422500086BIB003","doi-asserted-by":"publisher","DOI":"10.1080\/01495739908947372"},{"volume-title":"An Introduction to Parallel Algorithms","year":"1992","author":"Jaja J.","key":"S0129626422500086BIB004"},{"key":"S0129626422500086BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.6312202"},{"key":"S0129626422500086BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90036-9"},{"key":"S0129626422500086BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-006-0214-y"},{"key":"S0129626422500086BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03473-x"},{"key":"S0129626422500086BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-010-0124-x"},{"key":"S0129626422500086BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2129-0"},{"key":"S0129626422500086BIB011","doi-asserted-by":"publisher","DOI":"10.1186\/s42787-019-0004-2"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626422500086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T08:39:26Z","timestamp":1665391166000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626422500086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":10,"journal-issue":{"issue":"03n04","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.1142\/S0129626422500086"],"URL":"https:\/\/doi.org\/10.1142\/s0129626422500086","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2022,9]]},"article-number":"2250008"}}