메뉴 건너뛰기




Volumn , Issue , 2003, Pages 358-361

Can fixed priority scheduling work in practice?

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR TELEPHONE SYSTEMS; COMPUTER ARCHITECTURE; CONSTRAINT THEORY; DATA STRUCTURES; EMBEDDED SYSTEMS; PERSONAL COMPUTERS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

EID: 0346305007     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (5)
  • 2
    • 0028202307 scopus 로고
    • Timing analysis for fixed-priority scheduling of hard real-time systems
    • IEEE Computer Society Press
    • M.G. Harbour, M.H. Klein, J.P. Lehoczky, "Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 13-28, IEEE Computer Society Press, 1994.
    • (1994) IEEE Transactions on Software Engineering , vol.20 , Issue.1 , pp. 13-28
    • Harbour, M.G.1    Klein, M.H.2    Lehoczky, J.P.3


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