Login / Signup
Tight bounds for shared memory systems accessed by Byzantine processes.
Noga Alon
Michael Merritt
Omer Reingold
Gadi Taubenfeld
Rebecca N. Wright
Published in:
Distributed Comput. (2005)
Keyphrases
</>
shared memory
tight bounds
heterogeneous platforms
fault tolerant
parallel algorithm
message passing
parallel programming
pairwise
upper bound
general purpose
parallel computing
distributed memory
parallel architectures