Bonsai Merkle Forests: Efficiently Achieving Crash Consistency in Secure Persistent Memory
Alexander Freij, Huiyang Zhou, Yan Solihin
Abstract
Due to its durability, the security of persistent memory (PM) needs to be ensured. Recent works have identified the requirements for correctly architecting secure PM to achieve crash recoverability. A key performance bottleneck, however, lies in the integrity tree update, which needs to be consistent with the memory persistency model and incurs a very high performance overhead. In this paper, we aim to drastically reduce this performance overhead.
Topics & Concepts
BottleneckComputer scienceCrashOverhead (engineering)Merkle treeKey (lock)Consistency (knowledge bases)Computer networkTree (set theory)Distributed computingEmbedded systemReliability engineeringComputer securityHash functionOperating systemEngineeringCryptographic hash functionMathematical analysisArtificial intelligenceMathematicsParallel Computing and Optimization TechniquesAdvanced Data Storage TechnologiesDistributed systems and fault tolerance