Evaluating the performance of cache-affinity scheduling in shared-memory multiprocessors
Journal of Parallel and Distributed Computing
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the FREENIX Track: 2001 USENIX Annual Technical Conference
Lockmeter: highly-informative instrumentation for spin locks in the linux® kernel
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
| Hi-index | 0.00 |
The Linux Kernel scheduler for large SMP and NUMA systems needs to address conflicting requirements of system throughput and application response times. This paper pesents a pooled multiqueue scheduler (PMQS) designed for such high-end SMP and NUMA systems. PMQS is based on MQS, a multiqueue schduler that has previously been shown to significantly improve upon the scalability of the current Linux 2.4 scheduler. Load imbalances introduced by the pooling approach are reduced by a load balancing module. The paper presents different kinds of load balances and compares their efficacy. The Performance evaluation of PMQS and the load balancer is carried out using application and microbenchmarks with mixed results. Pooling is shown to have potential for further improving MQS' perfomance though more work needs to be done on the load balancers.