Mostrar el registro sencillo del ítem
dc.contributor.author | Guasque Ortega, Ana | es_ES |
dc.contributor.author | Balbastre, Patricia | es_ES |
dc.contributor.author | Crespo, Alfons | es_ES |
dc.date.accessioned | 2017-01-04T11:54:55Z | |
dc.date.available | 2017-01-04T11:54:55Z | |
dc.date.issued | 2016-09 | |
dc.identifier.issn | 0164-1212 | |
dc.identifier.uri | http://hdl.handle.net/10251/76338 | |
dc.description.abstract | [EN] Partitioned architectures isolate software components into independent partitions whose execution will not interfere with other partitions, preserving temporal and spatial isolation. Hierarchical scheduling can effectively be used to schedule these systems. Schedulability analysis of hierarchical real-time systems is based on prior knowledge of the local and the global scheduling algorithms. In a partitioned system with safety and security issues and certification assurance levels, global scheduling is usually generated using a static table. Therefore, each partition must allocate task jobs only in the temporal windows reserved for that partition. Even if the static table can come originally from a periodic server or other scheduling policy, the final plan may be modified due to changes in the system requirements. As a consequence, the CPU assignment to a partition does not have to correspond to any known policy. In this case, it is not possible to use existing scheduling analysis for hierarchical systems. This paper studies a new scheduling problem: a hierarchical system in which global policy is not known but provided as a set of arbitrary time windows. | es_ES |
dc.description.sponsorship | This work has been funded by the Spanish government under grant TIN2014-56158-C4-1-P-AR and by the European Commission under FP7-ICT-2013.3.4 Programme with grant 610640 | en_EN |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Journal of Systems and Software | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Real-time systems | es_ES |
dc.subject | Partitioned systems | es_ES |
dc.subject | Embedded systems | es_ES |
dc.subject | Real-time systems scheduling | es_ES |
dc.subject | Real-time algorithms | es_ES |
dc.subject.classification | ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES | es_ES |
dc.title | Real-time hierarchical systems with arbitrary scheduling at global level | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.jss.2016.05.040 | |
dc.relation.projectID | info:eu-repo/grantAgreement/EC/FP7/610640/EU/Distributed REal-Time Architecture for Mixed Criticality Systems/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO//TIN2014-56158-C4-1-P/ES/SISTEMAS CIBER-FISICOS DE CRITICIDAD MIXTA SOBRE PLATAFORMAS MULTINUCLEO/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escuela Técnica Superior de Ingenieros Industriales - Escola Tècnica Superior d'Enginyers Industrials | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica | es_ES |
dc.description.bibliographicCitation | Guasque Ortega, A.; Balbastre, P.; Crespo, A. (2016). Real-time hierarchical systems with arbitrary scheduling at global level. Journal of Systems and Software. 119:70-86. https://doi.org/10.1016/j.jss.2016.05.040 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://dx.doi. org/10.1016/j.jss.2016.05.040 | es_ES |
dc.description.upvformatpinicio | 70 | es_ES |
dc.description.upvformatpfin | 86 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 119 | es_ES |
dc.relation.senia | 313756 | es_ES |
dc.identifier.eissn | 1873-1228 | |
dc.contributor.funder | European Commission | |
dc.contributor.funder | Ministerio de Economía y Competitividad |