- -

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 completo del ítem

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

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/195320

Ficheros en el ítem

Thumbnail
Nombre: GuasqueAceituno-P ...
Tamaño: 2.084Mb
Formato: PDF
Descripción: Versión editorial
Abrir/Preview

Metadatos del ítem

Título: Schedulability analysis of dynamic priority real-time systems with contention
Autor: Guasque Ortega, Ana Aceituno-Peinado, José María Balbastre, Patricia Simó Ten, José Enrique Crespo, Alfons
Entidad UPV: Universitat Politècnica de València. Escuela Técnica Superior de Ingenieros Industriales - Escola Tècnica Superior d'Enginyers Industrials
Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica
Fecha difusión:
Resumen:
[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 ...[+]
Palabras clave: Real-time , Scheduling , Dynamic priorities , Contention , Multiple sources contention
Derechos de uso: Reconocimiento (by)
Fuente:
The Journal of Supercomputing. (issn: 0920-8542 )
DOI: 10.1007/s11227-022-04446-y
Editorial:
Springer-Verlag
Versión del editor: https://doi.org/10.1007/s11227-022-04446-y
Código del Proyecto:
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/
Agradecimientos:
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".[+]
Tipo: Artículo

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

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

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 [+]
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

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

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

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

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

Baruah SK, Howell RR, Rosier LE (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 118:3–20

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

Coffman EG, Garey MR, Johnson DS (1996) Approximation algorithms for bin packing: a survey. PWS Publishing Co

Coffman EG Jr, Csirik J, Galambos G et al (2013) Bin packing approximation algorithms: survey and classification. Springer, New York

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

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

Davis R, Altmeyer S, Indrusiak L et al (2018) An extensible framework for multicore response time analysis. Real-Time Syst 54:607–661

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

Davis RI, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):1–44

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

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

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

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

Hassan M, Pellizzoni R (2020) Analysis of Memory-Contention in Heterogeneous COTS MPSoCs. In: Völp M

(ed) 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020), pp 23:1-23:24

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

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

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

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

Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46–61

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

Mitra T, Teich J, Thiele L (2018) Time-critical systems design: a survey. IEEE Design Test 35(2):8–26

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

Oh Y, Son SH (1995) Allocating fixed-priority periodic tasks on multiprocessor systems. Real-Time Syst 9(3):207–239

Pellizzoni R, Lipari G (2005) Feasibility analysis of real-time periodic tasks with offsets. Real-Time Syst 30:105–128

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

Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibility testing for real-time tasks. Real-Time Syst 11(1):19–39

Salmani V, Taghavi Zargar S, Naghibzadeh M (2005) A Modified Maximum Urgency First Scheduling Algorithm for Real-Time Tasks. Proc Seventh World Enformatika Conference

Spuri M (1996) Analysis of deadline scheduled real-time systems. Tech. rep

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

[-]

recommendations

 

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

Mostrar el registro completo del ítem