Lock contention aware thread migrations

Authors:
Kishore Kumar Pusukuri;Rajiv Gupta;Laxmi Narayan Bhuyan
Affiliations:
University of California, Riverside, Riverside, USA;University of California, Riverside, Riverside, USA;University of California, Riverside, Riverside, USA
Venue:
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Year:
2014

Citing 2
Cited 0

Contention-aware scheduler: unlocking execution parallelism in multithreaded java programs

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Remote core locking: migrating critical-section execution to improve the performance of multithreaded applications

USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

On a cache-coherent multicore multiprocessor system, the performance of a multithreaded application with high lock contention is very sensitive to the distribution of application threads across multiple processors. This is because the distribution of threads impacts the frequency of lock transfers between processors, which in turn impacts the frequency of last-level cache (LLC) misses that lie on the critical path of execution. Inappropriate distribution of threads across processors increases LLC misses in the critical path and significantly degrades performance of multithreaded programs. To alleviate the above problem, this paper overviews a thread migration technique, which migrates threads of a multithreaded program across multicore processors so that threads seeking locks are more likely to find the locks on the same processor.