BDBComp
Parceria:
SBC
Análise temporal da implementação da fila de aptos como lista ordenada e lista desordenada

Ricardo Bacha BorgesRômulo Silva de Oliveira

The ready queue maintains the tasks that are waiting to execute. There are many ways to implement the ready queue, but the classic form consists of using a chained list sorted according to the task priorities. An alternative, although rarely used, would be to maintain an unsorted chained list. The objective of this paper is to make a timing analysis of the implementation of the ready queue. The same analysis is accomplished for the implementations as sorted list and unsorted list. The analysis shows that, for real-time systems, it may be better to maintain the ready queue unsorted.

http://www.lbd.dcc.ufmg.br/colecoes/wso/2006/001.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