The Do-All problem with Byzantine processor failures

DOI10.1016/j.tcs.2004.06.034zbMath1070.68151MaRDI QIDQ1770376

Xianqiang Yang

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.034

zbMATH Keywords

Byzantine failures; Independent tasks; Distributed cooperation; Work complexity

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

68W15: Distributed algorithms