메뉴 건너뛰기




Volumn 2, Issue , 2010, Pages 226-232

Fault tolerant scheduling on Controller Area Network (CAN)

Author keywords

Fault tolerance; Real time systems; Time redundancy

Indexed keywords

AUTOMATION DOMAIN; COMPONENT-BASED DEVELOPMENT; CONTROLLER AREA NETWORK; CRITICAL FACTORS; DESIGN PARADIGM; DISTRIBUTED REAL TIME SYSTEM; EARLIEST DEADLINE FIRST; FAULT CONTAINMENT; FAULT TOLERANT SCHEDULING; FAULT-TOLERANT; HUMAN LIVES; NETWORKED EMBEDDED SYSTEMS; REAL-TIME APPLICATION; RESEARCH ISSUES; SYSTEM OF SYSTEMS; TIME REDUNDANCY;

EID: 77954767531     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISORCW.2010.32     Document Type: Conference Paper
Times cited : (7)

References (17)
  • 1
    • 0032188298 scopus 로고    scopus 로고
    • Controller area networks: CAN's use within automobiles
    • October/November
    • N. Navet, "Controller Area Networks: CAN's use within Automobiles," IEEE Potentials, pp. 12-14, October/November 1998.
    • (1998) IEEE Potentials , pp. 12-14
    • Navet, N.1
  • 4
    • 34249859868 scopus 로고    scopus 로고
    • Fault-tolerant time-triggered communication using CAN
    • M. Short and M. Pont, "Fault-tolerant time-triggered communication using CAN," IEEE Transactions on Industrial Informatics, vol. 3, no. 2, pp. 131-142, 2007.
    • (2007) IEEE Transactions on Industrial Informatics , vol.3 , Issue.2 , pp. 131-142
    • Short, M.1    Pont, M.2
  • 5
    • 0029359773 scopus 로고
    • Calculating controller area network CAN message response times
    • K. Tindell, A. Burns, and A. Wellings, "Calculating controller area network CAN message response times," Control Engineering Practice, vol. 3, pp. 1163-1169, 1995.
    • (1995) Control Engineering Practice , vol.3 , pp. 1163-1169
    • Tindell, K.1    Burns, A.2    Wellings, A.3
  • 6
    • 0000703331 scopus 로고
    • Applying new scheduling theory to static priority pre-emptive scheduling
    • September
    • N. C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Pre-emptive Scheduling," Software Engineering Journal, vol. 8, no. 5, pp. 284-292, September 1993.
    • (1993) Software Engineering Journal , vol.8 , Issue.5 , pp. 284-292
    • Audsley, N.C.1    Burns, A.2    Richardson, M.3    Tindell, K.4    Wellings, A.5
  • 7
    • 33846861495 scopus 로고    scopus 로고
    • Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
    • R. I. Davis, A. Burns, R. J. Bril, and J. J. Lukkien, "Controller area network (can) schedulability analysis: Refuted, revisited and revised," Real-Time Systems, vol. 35, no. 3, pp. 239-272, 2007.
    • (2007) Real-Time Systems , vol.35 , Issue.3 , pp. 239-272
    • Davis, R.I.1    Burns, A.2    Bril, R.J.3    Lukkien, J.J.4
  • 8
  • 16
    • 0024755194 scopus 로고
    • Some results of the earliest deadline scheduling algorithm
    • H. Chetto and M.Chetto, "Some results of the earliest deadline scheduling algorithm," IEEE Transactions on Software Engineering, vol. 15, no. 10, pp. 1261-1269, 1989.
    • (1989) IEEE Transactions on Software Engineering , vol.15 , Issue.10 , pp. 1261-1269
    • Chetto, H.1    Chetto, M.2


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