A carregar...
Publicação
Task partitioning and priority assignment for distributed hard real-time systems
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 1.1 MB | Adobe PDF |
Orientador(es)
Resumo(s)
In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic
that finds a feasible partitioning and priority assignment for distributed applications
based on the linear transactional model. DOPA partitions the tasks and messages in the
distributed system, and makes use of the Optimal Priority Assignment (OPA) algorithm
known as Audsley’s algorithm, to find the priorities for that partition. The experimental
results show how the use of the OPA algorithm increases in average the number of
schedulable tasks and messages in a distributed system when compared to the use of
Deadline Monotonic (DM) usually favoured in other works. Afterwards, we extend these
results to the assignment of Parallel/Distributed applications and present a second heuristic
named Parallel-DOPA (P-DOPA). In that case, we show how the partitioning process can
be simplified by using the Distributed Stretch Transformation (DST), a parallel transaction
transformation algorithm introduced in [1].
Descrição
Palavras-chave
Real-time Distributed systems Task allocation Priority assignment Intermediate deadlines Holistic analysis Multi-threaded parallel tasks
Contexto Educativo
Citação
Editora
Elsevier