Peformance Prediction for Coarse-Grained Locking: MCS Case

10/11/2021

∙

by   Vitaly Aksenov, et al.

∙

0

∙

share

A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. It was already shown that simple stochastic analysis can predict the throughput of coarse-grained lock-based algorithms using CLH lock. In this short paper, we extend this analysis to algorithms based on the popular MCS lock.