Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
nvram [2018/02/06 12:04] tadavid |
nvram [2018/02/06 13:08] tadavid |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| We introduce a set of techniques aimed at lock-free data structures that, in the large majority of cases, remove the need for logging (and costly durable store instructions) both in the data structure algorithm as well as in the associated memory management scheme. Together, these generic techniques enable us to design what we call log-free concurrent data structures, which, as we illustrate on linked lists, hash tables, skip lists, and BSTs, can provide several-fold performance improvements over previous, transaction-based implementations, with overheads of the order of milliseconds for recovery after a failure. | We introduce a set of techniques aimed at lock-free data structures that, in the large majority of cases, remove the need for logging (and costly durable store instructions) both in the data structure algorithm as well as in the associated memory management scheme. Together, these generic techniques enable us to design what we call log-free concurrent data structures, which, as we illustrate on linked lists, hash tables, skip lists, and BSTs, can provide several-fold performance improvements over previous, transaction-based implementations, with overheads of the order of milliseconds for recovery after a failure. | ||
| We also highlight how our techniques can be integrated into practical systems, by introducing a durable version of Memcached that maintains the performance of its volatile counterpart. | We also highlight how our techniques can be integrated into practical systems, by introducing a durable version of Memcached that maintains the performance of its volatile counterpart. | ||
| + | |||
| + | {{:wordle_nvram.png?400|}} | ||