Publication:
Task Partitioning and Priority Assigment for Hard Real-Time Distributed System

Simple item page
dc.affiliation.dptoUC3M. Departamento de Ingeniería Telemáticaes
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Aplicaciones y Servicios Telemáticos (GAST)es
dc.contributor.authorGaribay-Martínez, Ricardoes
dc.contributor.authorNelissen, Geoffreyes
dc.contributor.authorFerreira, Luis Linoes
dc.contributor.authorLuis Miguel, Pinhoes
dc.contributor.editorGarcía Valls, Marisoles
dc.contributor.editorCucinotta, Tommasoes
dc.date.accessioned2013-11-14T09:37:46Zes
dc.date.accessioned2014-11-18T11:03:34Z
dc.date.available2014-11-18T11:03:34Z
dc.date.issued2013-12-03es
dc.descriptionREACTION 2013. 2nd International Workshop on Real-time and distributed computing in emerging applications. December 3rd, 2013, Vancouver, Canada.en
dc.description.abstractThe partitioning of flxed-priority hard real-time tasks and messages in a distributed system is a well know NP-hard problem. Therefore, there are no methods that provide an optimal solution in polynomial time. In this paper, we propose the Distributed using Optimal Priority Assignment (DOPA) heuristic, which simultaneously solves the problem of assigning task to processors and assigning priorities to tasks. DOPA makes use of Audsley's ptimal Priority Assignment (OPA) algorithm to assign priorities to tasks and messages. However, in order to use the OPA algorithm for task sets with dependencies, we first transform the task set into a set of independent tasks by imposing intermedíate deadlines. The experimental results show how the utilisation of the OPA algorithm increases in average the number of schedulable tasks and messages in a distributed system when compared to the utilisation of the Deadline Monotonic (DM) priority assignment usually used in other works.en
dc.format.extent6es
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.identifier.bibliographicCitationREACTION 2013, co-located with IEEE RTSS. Vancouver, Canada. December 3rd, 2013. Universidad Carlos III de Madrid, 2013, pp. 25-30.es
dc.identifier.isbn978-84-616-7680-4en
dc.identifier.isbn84-616-7680-4en
dc.identifier.publicationfirstpage25es
dc.identifier.publicationlastpage30es
dc.identifier.publicationtitleInternational Workshop on Real-Time and Distributed Computing in Emerging Applications (REACTION)en
dc.identifier.urihttps://hdl.handle.net/10016/17915
dc.language.isoenges
dc.publisherUniversidad Carlos III de Madrides
dc.relation.eventdateDecember 3, 2013en
dc.relation.eventnumber2es
dc.relation.eventplaceVancouver, Canadaes
dc.relation.eventtitleInternational Workshop on Real-Time and Distributed Computing in Emerging Applications (REACTION)en
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 España*
dc.rights.accessRightsopen accesses
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subject.ecienciaTelecomunicacioneses
dc.subject.otherSistemas en tiempo reales
dc.subject.otherSistemas distribuidoses
dc.subject.otherCloud computingen
dc.subject.otherReal-timeen
dc.subject.otherDistributed systemsen
dc.subject.otherTask allocationen
dc.subject.otherPriority assignmenten
dc.subject.otherIntermediate deadlinesen
dc.subject.otherHolistic analysisen
dc.subject.otherSchedulingen
dc.titleTask Partitioning and Priority Assigment for Hard Real-Time Distributed Systemen
dc.typeconference proceedings*
dc.type.hasVersionVoR*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
task_REACTION_2013.pdf
Size:
304.5 KB
Format:
Adobe Portable Document Format
Download
Collections
REACTION 2013. Second International Workshop on Real-time and distributed computing in emerging applications