上海科技大学知识管理系统

Computer architecture keeps evolving to support the byte-addressablenon-volatile memory (NVM). Researchers have tailored the preva-lent B+-tree with NVM, crafting a history of utilizing architecturalsupports to gain both high performance and crash consistency. Thelatest architecture-level changes for NVM, e.g., the eADR, moti-vate us to further explore architectural implications in the designand implementation of in-NVM B+-tree. Our quantitative studyfinds that eADR makes the cache misses impact increasingly on anin-NVM B+-tree’s performance. We hence propose Conan for theconflict-awarenodeallocationbased on theoretical justifications.Conan decomposes the virtual addresses of B+-tree nodes regardinga VIPT cache and intentionally places them into different cache sets.Experiments show that Conan evidently reduces cache conflictsand boosts the performance of state-of-the-art in-NVM B+-tree.