一句话：MOD 面向持久内存可恢复应用，试图解决缓存行刷写排序在专家定制与 STM 之间的两难。
持久内存（PM）使应用可在系统重启或掉电后恢复进度，但真正可恢复需要谨慎安排缓存行刷写顺序。现有实践走两个极端：专家深入推理一致性与持久性，构建以单一手工定制持久数据结构为核心的应用；经验较少的程序员则用软件事务内存（STM）实现一个或多个更新的原子性，但由于有序日志更新，性能代价显著。论文 MOD 面向这一矛盾展开研究，标题表明其关注持久内存下的有序/持久性设计；但给出的摘要未进一步说明具体方法、实现与评估结果。
Persistent Memory (PM) makes possible recoverable applications that can preserve application progress across system reboots and power failures. Actual recoverability requires careful ordering of cacheline flushes, currently done in two extreme ways. On one hand, expert programmers have reasoned deeply about consistency and durability to create applications centered on a single custom-crafted durable datastructure. On the other hand, less-expert programmers have used software transaction memory (STM) to make atomic one or more updates, albeit at a significant performance cost due largely to ordered log updates.