This paper introduces OPTIMUM-DERAM, a highly consistent, scalable, secure, and decentralized shared memory solution. Traditional distributed shared memory implementations offer multi-object support by multi-threading a single object memory instance over the same set of data hosts. While theoretically sound, the amount of resources required made such solutions prohibitively expensive in practical systems. OPTIMUM-DERAM proposes a decentralized, reconfigurable, atomic read/write shared memory (DeRAM) that: (i) achieves improved performance and storage scalability by leveraging Random Linear Network Codes (RLNC); (ii) scales in the number of supported atomic objects by introducing a new object placement and discovery approach based on a consistent hashing ring; (iii) scales in the number of participants by allowing dynamic joins and departures leveraging a blockchain oracle to serve as a registry service; and (iv) is secure against malicious behavior by tolerating Byzantine failures. Experimental results over a globally distributed set of nodes, help us realize the performance and scalability gains of OPTIMUM-DERAM over previous distributed shared memory solutions (i.e., the ABD algorithm [3])

翻译：本文介绍了OPTIMUM-DERAM，一种具有高度一致性、可扩展性、安全性且去中心化的共享内存解决方案。传统的分布式共享内存实现通过在相同的数据主机集上对单对象内存实例进行多线程处理来提供多对象支持。尽管在理论上可行，但此类解决方案所需的资源量使得其在实用系统中成本过高。OPTIMUM-DERAM提出了一种去中心化、可重构的原子读写共享内存（DeRAM），其特点在于：（i）通过利用随机线性网络编码（RLNC）实现了性能和存储可扩展性的提升；（ii）通过引入一种基于一致性哈希环的新对象放置与发现方法，扩展了所支持的原子对象数量；（iii）通过允许动态加入和退出，并利用区块链预言机作为注册服务，扩展了参与者的数量；（iv）通过容忍拜占庭故障，能够抵御恶意行为，从而保证安全性。在全球分布的节点集上进行的实验结果，帮助我们验证了OPTIMUM-DERAM相较于先前分布式共享内存解决方案（即ABD算法[3]）在性能和可扩展性方面所取得的提升。