The Community for Technology Leaders
Parallel and Distributed Systems, International Conference on (2008)
Dec. 8, 2008 to Dec. 10, 2008
ISSN: 1521-9097
ISBN: 978-0-7695-3434-3
pp: 697-704
ABSTRACT
In this paper, we compare four libraries for efficiently running threads when the performance of a CPU cores are degraded. First, we are interested by 'brute performance' of the libraries when all the CPU resources are available and second, we would like to measure how the scheduling strategy impacts also the memory management in order to revisit, in the future, scheduling strategies when we artificially degrade the performance in advance. It is well known that work stealing, when done in an anarchic way, may lead to poor cache performance. It is also known that the migration of threads may induce penalties if they are too frequent. We study, at the processor level, the memory management in order to find trade-offs between active thread number that an application should start and the memory hierarchy. Our implementations, coded with the different libraries, were compared against a Pthread one where the threads are scheduled by the Linux kernel and not by a specific tool. Our experimental results indicate that scheduler may perfectly balance
INDEX TERMS
Thread scheduling, memory management, work stealing, heterogeneous computing
CITATION
Hazem Fkaier, Mohamed Jemni, Christophe Cerin, "Experimental Study of Thread Scheduling Libraries on Degraded CPU", Parallel and Distributed Systems, International Conference on, vol. 00, no. , pp. 697-704, 2008, doi:10.1109/ICPADS.2008.102
91 ms
(Ver 3.3 (11022016))