分散存储的集成边界
Integrated Bounds for Disintegrated Storage
摘要：
我们指出了一些令人惊讶的相似性之间的非认证拜占庭存储，编码存储，和某些模拟共享寄存器从较小的。所有这些的一个共同特征是读取无法安全地返回在对共享存储的单个原子访问中获得的值。我们将此类系统统称为分解存储，并在所有这些系统中显示了异步定期无等待模拟的集成空间下限。简而言之，如果读取器是不可见的，那么这种系统的存储成本在写入值的大小上本质上是指数的;否则，它至少在读取器的数量上是线性的。我们的界限是渐近紧已知的算法，从而证明他们的高成本。
英文摘要：
We point out a somewhat surprising similarity between non-authenticated Byzantine storage, coded storage, and certain emulations of shared registers from smaller ones. A common characteristic in all of these is the inability of reads to safely return a value obtained in a single atomic access to shared storage. We collectively refer to such systems as disintegrated storage, and show integrated space lower bounds for asynchronous regular wait-free emulations in all of them. In a nutshell, if readers are invisible, then the storage cost of such systems is inherently exponential in the size of written values; otherwise, it is at least linear in the number of readers. Our bounds are asymptotically tight to known algorithms, and thus justify their high costs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
