TY - JOUR
T1 - Fast and Efficient Simulations among CRCW PRAMs
AU - Gil, Joseph
AU - Matias, Yossi
PY - 1994/11
Y1 - 1994/11
N2 - We study the problem of fast leaders election on TOLERANT, a CRCW PRAM model which tolerates concurrent write but does not support symmetry breaking. The leaders election problem is related to the problem of simulating stronger CRCW models, which support leaders election by predefined conflict resolution rules. We give a randomized simulation of MAXIMUM-a very strong CRCW PRAM-on TOLERANT. The simulation is optimal, is reliable, and runs in nearly doubly logarithmic time and linear space. This is the first simulation which is fast, optimal, and space-efficient, and therefore grants true comparison of algorithms running on different CRCW PRAMs. Moreover, it implies that the memory to which concurrent read or concurrent write is allowed should never be more than linear-the rest of the memory can always be addressed under the EREW convention. The techniques presented in this paper tackle fundamental difficulties in the design of fast parallel algorithms.
AB - We study the problem of fast leaders election on TOLERANT, a CRCW PRAM model which tolerates concurrent write but does not support symmetry breaking. The leaders election problem is related to the problem of simulating stronger CRCW models, which support leaders election by predefined conflict resolution rules. We give a randomized simulation of MAXIMUM-a very strong CRCW PRAM-on TOLERANT. The simulation is optimal, is reliable, and runs in nearly doubly logarithmic time and linear space. This is the first simulation which is fast, optimal, and space-efficient, and therefore grants true comparison of algorithms running on different CRCW PRAMs. Moreover, it implies that the memory to which concurrent read or concurrent write is allowed should never be more than linear-the rest of the memory can always be addressed under the EREW convention. The techniques presented in this paper tackle fundamental difficulties in the design of fast parallel algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0042388871&partnerID=8YFLogxK
U2 - 10.1006/jpdc.1994.1127
DO - 10.1006/jpdc.1994.1127
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0042388871
SN - 0743-7315
VL - 23
SP - 135
EP - 148
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
IS - 2
ER -