Abstract
Abstract
Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data structure benchmarks because they visit a huge number of blocked executions due to spinloops.In response, we develop Awamoche, a sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless blocked executions in programs with await and confirmation-CAS loops. Consequently, it outperforms the state-of-the-art, often by an exponential factor.
Publisher
Springer Nature Switzerland
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. SPORE: Combining Symmetry and Partial Order Reduction;Proceedings of the ACM on Programming Languages;2024-06-20
2. Enhancing GenMC’s Usability and Performance;Lecture Notes in Computer Science;2024