2026-07-21T19:22:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:848 2024-03-06T11:07:04Z ddc:004 open_access

Towards bounded wait-free PASIS Abd-El-Malek, Michael Ganger, Gregory R. Goodson, Garth R. Reiter, Michael K. Wylie, Jay J. Byzantine fault-tolerant erasure-coded storage bounded wait-free non-skipping timestamps The PASIS read/write protocol implements a Byzantine fault-tolerant erasure-coded atomic register. The prototype PASIS storage system implementation provides excellent best-case performance. Writes require two round trips and contention- and failure-free reads require one. Unfortunately, even though writes and reads are wait-free in PASIS, Byzantine components can induce correct clients to perform an unbounded amount of work. In this extended abstract, we enumerate the avenues by which Byzantine servers and clients can induce correct clients to perform an unbounded amount of work in PASIS. We sketch extensions to the PASIS protocol and Lazy Verification that bound the amount of work Byzantine components can induce correct clients to perform. We believe that the extensions provide bounded wait-free reads and writes. We also believe that an implementation that incorporates these extensions will preserve the excellent best-case performance of the original PASIS prototype. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael Abd-El-Malek and Gregory R. Ganger and Garth R. Goodson and Michael K. Reiter and Jay J. Wylie 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 6371, From Security to Dependability (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06371.5 urn:nbn:de:0030-drops-8488 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06371.5 eng https://creativecommons.org/licenses/by/4.0/legalcode