Repository logo
 
Publication

Task partitioning and priority assignment for distributed hard real-time systems

2015-06-17Journal article Restricted access
Simple item page
dc.contributor.authorGaribay-Martínez, Ricardo
dc.contributor.authorNelissen, Geoffrey
dc.contributor.authorLino Ferreira, Luís
dc.contributor.authorPinho, Luís Miguel
dc.date.accessioned2015-11-16T17:26:20Z
dc.date.available2015-11-16T17:26:20Z
dc.date.issued2015-06-17
dc.description.abstractIn 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].pt_PT
dc.identifier.doi10.1016/j.jcss.2015.05.005pt_PT
dc.identifier.issn0022-0000
dc.identifier.urihttp://hdl.handle.net/10400.22/6902
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherElsevierpt_PT
dc.relationUID/CEC/04234/2013 (CISTER Research Centre)pt_PT
dc.relationFCOMP-01-0124-FEDER-020447 (REGAIN)pt_PT
dc.relationARTEMIS/0003/2012 – JU grant nr. 333053 (CONCERTO)pt_PT
dc.relationARTEMIS/0001/2012 – JU grant nr. 332987 (ARROWHEAD)pt_PT
dc.relationFCT PhD grant SFRH/BD/71562/2010pt_PT
dc.relation.ispartofseriesJournal of Computer and System Sciences;Vol. 81, Issue 8
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0022000015000665pt_PT
dc.subjectReal-timept_PT
dc.subjectDistributed systemspt_PT
dc.subjectTask allocationpt_PT
dc.subjectPriority assignmentpt_PT
dc.subjectIntermediate deadlinespt_PT
dc.subjectHolistic analysispt_PT
dc.subjectMulti-threaded parallel taskspt_PT
dc.titleTask partitioning and priority assignment for distributed hard real-time systemspt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage1555pt_PT
oaire.citation.issue8pt_PT
oaire.citation.startPage1542pt_PT
oaire.citation.titleJournal of Computer and System Sciencespt_PT
oaire.citation.volume81pt_PT
person.familyNamePinho
person.givenNameLuis Miguel
person.identifier.ciencia-id8112-2108-F3B2
person.identifier.orcid0000-0001-6888-1340
person.identifier.ridM-3416-2013
person.identifier.scopus-author-id6602594556
rcaap.rightsopenAccesspt_PT
rcaap.typearticlept_PT
relation.isAuthorOfPublicationfd791145-af93-47d9-bbe8-647a326d2f39
relation.isAuthorOfPublication.latestForDiscoveryfd791145-af93-47d9-bbe8-647a326d2f39

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ART_CISTER_2015.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

ISEP – CISTER – Artigos