Publication
In a non-uniform memory access machine, the placement of software threads to hardware cores can have a significant effect on the performance of concurrent applications. Detecting the best possible placement for each application is a necessity for thread scheduling. Yet, due to the difficulty of this problem, operating-system schedulers do not really try to understand the needs of applications, but rather focus on (non-portable) scheduling heuristics.
David Atienza Alonso, Miguel Peon Quiros, Dimitrios Samakovlis, Stefano Albini, Pasquale Davide Schiavone, Denisa-Andreea Constantinescu, Rubén Rodríguez Álvarez