复制(统计)
计算机科学
Byzantine容错
可扩展性
容错
任务(项目管理)
分析
分布式计算
并行计算
数据库
工程类
数学
统计
系统工程
作者
Kasra Jamshidi,Keval Vora
标识
DOI:10.1145/3627535.3638468
摘要
We present a verification-based Byzantine Fault Tolerant processing system, called OsirisBFT, for distributed task-parallel applications. OsirisBFT treats computation tasks differently from state update tasks, allowing the application to scale independently from number of expected failures. OsirisBFT captures application-specific verification semantics via generic verification operators and employs lightweight verification strategies with little coordination during graceful execution. Evaluation across multiple applications and workloads shows that OsirisBFT delivers high processing throughput and scalability compared to replicated processing. Importantly, the scalable nature of OsirisBFT enables it to reduce the performance gap compared to baseline with no fault tolerance by simply scaling out.
科研通智能强力驱动
Strongly Powered by AbleSci AI