메뉴 건너뛰기




Volumn , Issue , 2014, Pages

Extending Typical Worst-Case Analysis using response-time dependencies to bound deadline misses

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER LINEAR PROGRAMMING; LATTICE STRUCTURES; NON-PREEMPTIVE; OPTIMIZATION PROBLEMS; STATIC PRIORITY; TIME CONSTRAINTS; TIME DEPENDENCY; WORST-CASE ANALYSIS;

EID: 84910154340     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2656045.2656059     Document Type: Conference Paper
Times cited : (28)

References (14)
  • 1
    • 84862094862 scopus 로고    scopus 로고
    • Probabilistic response time bound for CAN messages with arbitrary deadlines
    • IEEE Computer Society
    • Philip Axer, Maurice Sebastian, and Rolf Ernst. Probabilistic response time bound for CAN messages with arbitrary deadlines. In Proceedings of DATE'12. IEEE Computer Society, 2012.
    • (2012) Proceedings of DATE'12
    • Axer, P.1    Sebastian, M.2    Ernst, R.3
  • 4
    • 84893763875 scopus 로고    scopus 로고
    • A general framework for analysing system properties in platform-based embedded system designs
    • IEEE Computer Society
    • Samarjit Chakraborty, Simon Künzli, and Lothar Thiele. A general framework for analysing system properties in platform-based embedded system designs. In Proceedings of DATE'03, pages 190-195. IEEE Computer Society, 2003.
    • (2003) Proceedings of DATE'03 , pp. 190-195
    • Chakraborty, S.1    Künzli, S.2    Thiele, L.3
  • 5
    • 33846861495 scopus 로고    scopus 로고
    • Controller area network (CAN) schedulability analysis: Refuted, revisited and revised
    • Robert I. Davis, Alan Burns, Reinder J. Bril, and Johan J. Lukkien. Controller area network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239-272, 2007.
    • (2007) Real-Time Systems , vol.35 , Issue.3 , pp. 239-272
    • Davis, R.I.1    Burns, A.2    Bril, R.J.3    Lukkien, J.J.4
  • 6
    • 84910130172 scopus 로고    scopus 로고
    • Compositional performance analysis in python with pyCPA
    • Jonas Diemer, Philip Axer, and Rolf Ernst. Compositional performance analysis in python with pyCPA. In Proceedings of WATERS'12, 2012.
    • (2012) Proceedings of WATERS'12
    • Diemer, J.1    Axer, P.2    Ernst, R.3
  • 8
    • 84874308057 scopus 로고    scopus 로고
    • Quantifying the effect of rare timing events with settling-time and overshoot
    • Pratyush Kumar and Lothar Thiele. Quantifying the effect of rare timing events with settling-time and overshoot. In Proceedings of RTSS'12, pages 149-160, 2012.
    • (2012) Proceedings of RTSS'12 , pp. 149-160
    • Kumar, P.1    Thiele, L.2
  • 9
    • 84880911285 scopus 로고
    • Fixed priority scheduling of periodic task sets with arbitrary deadlines
    • John P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In IEEE Real-Time Systems Symposium, pages 201-213, 1990.
    • (1990) IEEE Real-Time Systems Symposium , pp. 201-213
    • Lehoczky, J.P.1
  • 10
    • 51849155989 scopus 로고    scopus 로고
    • Stochastic analysis of real-time systems under preemptive priority-driven scheduling
    • José María López, José Luis Díaz, Joaquín Entrialgo, and Daniel F. García. Stochastic analysis of real-time systems under preemptive priority-driven scheduling. Real-Time Systems, 40(2):180-207, 2008.
    • (2008) Real-Time Systems , vol.40 , Issue.2 , pp. 180-207
    • López, J.M.1    Díaz, J.L.2    Entrialgo, J.3    García, D.F.4
  • 11
    • 80655139151 scopus 로고    scopus 로고
    • Extending schedulability analysis of controller area network (CAN) for mixed (periodic/sporadic) messages
    • Saad Mubeen, Jukka Mäki-Turja, and Mikael Sjödin. Extending schedulability analysis of controller area network (CAN) for mixed (periodic/sporadic) messages. In Proceedings of ETFA'11, pages 1-10, 2011.
    • (2011) Proceedings of ETFA'11 , pp. 1-10
    • Mubeen, S.1    Mäki-Turja, J.2    Sjödin, M.3
  • 12
    • 84862104699 scopus 로고    scopus 로고
    • Formal analysis of sporadic overload in real-time systems
    • IEEE Computer Society
    • Sophie Quinton, Matthias Hanke, and Rolf Ernst. Formal analysis of sporadic overload in real-time systems. In Proceedings of DATE'12, pages 515-520. IEEE Computer Society, 2012.
    • (2012) Proceedings of DATE'12 , pp. 515-520
    • Quinton, S.1    Hanke, M.2    Ernst, R.3
  • 13
    • 84885601912 scopus 로고    scopus 로고
    • Formal analysis of sporadic bursts in real-time systems
    • IEEE Computer Society
    • Sophie Quinton, Mircea Negrean, and Rolf Ernst. Formal analysis of sporadic bursts in real-time systems. In Proceedings of DATE'13, pages 767-772. IEEE Computer Society, 2013.
    • (2013) Proceedings of DATE'13 , pp. 767-772
    • Quinton, S.1    Negrean, M.2    Ernst, R.3
  • 14
    • 0028396945 scopus 로고
    • An extendible approach for analyzing fixed priority hard real-time tasks
    • Ken Tindell, Alan Burns, and Andy J. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133-151, 1994.
    • (1994) Real-Time Systems , vol.6 , Issue.2 , pp. 133-151
    • Tindell, K.1    Burns, A.2    Wellings, A.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.