메뉴 건너뛰기




Volumn , Issue , 2008, Pages 147-155

Schedulability analysis of sporadic tasks with multiple criticality specifications

Author keywords

Feasibility analysis; Hybrid priority scheduling; Safety critical systems; Schedulability analysis; Sporadic task systems

Indexed keywords

FEASIBILITY ANALYSIS; HYBRID-PRIORITY SCHEDULING; MULTI-CRITICALITY; MULTIPLE SPECIFICATIONS; PROCESSOR UTILIZATION; SAFETY-CRITICAL SYSTEMS; SCHEDULABILITY; SCHEDULABILITY ANALYSIS; SPORADIC TASK SYSTEMS; TASK MODELING; UNIPROCESSOR; WORST-CASE EXECUTION TIME;

EID: 52049111181     PISSN: 10683070     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECRTS.2008.26     Document Type: Conference Paper
Times cited : (127)

References (9)
  • 1
    • 0004070775 scopus 로고
    • Optimal priority assignment and feasibility of static priority tasks with arbitrary start times
    • Tech. rep, The University of York, England
    • AUDSLEY, N. C. Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Tech. rep., The University of York, England, 1991.
    • (1991)
    • AUDSLEY, N.C.1
  • 3
    • 0026238820 scopus 로고
    • Preemptively scheduling hard-real-time sporadic tasks on one processor
    • Orlando, Florida, IEEE Computer Society Press, pp
    • BARUAH, S., MOK, A., AND ROSIER, L. Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of the 11th Real-Time Systems Symposium (Orlando, Florida, 1990), IEEE Computer Society Press, pp. 182-190.
    • (1990) Proceedings of the 11th Real-Time Systems Symposium , pp. 182-190
    • BARUAH, S.1    MOK, A.2    ROSIER, L.3
  • 6
    • 0020271514 scopus 로고
    • On the complexity of fixed-priority scheduling of periodic, real-time tasks
    • LEUNG, J., AND WHITEHEAD, J. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2 (1982), 237-250.
    • (1982) Performance Evaluation , vol.2 , pp. 237-250
    • LEUNG, J.1    WHITEHEAD, J.2
  • 7
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • LIU, C., AND LAYLAND, J. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20, 1 (1973), 46-61.
    • (1973) Journal of the ACM , vol.20 , Issue.1 , pp. 46-61
    • LIU, C.1    LAYLAND, J.2
  • 8
    • 0004088928 scopus 로고
    • PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Available as Technical Report No. MIT/LCS/TR-297
    • MOK, A. K. Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, 1983. Available as Technical Report No. MIT/LCS/TR-297.
    • (1983) Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment
    • MOK, A.K.1
  • 9
    • 48649103704 scopus 로고    scopus 로고
    • Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance
    • Tucson, AZ, December, IEEE Computer Society Press, pp
    • VESTAL, S. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Proceedings of the Real-Time Systems Symposium (Tucson, AZ, December 2007), IEEE Computer Society Press, pp. 239-243.
    • (2007) Proceedings of the Real-Time Systems Symposium , pp. 239-243
    • VESTAL, S.1


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