Computing OR on a Randomized Fixed Adversary CRCW PRAM
暂无分享，去创建一个
Abstract For each constant k , a randomized fixed adversary CRCW PRAM can compute an OR of N bits in constant time using N log k N processors and with probability of error 1 − N −Ω(log k − 2 N) .
[1] Bruce M. Kapron,et al. Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution , 1993, STACS.
[2] Ludek Kucera,et al. Parallel Computation and Conflicts in Memory Access , 1982, Information Processing Letters.
[3] Torben Hagerup,et al. Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM , 1990, SPAA '90.