Task partitioning and priority assignment for distributed hard real-time systems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.22/6902 |
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]. |
id |
RCAP_7a11f82992c7b6cab4e51ac776353b3b |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/6902 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Task partitioning and priority assignment for distributed hard real-time systemsReal-timeDistributed systemsTask allocationPriority assignmentIntermediate deadlinesHolistic analysisMulti-threaded parallel tasksIn 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].ElsevierRepositório Científico do Instituto Politécnico do PortoGaribay-Martínez, RicardoNelissen, GeoffreyLino Ferreira, LuísPinho, Luís Miguel2015-11-16T17:26:20Z2015-06-172015-06-17T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/6902eng0022-000010.1016/j.jcss.2015.05.005info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-13T12:47:22Zoai:recipp.ipp.pt:10400.22/6902Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:27:31.194743Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Task partitioning and priority assignment for distributed hard real-time systems |
title |
Task partitioning and priority assignment for distributed hard real-time systems |
spellingShingle |
Task partitioning and priority assignment for distributed hard real-time systems Garibay-Martínez, Ricardo Real-time Distributed systems Task allocation Priority assignment Intermediate deadlines Holistic analysis Multi-threaded parallel tasks |
title_short |
Task partitioning and priority assignment for distributed hard real-time systems |
title_full |
Task partitioning and priority assignment for distributed hard real-time systems |
title_fullStr |
Task partitioning and priority assignment for distributed hard real-time systems |
title_full_unstemmed |
Task partitioning and priority assignment for distributed hard real-time systems |
title_sort |
Task partitioning and priority assignment for distributed hard real-time systems |
author |
Garibay-Martínez, Ricardo |
author_facet |
Garibay-Martínez, Ricardo Nelissen, Geoffrey Lino Ferreira, Luís Pinho, Luís Miguel |
author_role |
author |
author2 |
Nelissen, Geoffrey Lino Ferreira, Luís Pinho, Luís Miguel |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Repositório Científico do Instituto Politécnico do Porto |
dc.contributor.author.fl_str_mv |
Garibay-Martínez, Ricardo Nelissen, Geoffrey Lino Ferreira, Luís Pinho, Luís Miguel |
dc.subject.por.fl_str_mv |
Real-time Distributed systems Task allocation Priority assignment Intermediate deadlines Holistic analysis Multi-threaded parallel tasks |
topic |
Real-time Distributed systems Task allocation Priority assignment Intermediate deadlines Holistic analysis Multi-threaded parallel tasks |
description |
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]. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-11-16T17:26:20Z 2015-06-17 2015-06-17T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.22/6902 |
url |
http://hdl.handle.net/10400.22/6902 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0022-0000 10.1016/j.jcss.2015.05.005 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799131370322132992 |