Presentation
Hardware Transactional Persistent Memory
Author
Event Type
ACM Student Research Competition
Poster
TP
EX
TimeTuesday, November 13th8:30am - 5pm
LocationC2/3/4 Ballroom
DescriptionThis research solves the problem of creating durable transactions in byte-addressable Non-Volatile Memory or Persistent Memory (PM) when using Hardware Transactional Memory (HTM)-based concurrency control. It shows how HTM transactions can be ordered correctly and atomically into PM by the use of a novel software protocol. We exploit the ordering mechanism to design a novel persistence method that decouples HTM concurrency from back-end PM operations. Failure atomicity is achieved using redo logging coupled with aliasing to guard against mistimed cache evictions.
The algorithm uses efficient lock-free mechanisms with bounded static memory requirements and executes on existing Intel based processors. A back-end distributed memory controller alternative provides a hardware implementation choice for catching PM cache evictions. Our approach compares well with standard (volatile) HTM transactions and yields significant gains in latency and throughput over other persistence methods.
The algorithm uses efficient lock-free mechanisms with bounded static memory requirements and executes on existing Intel based processors. A back-end distributed memory controller alternative provides a hardware implementation choice for catching PM cache evictions. Our approach compares well with standard (volatile) HTM transactions and yields significant gains in latency and throughput over other persistence methods.
Archive
