- -

Schedulability analysis of dynamic priority real-time systems with contention

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Schedulability analysis of dynamic priority real-time systems with contention

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: GuasqueAceituno-P ...
Tamaño: 2.084Mb
Formato: PDF
Descripción: Versión editorial
Abrir
dc.contributor.author Guasque Ortega, Ana es_ES
dc.contributor.author Aceituno-Peinado, José María es_ES
dc.contributor.author Balbastre, Patricia es_ES
dc.contributor.author Simó Ten, José Enrique es_ES
dc.contributor.author Crespo, Alfons es_ES
dc.date.accessioned 2023-07-21T18:04:21Z
dc.date.available 2023-07-21T18:04:21Z
dc.date.issued 2022-08 es_ES
dc.identifier.issn 0920-8542 es_ES
dc.identifier.uri http://hdl.handle.net/10251/195320
dc.description.abstract [EN] In multicore scheduling of hard real-time systems, there is a significant source of unpredictability due to the interference caused by the sharing of hardware resources. This paper deals with the schedulability analysis of multicore systems where the interference caused by the sharing of hardware resources is taken into account. We rely on a task model where this interference is integrated in a general way, without depending on a specific type of hardware resource. There are similar approaches but they consider fixed priorities. The schedulability analysis is provided for dynamic priorities assuming constrained deadlines and based on the demand bound function. We propose two techniques, one more pessimistic than the other but with a lower computational cost. We evaluate the two proposals for different task allocators in terms of the increased estimated utilization. The results show that both bounds are valid for ensuring schedulability although, as expected, one is tighter than the other. The evaluation also serves to compare allocators to see which one produces less interference. es_ES
dc.description.sponsorship Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. his work was supported under Grant PLEC2021-007609 funded by MCIN/AEI/10.13039/501100011033 and by the "European Union NextGenerationEU/PRTR". es_ES
dc.language Inglés es_ES
dc.publisher Springer-Verlag es_ES
dc.relation.ispartof The Journal of Supercomputing es_ES
dc.rights Reconocimiento (by) es_ES
dc.subject Real-time es_ES
dc.subject Scheduling es_ES
dc.subject Dynamic priorities es_ES
dc.subject Contention es_ES
dc.subject Multiple sources contention es_ES
dc.subject.classification ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES es_ES
dc.title Schedulability analysis of dynamic priority real-time systems with contention es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1007/s11227-022-04446-y es_ES
dc.relation.projectID info:eu-repo/grantAgreement/AEI//PLEC2021-007609//MOVILIDAD EN LA CIUDAD DEL FUTURO. PREPARAR A LAS CIUDADES PARA LA NUEVA MOVILIDAD 2030 A TRAVÉS DE LAS 4 UNIVERSIDADES POLITÉCNICAS ESPAÑOLAS/ 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.; Aceituno-Peinado, JM.; Balbastre, P.; Simó Ten, JE.; Crespo, A. (2022). Schedulability analysis of dynamic priority real-time systems with contention. The Journal of Supercomputing. 78(12):14703-14725. https://doi.org/10.1007/s11227-022-04446-y es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1007/s11227-022-04446-y es_ES
dc.description.upvformatpinicio 14703 es_ES
dc.description.upvformatpfin 14725 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 78 es_ES
dc.description.issue 12 es_ES
dc.relation.pasarela S\460774 es_ES
dc.contributor.funder AGENCIA ESTATAL DE INVESTIGACION es_ES
dc.contributor.funder Universitat Politècnica de València es_ES
dc.description.references Aceituno JM, Guasque A, Balbastre P et al (2021) Hardware resources contention-aware scheduling of hard real-time multiprocessor systems. J Syst Archit 118:1–11 es_ES
dc.description.references Altmeyer S, Davis RI, Indrusiak L et al (2015) A generic and compositional framework for multicore response time analysis. In: Proceedings of the 23rd International Conference on Real Time and Networks Systems, RTNS ’15, pp 129–138 es_ES
dc.description.references Andersson B, Kim H, Niz DD et al (2018) Schedulability analysis of tasks with corunner-dependent execution times. ACM Trans Embed Comput Syst 17(3):1–29 es_ES
dc.description.references Baruah SK, Mok AK, Rosier LE (1990a) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: (1990) Proceedings 11th Real-Time Systems Symposium, pp 182–190 es_ES
dc.description.references Baruah SK, Rosier LE, Howell RR (1990) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst 2(4):301–324 es_ES
dc.description.references Baruah SK, Howell RR, Rosier LE (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 118:3–20 es_ES
dc.description.references Choi J, Kang D, Ha S (2016) Conservative Modeling of Shared Resource Contention for Dependent Tasks in Partitioned Multi-core Systems. In: 2016 Design, Automation Test in Europe Conference Exhibition (DATE), pp 181–186 es_ES
dc.description.references Coffman EG, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. PWS Publishing Co es_ES
dc.description.references Coffman EG Jr, Csirik J, Galambos G et al (2013) Bin packing approximation algorithms: survey and classification. Springer, New York es_ES
dc.description.references Dasari D, Andersson B, Nelis V, et al (2011) Response time analysis of cots-based multicores considering the contention on the shared memory bus. In: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications, pp 1068–1075 es_ES
dc.description.references Dasari D, Akesson B, Nélis V, et al (2013) Identifying the sources of unpredictability in cots-based multicore systems. In: 2013 8th IEEE international symposium on industrial embedded systems (SIES), pp 39–48 es_ES
dc.description.references Davis R, Altmeyer S, Indrusiak L et al (2018) An extensible framework for multicore response time analysis. Real-Time Syst 54:607–661 es_ES
dc.description.references Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: 2009 30th IEEE real-time systems symposium, pp 398–409 es_ES
dc.description.references Davis RI, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):1–44 es_ES
dc.description.references Davis RI, Griffin D, Bate I (2021) Schedulability Analysis for Multi-core Systems Accounting for Resource Stress and Sensitivity. In: 33rd Euromicro Conference on Real-Time Systems, ECRTS 2021 Virtual Conference, LIPIcs, vol 196. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp 7:1–7:26 es_ES
dc.description.references Fernandez G, Abella J, Quiñones E et al (2014) Contention in Multicore Hardware Shared Resources: Understanding of the State of the Art. In: Falk H (ed) 14th international workshop on worst-case execution time analysis, openaccess series in informatics (OASIcs), vol 39. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Dagstuhl, Germany, pp 31–42 es_ES
dc.description.references Gracioli G, Alhammad A, Mancuso R et al (2015) A survey on cache management mechanisms for real-time embedded systems. ACM Comput Surv 48(2):1–36 es_ES
dc.description.references Guo Z, Yang K, Yao F et al (2020) Inter-task cache interference aware partitioned real-time scheduling, association for computing machinery, p 218-226 es_ES
dc.description.references Hassan M, Pellizzoni R (2020) Analysis of Memory-Contention in Heterogeneous COTS MPSoCs. In: Völp M es_ES
dc.description.references (ed) 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020), pp 23:1-23:24 es_ES
dc.description.references Huang WH, Chen JJ, Reineke J (2016) Mirror: symmetric timing analysis for real-time tasks on multicore platforms with shared resources. In: Proceedings of the 53rd Annual Design Automation Conference, DAC ’16 es_ES
dc.description.references Karuppiah N (2016) The impact of interference due to resource contention in multicore platform for safety-critical avionics systems. Int J Res Eng Appl Manag (IJREAM) 02:39–48 es_ES
dc.description.references Kim H, de Niz D, Andersson B et al (2014) Bounding memory interference delay in cots-based multi-core systems. In: 2014 IEEE 19th real-time and embedded technology and applications symposium (RTAS), pp 145–154 es_ES
dc.description.references Lampka K, Giannopoulou G, Pellizzoni R et al (2014) A formal approach to the wcrt analysis of multicore systems with memory contention under phase-structured task sets. Real-Time Syst 50:736–773 es_ES
dc.description.references Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61 es_ES
dc.description.references Maiza C, Rihani H, Rivas JM et al (2019) A survey of timing verification techniques for multi-core real-time systems. ACM Comput Surv 52(3):1–46 es_ES
dc.description.references Mitra T, Teich J, Thiele L (2018) Time-critical systems design: a survey. IEEE Design Test 35(2):8–26 es_ES
dc.description.references Oh SH, Yang SM (1998) A Modified Least-Laxity-First Scheduling Algorithm for Real-Time Tasks. In: Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236), pp 31–36 es_ES
dc.description.references Oh Y, Son SH (1995) Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Syst 9(3):207–239 es_ES
dc.description.references Pellizzoni R, Lipari G (2005) Feasibility analysis of real-time periodic tasks with offsets. Real-Time Syst 30:105–128 es_ES
dc.description.references Rihani H, Moy M, Maiza C, et al (2016) Response Time Analysis of Synchronous Data Flow Programs on a Many-Core Processor. In: Proceedings of the 24th International Conference on Real-Time Networks and Systems, RTNS ’16, p 67-76 es_ES
dc.description.references Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibility testing for real-time tasks. Real-Time Syst 11(1):19–39 es_ES
dc.description.references Salmani V, Taghavi Zargar S, Naghibzadeh M (2005) A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks. Proc Seventh World Enformatika Conference es_ES
dc.description.references Spuri M (1996) Analysis of deadline scheduled real-time systems. Tech. rep es_ES
dc.description.references Xiao J, Altmeyer S, Pimentel A (2017) Schedulability analysis of non-preemptive real-time scheduling for multicore processors with shared caches. In: 2017 IEEE real-time systems symposium (RTSS), pp 199–208 es_ES
dc.subject.ods 09.- Desarrollar infraestructuras resilientes, promover la industrialización inclusiva y sostenible, y fomentar la innovación es_ES
dc.subject.ods 11.- Conseguir que las ciudades y los asentamientos humanos sean inclusivos, seguros, resilientes y sostenibles es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem