Analyzing lock contention in multithreaded applications
Nathan R. Tallent, John Mellor‐Crummey, Allan Porterfield · 2010
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks reduces parallel efficiency and hurts scalability. Being able to quantify and attribute lock contention is important for understanding where a multithreaded program needs improvement.