A carregar...
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 969 KB | Adobe PDF |
Orientador(es)
Resumo(s)
In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting
algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with
the required features for implementing such scheduling algorithms. We show that the real behavior of
the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and
24-core machines.