ON THE POWER OF TWO-DIMENSIONAL PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS
1991 ◽
Vol 01
(01)
◽
pp. 29-34
◽
Keyword(s):
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)×n 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.
1990 ◽
Vol 36
(1)
◽
pp. 31-36
◽
1993 ◽
Vol 03
(01)
◽
pp. 71-78
◽
Keyword(s):
1990 ◽
Vol 34
(4)
◽
pp. 187-192
◽
1993 ◽
Vol 140
(2)
◽
pp. 101
2001 ◽
Vol 266
(2-3)
◽
pp. 231-236
◽
Keyword(s):
1993 ◽
Vol 03
(02)
◽
pp. 171-177
◽