메뉴 건너뛰기




Volumn , Issue , 2002, Pages 289-300

Stochastic analysis of periodic real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; RESPONSE TIME (COMPUTER SYSTEMS); SYSTEMS ANALYSIS;

EID: 0036992122     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (164)

References (19)
  • 4
    • 0000181650 scopus 로고
    • Preemptive priority based scheduling: An appropriate engineering approach
    • In S. H. Son, editor; Prentice Hall
    • A. Burns. Preemptive Priority Based Scheduling: An Appropriate Engineering Approach. In S. H. Son, editor, Advances in Real-Time Systems. Prentice Hall, 1994.
    • (1994) Advances in Real-Time Systems
    • Burns, A.1
  • 6
    • 4243470646 scopus 로고    scopus 로고
    • Probabilistic analysis and scheduling of critical soft real-time systems
    • PhD thesis, University of Illinois, Urbana-Champaign
    • M. K. Gardner. Probabilistic Analysis and Scheduling of Critical Soft Real-Time Systems. PhD thesis, University of Illinois, Urbana-Champaign, 1999.
    • (1999)
    • Gardner, M.K.1
  • 8
    • 85043092084 scopus 로고    scopus 로고
    • An accurate stochastic analysis of general priority-driven real-time systems
    • Technical report, School of Computer Science and Engineering, Seoul National University
    • K. Kim, L. L. Bello, C.-G. Lee, S. L. Min, and O. Mirabella. An Accurate Stochastic Analysis of General Priority-Driven Real-Time Systems. Technical report, School of Computer Science and Engineering, Seoul National University, 2002. Also available at http://archi.snu.ac.kr/khkim/sapds02.ps.
    • (2002)
    • Kim, K.1    Bello, L.L.2    Lee, C.-G.3    Min, S.L.4    Mirabella, O.5
  • 9
    • 84884680184 scopus 로고    scopus 로고
    • On relaxing task isolation in overrun handling to provide probabilistic guarantees to soft real-time tasks with varying execution times
    • Article number 1019199
    • K. Kim, L. Lo Bello, S. L. Min, and O. Mirabella, 2002, On relaxing task isolation in overrun handling to provide probabilistic guarantees to soft real-time tasks with varying execution times, Proceedings - Euromicro Conference on Real-Time Systems, 193-202
    • (2002) Proceedings - Euromicro Conference on Real-Time Systems , pp. 193-202
    • Kim, K.1    Lo Bello, L.2    Min, S.L.3    Mirabella, O.4
  • 11
    • 84880911285 scopus 로고
    • Fixed priority scheduling of periodic task sets with arbitrary deadlines
    • Dec.
    • J. P. Lehoczky. Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines. In Proc. of the 11th IEEE Real-Time Systems Symposium, pages 201-209, Dec. 1990.
    • (1990) Proc. of the 11th IEEE Real-Time Systems Symposium , pp. 201-209
    • Lehoczky, J.P.1
  • 15
    • 0020271514 scopus 로고
    • On the complexity of fixed priority scheduling of periodic real-time tasks
    • J. Leung and J. Whitehead. On the Complexity of Fixed Priority Scheduling of Periodic Real-Time Tasks. Performance Evaluation, 2(4):237-250, 1982.
    • (1982) Performance Evaluation , vol.2 , Issue.4 , pp. 237-250
    • Leung, J.1    Whitehead, J.2
  • 16
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • L. Liu and J. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of ACM, 20(1):46-61, 1973.
    • (1973) Journal of ACM , vol.20 , Issue.1 , pp. 46-61
    • Liu, L.1    Layland, J.2
  • 19
    • 0028396945 scopus 로고
    • An extendible approach for analyzing fixed priority hard real-time tasks
    • K. Tindell, A. Burns, and A. J. Wellings. An Extendible Approach for Analyzing Fixed Priority Hard Real-Time Tasks. Real-Time Systems, 6:133-151, 1994.
    • (1994) Real-Time Systems , vol.6 , pp. 133-151
    • Tindell, K.1    Burns, A.2    Wellings, A.J.3


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