Tight bounds for shared memory systems accessed by Byzantine processes

  • Authors:

  • Noga Alon;Michael Merritt;Omer Reingold;Gadi Taubenfeld;Rebecca N. Wright

  • Affiliations:

  • Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, Israel;AT&T Labs, Florham Park, NJ;Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel and AT&T Labs and Institute for Advanced Study, Princeton, NJ;The School of Computer Science, the Interdisciplinary Center, Herzliya, Israel;Department of Computer Science, Stevens Institute of Technology, Hoboken, NJ and AT&T Labs

  • Venue:
  • Distributed Computing - Special issue: DISC 03
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine failures, in a model previously explored by Malkhi et al. [21]. We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an improvement over the previous result requiring n ≥ (2t + 1) (t + 1). Our result follows from a new strong consensus construction that uses sticky bits and tolerates t Byzantine failures among n processes for any n ≥ 3t + 1, the best possible bound on n for strong consensus. We also present tight bounds on the efficiency of implementations of strong consensus objects from sticky bits and similar primitive objects.