BDBComp
Parceria:
SBC
A Binary-Tree Architecture for Scheduling Real-Time Systems with Hard and Soft Tasks

Angel GarcíaJoan VilaAlfons CrespoSergio Sáez

Complex real-time systems require jointly schedule both periodic and aperiodic tasks. To do this, optimal schedulers are dynamic slack stealing algorithms (DSS). However, these software schedulers are impractical due to their large overheads that always result in delays and reduced CPU utilization. One of the proposed solutions to this problem is doing scheduling in hardware. This paper analyzes in depth a hardware design based on binary trees.

http://csdl.computer.org/dl/proceedings/sbcci/1999/0387/00/03870078.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD