דניאל הנדלר

In this work, we present the first persistent (also called durable or recoverable) object implementations that employ the flat-combining (FC) synchronization paradigm. Specifically, we introduce a detectable FC-based implementation of concurrent LIFO stack, FIFO queue, and double-ended queue. Our empirical evaluation establishes that our novel FC-based implementations require a much smaller number of costly persistence instructions than competing algorithms and are therefore able to significantly outperform them.