메뉴 건너뛰기




Volumn , Issue , 2007, Pages 239-243

Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance

Author keywords

[No Author keywords available]

Indexed keywords

CRITICALITY (NUCLEAR FISSION); SCHEDULING;

EID: 48649103704     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2007.47     Document Type: Conference Paper
Times cited : (611)

References (9)
  • 1
    • 0004070775 scopus 로고
    • Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times,
    • Department of Computer Science, University of York, November
    • N. C. Audsley, "Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times," Technical Report YCS 164, Department of Computer Science, University of York, November 1991.
    • (1991) Technical Report YCS , vol.164
    • Audsley, N.C.1
  • 2
    • 18144449445 scopus 로고    scopus 로고
    • A Robust High-Performance Time Partitioning Algorithm: The Digital Engine Operating System (DEOS) Approach
    • Orlando, FL, October
    • Pam Binns, "A Robust High-Performance Time Partitioning Algorithm: The Digital Engine Operating System (DEOS) Approach," Digital Avionics Systems Conference, Orlando, FL, October 2001.
    • (2001) Digital Avionics Systems Conference
    • Binns, P.1
  • 3
    • 0013178006 scopus 로고    scopus 로고
    • Message Passing in MetaH Using Precedence-Constrained Multi-Criticality Preemptive Fixed Priority Scheduling
    • Redstone Arsenal, AL, August
    • Pam Binns and Steve Vestal, "Message Passing in MetaH Using Precedence-Constrained Multi-Criticality Preemptive Fixed Priority Scheduling," Life Cycle Software Engineering Conference, Redstone Arsenal, AL, August 2000.
    • (2000) Life Cycle Software Engineering Conference
    • Binns, P.1    Vestal, S.2
  • 4
    • 0024915921 scopus 로고
    • The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior
    • J. Lehoczky, L. Sha and Y. Ding, "The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior," IEEE Real-Time Systems Symposium, 1989, pp 166-171.
    • (1989) IEEE Real-Time Systems Symposium , pp. 166-171
    • Lehoczky, J.1    Sha, L.2    Ding, Y.3
  • 5
    • 84974687699 scopus 로고
    • Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment
    • January
    • C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment," Journal of the ACM, v20, n1, January 1973.
    • (1973) Journal of the ACM , vol.20
    • Liu, C.L.1    Layland, J.W.2
  • 6
    • 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), 1986.
    • (1986) The Computer Journal , vol.29 , Issue.5
    • Joseph, M.1    Pandya, P.2
  • 7
    • 0022917819 scopus 로고
    • Solutions for Some Practical Problems in Prioritized Preemptive Scheduling
    • Lui Sha, John P. Lehoczky and Ragunathan Rajkumar, "Solutions for Some Practical Problems in Prioritized Preemptive Scheduling," IEEE Real-Time Systems Symposium, 1986.
    • (1986) IEEE Real-Time Systems Symposium
    • Sha, L.1    Lehoczky, J.P.2    Rajkumar, R.3
  • 9
    • 0028413120 scopus 로고
    • Fixed Priority Sensitivity Analysis for Linear Compute Time Models
    • April
    • Steve Vestal, "Fixed Priority Sensitivity Analysis for Linear Compute Time Models," IEEE Transactions on Software Engineering, April 1994.
    • (1994) IEEE Transactions on Software Engineering
    • Vestal, S.1


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