.png){kind=icon}
.png){kind=icon}
Return
Efficient crash-safe sorting for systems with non-volatile main memory
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2025.108229.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Proposes a crash-safe implementation for sorting algorithms on NVMM, leveraging persistency instructions. • Compares checkpointing and logging mechanisms, showing that logging with a 64-step period increases execution time by only 1 % and write amplification by 1 %, relative to the No-Crash Consistency baseline. • Optimizes write reduction across all implementations, improving NVMM lifetime and performance. • Evaluates implementations using the gem5 simulator and provides detailed analysis. • Implements a crash-safe quick sort with 1 % execution overhead and 16 % write amplification compared to the baseline.
Journal
F
IF:
0
Papers:
642
Citations:
0