{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:50:19Z","timestamp":1648723819746},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1991,9]]},"abstract":"<jats:p> Quite recently it has been proved that a two-dimensional processor array with a reconfigurable bus system (PARBS, for short) is at least as powerful as the CRCW shared memory computer. In this note we argue that the well-known PARITY problem can be solved in O(1) time on a two-dimensional PARBS of (n+1)\u00d7n processors. Since it is known that PARITY cannot be solved in constant time on a CRCW even if a polynomial number of processors is available, our result shows that the two-dimensional PARBS is strictly more powerful than the CRCW. <\/jats:p>","DOI":"10.1142\/s0129626491000185","type":"journal-article","created":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T12:12:21Z","timestamp":1101384741000},"page":"29-34","source":"Crossref","is-referenced-by-count":15,"title":["ON THE POWER OF TWO-DIMENSIONAL PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS"],"prefix":"10.1142","volume":"01","author":[{"given":"STEPHAN","family":"OLARIU","sequence":"first","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAMES L.","family":"SCHWING","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JINGYUAN","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529-0162, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626491000185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:58:44Z","timestamp":1565143124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626491000185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[1991,9]]}},"alternative-id":["10.1142\/S0129626491000185"],"URL":"https:\/\/doi.org\/10.1142\/s0129626491000185","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}