High-performance determinism with total store order consistency
High-performance determinism with total store order consistency
复制标题
具有总商店订单一致性的高性能确定性
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Jakob Eriksson
中科院分区：
文献类型：
--
作者：
Timothy Merrifield;Joseph Devietti;Jakob Eriksson
我们提出了确定性的多线程库。 ，使用版本控制的内存来实现商店缓冲[23]。在Phoenix上，Parsec和Splash-2基准套件在19个基准计划中保持了TSO记忆的一致性相信这种绩效改进需要并行编程，更接近“确定性”。
We present Consequence, a deterministic multi-threading library. Consequence achieves deterministic execution via store buffering and strict ordering of synchronization operations. To ensure high performance under a wide variety of conditions, the ordering of synch operations is based on a deterministic clock [25], and store buffering is implemented using version-controlled memory [23]. Recent work on deterministic concurrency [14, 19] has proposed relaxing the consistency model beyond total store order (TSO). Through novel optimizations, Consequence achieves the same or better performance on the Phoenix, PARSEC and SPLASH-2 benchmark suites, while retaining TSO memory consistency. Across 19 benchmark programs, Consequence incurs a worst-case slowdown of 3.9× vs. pthreads, with 14 out of 19 programs at or below 2.5×. We believe this performance improvement takes parallel programming one step closer to "determinism by default".