ParSweet: A Suite of Codes for Benchmarking and Testing Mutex-Based Parallel Systems

We present ParSweet, a collection of parallel codes in various programming languages covering common uses and implementations of mutual exclusion. This provides us with a basis for evaluating existing parallel systems for speed and efficiency, and a robust test suite for evaluating the correctness of new parallel systems. We also present benchmark results comparing the performance of various lock implementations, including our own and those from the std:: and hpx:: libraries. We have made the suite publicly available, with a process in place for accepting and incorporating additional codes submitted by the community.