Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/6902
Título: Task partitioning and priority assignment for distributed hard real-time systems
Autor: Garibay-Martínez, Ricardo
Nelissen, Geoffrey
Lino Ferreira, Luis
Pinho, Luis Miguel
Palavras-chave: Real-time
Distributed systems
Task allocation
Priority assignment
Intermediate deadlines
Holistic analysis
Multi-threaded parallel tasks
Data: 17-Jun-2015
Editora: Elsevier
Relatório da Série N.º: Journal of Computer and System Sciences;Vol. 81, Issue 8
Resumo: 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].
Peer review: yes
URI: http://hdl.handle.net/10400.22/6902
DOI: doi:10.1016/j.jcss.2015.05.005
ISSN: 0022-0000
Versão do Editor: http://www.sciencedirect.com/science/article/pii/S0022000015000665
Aparece nas colecções:ISEP – CISTER – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_CISTER_2015.pdf1,13 MBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.