Time Triggered Scheduling Analysis for Real-Time Applications on Multicore Platforms

e-Archivo Repository

Show simple item record

dc.contributor.author Freier, Matthias
dc.contributor.author Chen, Jian-Jia
dc.contributor.editor Cucinotta, Tommaso
dc.contributor.editor Pautet, Laurent
dc.contributor.editor García Valls, Marisol
dc.date.accessioned 2014-11-13T12:03:37Z
dc.date.available 2014-11-13T12:03:37Z
dc.date.issued 2014-11
dc.identifier.bibliographicCitation García Valls, M. et al. (eds.) (2014). 3rd IEEE International Workshop on Real-time and distributed computing in emerging applications. (Co-located with 35th IEEE RTSS). Rome, Italy. December 2nd, 2014. Universidad Carlos III de Madrid, 48-53.
dc.identifier.isbn 978-84-697-1736-3
dc.identifier.uri http://hdl.handle.net/10016/19693
dc.description REACTION 2014. 3rd International Workshop on Real-time and Distributed Computing in Emerging Applications. Rome, Italy. December 2nd, 2014.
dc.description.abstract Scheduling of real-time applications for multicore platforms has become an important research topic. For analyzing the timing satisfactions of real-time tasks, most researches in the literature assume independent tasks. However, industrial applications are usually with fully tangled dependencies among the tasks. Independence of the tasks provides a very nice abstraction, whereas dependent structures due to the tangled executions of the tasks are closer to the real systems. This paper studies the scheduling policies and the schedulabil-ity analysis based on independent tasks by hiding the execution dependencies with additional timing parameters. Our scheduling policy relates to the well-known periodic task model, but in contrast, tasks are able to communicate with each other. A feasible task set requires an analysis for each core and the communication infrastructure, which can be performed indi-vidually by decoupling computation from communication in a distributed system. By using a Time-Triggered Constant Phase (TTCP) scheduler, each task receives certain time-slots in the hyper-period of the task set, which ensures a time-predictable communication impact. In this paper, we provide several algorithms to derive the time-slot for each task. Further, we found a fast heuristic algorithm to calculate the time-slot for each task, which is capable to reach a core utilization of 90% by considering typical industrial applications. Finally, experiments show the effectiveness of our heuristic and the performance in different settings.
dc.format.extent 6
dc.format.mimetype application/pdf
dc.language eng
dc.language.iso eng
dc.publisher Universidad Carlos III de Madrid
dc.rights © Copyright by the Authors
dc.rights Atribución-NoComercial-SinDerivadas 3.0 España
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject.other Sistemas en tiempo real
dc.subject.other Sistemas distribuidos
dc.subject.other cloud computing
dc.subject.other distributed systems
dc.subject.other Real-time computing
dc.title Time Triggered Scheduling Analysis for Real-Time Applications on Multicore Platforms
dc.type conferenceObject
dc.description.status Publicado
dc.subject.eciencia Telecomunicaciones
dc.rights.accessRights openAccess
dc.type.version publishedVersion
dc.relation.eventdate December 2nd, 2014
dc.relation.eventnumber 3
dc.relation.eventplace Rome, Italy
dc.relation.eventtitle International Workshop on Real-Time and Distributed Computing in Emerging Applications (REACTION)
dc.relation.eventtype proceeding
dc.identifier.publicationfirstpage 48
dc.identifier.publicationlastpage 53
dc.identifier.publicationtitle International Workshop on Real-Time and Distributed Computing in Emerging Applications (REACTION 2014)
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)


The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record