메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 13-22

Sensitivity analysis for fixed-priority real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

REAL-TIME EMBEDDED APPLICATIONS; SCHEDULABILITY ANALYSIS;

EID: 33947643196     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2006.26     Document Type: Conference Paper
Times cited : (57)

References (24)
  • 2
    • 0037269099 scopus 로고    scopus 로고
    • Dynamic- and static-priority scheduling of recurring real-time tasks
    • Jan
    • S. K. Baruah. Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Systems, 24(1):93-128, Jan. 2003.
    • (2003) Real-Time Systems , vol.24 , Issue.1 , pp. 93-128
    • Baruah, S.K.1
  • 4
    • 8744284409 scopus 로고    scopus 로고
    • Schedulability analysis of periodic fixed priority systems
    • Nov
    • E. Bini and G. C. Buttazzo. Schedulability analysis of periodic fixed priority systems. IEEE Transactions on Computers, 53(11):1462-1473, Nov. 2004.
    • (2004) IEEE Transactions on Computers , vol.53 , Issue.11 , pp. 1462-1473
    • Bini, E.1    Buttazzo, G.C.2
  • 6
    • 0142156702 scopus 로고    scopus 로고
    • A probabilistic framework for schedulability analysis
    • Philadelphia PA, U.S.A, Oct
    • A. Burns, G. Bernat, and I. Broster. A probabilistic framework for schedulability analysis. In Proceedings of the EMSOFT, pages 1-15, Philadelphia (PA), U.S.A., Oct. 2003.
    • (2003) Proceedings of the EMSOFT , pp. 1-15
    • Burns, A.1    Bernat, G.2    Broster, I.3
  • 9
    • 33947681289 scopus 로고    scopus 로고
    • Evidence s.r.l. RT-Druid. available at http://www.evidence.eu.com/RT- Druid.asp.
    • Evidence s.r.l. RT-Druid. available at http://www.evidence.eu.com/RT- Druid.asp.
  • 11
    • 0022796618 scopus 로고
    • Finding response times in a real-time system
    • Oct
    • M. Joseph and P. K. Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, Oct. 1986.
    • (1986) The Computer Journal , vol.29 , Issue.5 , pp. 390-395
    • Joseph, M.1    Pandya, P.K.2
  • 13
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • Jan
    • C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the Association for Computing Machinery, 20(1):46-61, Jan. 1973.
    • (1973) Journal of the Association for Computing Machinery , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 14
    • 84884686656 scopus 로고    scopus 로고
    • Memory and time-efficient schedulability analysis of task sets with stochastic execution time
    • Delft, The Nederlands, June
    • S. Manolache, P. Eles, and Z. Peng. Memory and time-efficient schedulability analysis of task sets with stochastic execution time. In Euromicro Conference on Real-Time Systems, pages 19-26, Delft, The Nederlands, June 2001.
    • (2001) Euromicro Conference on Real-Time Systems , pp. 19-26
    • Manolache, S.1    Eles, P.2    Peng, Z.3
  • 23
    • 0028396945 scopus 로고
    • An extendible approach for analysing fixed priority hard real-time tasks
    • Mar
    • K. W. Tindell, A. Burns, and A. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. Journal of Real Time. Systems, 6(2): 133-152, Mar. 1994.
    • (1994) Journal of Real Time. Systems , vol.6 , Issue.2 , pp. 133-152
    • Tindell, K.W.1    Burns, A.2    Wellings, A.3
  • 24
    • 0028413120 scopus 로고
    • Fixed-priority sensitivity analysis for linear compute time models
    • Apr
    • S. Vestal. Fixed-priority sensitivity analysis for linear compute time models. IEEE Transactions on Software Engineering, 20(4):308-317, Apr. 1994.
    • (1994) IEEE Transactions on Software Engineering , vol.20 , Issue.4 , pp. 308-317
    • Vestal, S.1


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