메뉴 건너뛰기




Volumn , Issue , 2009, Pages 200-204

Computing the maximum blocking time for scheduling with deferred preemption

Author keywords

Deferred Preemption; Maximal Blocking Time; Timing Analysis

Indexed keywords

ABSTRACTION LEVEL; BLOCKING TIME; DEFERRED PREEMPTION; NON-PREEMPTIVE; SCHEDULABILITY ANALYSIS; SCHEDULING ANALYSIS; SCHEDULING THEORY; TIMING ANALYSIS;

EID: 84880406176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/STFSSD.2009.12     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 1
    • 35348884442 scopus 로고    scopus 로고
    • Worstcase response time analysis of real-time tasks under fixedpriority scheduling with deferred preemption revisited
    • Washington, DC, USA
    • R. J. Bril, J. J. Lukkien, and W. F. J. Verhaegh. Worstcase response time analysis of real-time tasks under fixedpriority scheduling with deferred preemption revisited. In ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems, pages 269-279, Washington, DC, USA, 2007. IEEE Computer Society.
    • (2007) ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems , pp. 269-279
    • Bril, R.J.1    Lukkien, J.J.2    Verhaegh, W.F.J.3
  • 3
    • 0343526400 scopus 로고    scopus 로고
    • Cache aware pre-runtime scheduling
    • D. Kastner and S. Thesing. Cache aware pre-runtime scheduling. Real-Time Syst., 17(2-3):235-256, 1999.
    • (1999) Real-Time Syst. , vol.17 , Issue.2-3 , pp. 235-256
    • Kastner, D.1    Thesing, S.2


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