| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000607917 |
| ISSN: | 1405-5546 |
| Autores: | Revilla Duarte, Ulises1 Ramírez Salinas, Marco A.1 Villa Vargas, Luis A.1 Tchernykh, Andrei2 |
| Instituciones: | 1Instituto Politécnico Nacional, Centro de Investigación en Computación, México 2Departamento de Ciencias de la Computación, México |
| Año: | 2024 |
| Periodo: | Abr-Jun |
| Volumen: | 28 |
| Número: | 2 |
| Paginación: | 623-645 |
| País: | México |
| Idioma: | Inglés |
| Resumen en inglés | For a Linux operating system scheduler that is aware of Chip Multi-Processor (CMP) systems to carry out load balancing is extremely important and quite challenging. The scheduler is a vital component of the Linux kernel responsible for choosing the next thread to run and allocating to a processor core for execution. This process involves primarily a load-balancing procedure that provides the thread migration between the cores of a CMP system. A modern Linux scheduler is designed to obtain the best possible performance while ensuring a fair allocation of the processor cores’ time among the normal (non-real-time) threads, which is known as Completely Fair Scheduling (CFS) policy. However, this policy collaterally can cause a relentless execution of the load-balancing procedure, and therefore, an excessive number of thread migrations. According to the literature, an increased cache invalidation, scheduling latency, and power consumption are issues inherent to this. In this paper, we propose and evaluate a proactive load-balancing (PLB) algorithm to reduce unnecessary thread migrations on CMP systems. By comprehensive experimental analysis, we show that our PLB algorithm reduces the number of thread migrations by 43.8% on average without degradation of performance. |
| Keyword: | Linux CFS, Load balancing, Perf event tool, PMU counters, Chip multi-processor |
| Texto completo: | Texto completo (Ver PDF) Texto completo (Ver HTML) |
