A carregar...
Publicação
Dynamic global scheduling of parallel real-time tasks
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 236.68 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that
easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime.
Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will
be lost.
In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance
guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest
Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime
tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the
better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time
deadline-oriented scheduling class for the Linux kernel.
Descrição
Palavras-chave
Contexto Educativo
Citação
Editora
IEEE