Task partitioning and priority assignment for distributed hard real-time systems
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 us...
Autor principal: | |
---|---|
Outros Autores: | , , |
Formato: | article |
Idioma: | eng |
Publicado em: |
2015
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10400.22/6902 |
País: | Portugal |
Oai: | oai:recipp.ipp.pt:10400.22/6902 |