共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
《Journal of Parallel and Distributed Computing》2004,64(3):319-326
It is known that steps are needed to simulate one step of ARBITRARY CRCW PRAMs by COMMON CRCW PRAMs, but it was open whether there is a faster simulation when randomization is allowed. This paper gives both positive and negative answers. (i) It is shown that one step of ARBITRARY can be simulated by steps on randomized COMMON with error-rate n−c, where m=n/k is the number of different memory cells into which at least one processor of the simulated PRAM attempts to write. The deterministic -step simulation does not become faster for smaller m, while our randomized simulation becomes when . (ii) It is shown that when steps are needed to simulate one step of ARBITRARY by COMMON even if randomization is allowed. This lower-bound result needs some assumption on processor communication but it strongly suggests randomization does not help when m is small. 相似文献
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.