메뉴 건너뛰기




Volumn 2015-January, Issue January, 2015, Pages 161-172

Integrating cache-related pre-emption delays into analysis of fixed priority scheduling with pre-emption thresholds

Author keywords

cache related pre emption delay; CRPD; fixed priority scheduling; pre emption thresholds

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 84936952180     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2014.25     Document Type: Conference Paper
Times cited : (23)

References (34)
  • 1
    • 34547303486 scopus 로고    scopus 로고
    • Technical report Feb. [Online], Available
    • OSEK/VDX operating system. Technical report, Feb. 2005. [Online], Available: http://portal.osek-vdx.org/files/pdf/specs/os223.pdf
    • (2005) OSEK/VDX Operating System
  • 2
    • 84936934270 scopus 로고    scopus 로고
    • Release 4.1. Technical report. [Online], Available
    • AUTOSAR-specification of operating system, Release 4.1. Technical report, 2010. [Online], Available: http://www.autosar.org/
    • (2010) AUTOSAR-specification of Operating System
  • 3
    • 84865315116 scopus 로고    scopus 로고
    • Improved cache related preemption delay aware response time analysis for fixed priority pre-emptive systems
    • S. Altmeyer, R.I. Davis, and C. Maiza. Improved cache related preemption delay aware response time analysis for fixed priority pre-emptive systems. Real-Time Systems, 48(5):499-526, 2012
    • (2012) Real-Time Systems , vol.48 , Issue.5 , pp. 499-526
    • Altmeyer, S.1    Davis, R.I.2    Maiza, C.3
  • 4
    • 79960214257 scopus 로고    scopus 로고
    • Cache-related preemption delay via useful cache blocks: Survey, and redefinition
    • Aug
    • S. Altmeyer, and C. Maiza. Cache-related preemption delay via useful cache blocks: Survey, and redefinition. Journal of Systems Architecture, 57(7):707-719, Aug. 2011
    • (2011) Journal of Systems Architecture , vol.57 , Issue.7 , pp. 707-719
    • Altmeyer, S.1    Maiza, C.2
  • 6
    • 84892656981 scopus 로고    scopus 로고
    • Limited preemptive scheduling of non-independent task sets
    • Sep
    • A. Baldovin, E. Mezzetti, and T. Vardanega. Limited preemptive scheduling of non-independent task sets. In Proc. EMSOFT, Sep. 2013
    • (2013) Proc. EMSOFT
    • Baldovin, A.1    Mezzetti, E.2    Vardanega, T.3
  • 7
    • 79951792866 scopus 로고    scopus 로고
    • Cache-related preemption, and migration delays: Empirical approximation, and impact on schedulability
    • July
    • A. Bastoni, B. Brandenburg, and J. Anderson. Cache-related preemption, and migration delays: Empirical approximation, and impact on schedulability. In OSPERT, pages 33-44, July 2010
    • (2010) OSPERT , pp. 33-44
    • Bastoni, A.1    Brandenburg, B.2    Anderson, J.3
  • 8
    • 84856525174 scopus 로고    scopus 로고
    • Improving feasibility of fixed priority tasks using non-preemptive regions
    • Dec
    • M. Bertogna, G. Buttazzo, and G. Yao. Improving feasibility of fixed priority tasks using non-preemptive regions. In Proc. 32nd RTSS, pages 251-260, Dec. 2011
    • (2011) Proc. 32nd RTSS , pp. 251-260
    • Bertogna, M.1    Buttazzo, G.2    Yao, G.3
  • 9
  • 10
    • 80053027128 scopus 로고    scopus 로고
    • Optimal selection of preemption points to minimize preemption overhead
    • July
    • M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. Optimal selection of preemption points to minimize preemption overhead. In Proc. 23rd ECRTS, pages 217-227, July 2011
    • (2011) Proc. 23rd ECRTS , pp. 217-227
    • Bertogna, M.1    Xhani, O.2    Marinoni, M.3    Esposito, F.4    Buttazzo, G.5
  • 11
    • 24944507809 scopus 로고    scopus 로고
    • Measuring the performance of schedulability tests
    • E. Bini, and G. Buttazzo. Measuring the performance of schedulability tests. Real-Time Systems, 30(1):129-154, 2005
    • (2005) Real-Time Systems , vol.30 , Issue.1 , pp. 129-154
    • Bini, E.1    Buttazzo, G.2
  • 14
    • 67649920936 scopus 로고    scopus 로고
    • Worst-case response time analysis of real-Time tasks under fixed-priority scheduling with deferred preemption
    • Aug
    • R.J. Bril, J.J. Lukkien, and W.F.J. Verhaegh. Worst-case response time analysis of real-Time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems, 42(1-3):63-119, Aug. 2009
    • (2009) Real-Time Systems , vol.42 , Issue.1-3 , pp. 63-119
    • Bril, R.J.1    Lukkien, J.J.2    Verhaegh, W.F.J.3
  • 16
    • 0000181650 scopus 로고
    • Preemptive priority based scheduling: An appropriate engineering approach
    • S. Son, Editor Prentice-Hall
    • A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. In S. Son, editor, Advances in Real-Time Systems, pages 225-248. Prentice-Hall, 1994
    • (1994) Advances in Real-Time Systems , pp. 225-248
    • Burns, A.1
  • 17
    • 0029720109 scopus 로고    scopus 로고
    • Adding instruction cache effects to schedulability analysis of preemptive real-Time systems
    • June
    • J.V. Busquets-Mataix, J.J. Serrano, R. Ors, P. Gil, and A. Wellings. Adding instruction cache effects to schedulability analysis of preemptive real-Time systems. In Proc. 2nd RTAS, pages 204-212, June 1996
    • (1996) Proc. 2nd RTAS , pp. 204-212
    • Busquets-Mataix, J.V.1    Serrano, J.J.2    Ors, R.3    Gil, P.4    Wellings, A.5
  • 19
    • 84945915108 scopus 로고    scopus 로고
    • Real-Time in the prime-Time-keynote
    • July
    • Darren Buttle. Real-Time in the prime-Time-keynote. In Proc. 24th ECRTS, page xiii, July 2012
    • (2012) Proc. 24th ECRTS , pp. 13
    • Buttle, D.1
  • 20
    • 84874313664 scopus 로고    scopus 로고
    • Optimal fixed priority scheduling with deferred pre-emption
    • Dec
    • R.I. Davis, and M. Bertogna. Optimal fixed priority scheduling with deferred pre-emption. In Proc. 33rd RTSS, pages 39-50, Dec. 2012
    • (2012) Proc. 33rd RTSS , pp. 39-50
    • Davis, R.I.1    Bertogna, M.2
  • 22
    • 79960486687 scopus 로고    scopus 로고
    • Ait: Worst case execution time prediction by static program analysis
    • Aug
    • C. Ferdinand, and R. Heckmann. aiT: worst case execution time prediction by static program analysis. In IFIP, pages 377-384, Aug. 2004
    • (2004) IFIP , pp. 377-384
    • Ferdinand, C.1    Heckmann, R.2
  • 23
    • 0035680674 scopus 로고    scopus 로고
    • Minimizing memory utilizations of real-Time task sets in single, and multi-processor systems-on-A-chip
    • Dec
    • P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilizations of real-Time task sets in single, and multi-processor systems-on-A-chip. In Proc. 22nd RTSS, pages 73-83, Dec. 2001
    • (2001) Proc. 22nd RTSS , pp. 73-83
    • Gai, P.1    Lipari, G.2    Di Natale, M.3
  • 24
    • 0022796618 scopus 로고
    • Finding response times in a real-Time system
    • M. Joseph, and P. Pandya. Finding response times in a real-Time system. The Computer Journal, 29(5):390-395, 1986
    • (1986) The Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.2
  • 25
    • 78650579901 scopus 로고    scopus 로고
    • Exact response-Time analysis for fixed-priority preemption-Threshold scheduling
    • Sep
    • U. Keskin, R.J. Bril, and J.J. Lukkien. Exact response-Time analysis for fixed-priority preemption-Threshold scheduling. In Proc. 15th IEEE ETFA, WiP Session, Sep. 2010
    • (2010) Proc. 15th IEEE ETFA, WiP Session
    • Keskin, U.1    Bril, R.J.2    Lukkien, J.J.3
  • 27
    • 84870953736 scopus 로고    scopus 로고
    • Optimising task layout to increase schedulability via reduced cache related pre-emption delays
    • Oct
    • W. Lunniss, S. Altmeyer, and R.I. Davis. Optimising task layout to increase schedulability via reduced cache related pre-emption delays. In Proc. 20th RTNS, pages 161-170, Oct. 2012
    • (2012) Proc. 20th RTNS , pp. 161-170
    • Lunniss, W.1    Altmeyer, S.2    Davis, R.I.3
  • 28
    • 38949092485 scopus 로고    scopus 로고
    • Tightening the bounds on feasible preemption points
    • December
    • H. Ramaprasad, and F. Mueller. Tightening the bounds on feasible preemption points. In Proc. 27th RTSS, pages 212-224, December 2006
    • (2006) Proc. 27th RTSS , pp. 212-224
    • Ramaprasad, H.1    Mueller, F.2
  • 29
    • 51249111586 scopus 로고    scopus 로고
    • Bounding worst-case response time for tasks with non-preemptive regions
    • April
    • H. Ramaprasad, and F. Mueller. Bounding worst-case response time for tasks with non-preemptive regions. In Proc. 14th RTAS, pages 58-67, April 2008
    • (2008) Proc. 14th RTAS , pp. 58-67
    • Ramaprasad, H.1    Mueller, F.2
  • 30
    • 0036997795 scopus 로고    scopus 로고
    • Scheduling tasks with mixed preemption relations for robustness to timing faults
    • Dec
    • J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proc. 23rd RTSS, pages 315-326, Dec. 2002
    • (2002) Proc. 23rd RTSS , pp. 315-326
    • Regehr, J.1
  • 31
    • 0034474018 scopus 로고    scopus 로고
    • Scalable real-Time system design using preemption thresholds
    • Dec
    • M. Saksena, and Y. Wang. Scalable real-Time system design using preemption thresholds. In Proc. 21st RTSS, pages 25-34, Dec. 2000
    • (2000) Proc. 21st RTSS , pp. 25-34
    • Saksena, M.1    Wang, Y.2
  • 32
    • 33749059169 scopus 로고    scopus 로고
    • Scheduling analysis of realtime systems with precise modeling of cache related preemption delay
    • July
    • J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of realtime systems with precise modeling of cache related preemption delay. In Proc. 17th ECRTS, pages 41-48, July 2005
    • (2005) Proc. 17th ECRTS , pp. 41-48
    • Staschulat, J.1    Schliecker, S.2    Ernst, R.3
  • 33
    • 84988635832 scopus 로고    scopus 로고
    • Scheduling fixed-priority tasks with preemption threshold
    • Dec
    • Y. Wang, and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proc. 6th RTCSA, pages 328-335, Dec. 1999
    • (1999) Proc. 6th RTCSA , pp. 328-335
    • Wang, Y.1    Saksena, M.2
  • 34
    • 72349094411 scopus 로고    scopus 로고
    • Bounding the maximum length of non-preemptive regions under fixed-priority scheduling
    • Aug
    • G. Yao, G. Buttazzo, and M. Bertogna. Bounding the maximum length of non-preemptive regions under fixed-priority scheduling. In Proc. 15th RTCSA, pages 351-360, Aug. 2009
    • (2009) Proc. 15th RTCSA , pp. 351-360
    • Yao, G.1    Buttazzo, G.2    Bertogna, M.3


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