Addressing shared resource contention in multicore processors via scheduling

Contention for shared resources on multicore processors remains an unsolved problem in existing systems despite significant research efforts dedicated to this problem in the past. Previous solutions focused primarily on hardware techniques and software page coloring to mitigate this problem. Our goal is to investigate how and to what extent contention for shared resource can be mitigated via thread scheduling. Scheduling is an attractive tool, because it does not require extra hardware and is relatively easy to integrate into the system. Our study is the first to provide a comprehensive analysis of contention-mitigating techniques that use only scheduling. The most difficult part of the problem is to find a classification scheme for threads, which would determine how they affect each other when competing for shared resources. We provide a comprehensive analysis of such classification schemes using a newly proposed methodology that enables to evaluate these schemes separately fro...

• Type: Conference
• Year: 2010
• Where: ASPLOS
• Authors: Sergey Zhuravlev, Sergey Blagodurov, Alexandra Fedorova
• Keywords: ASPLOS 2010, Classification Scheme, Programming Languages, Scheduling Algorithm, Shared Resource