메뉴 건너뛰기




Volumn , Issue , 2009, Pages 11-18

The utilization bound of non-preemptive rate-monotonic scheduling in controller area networks is 25%

Author keywords

[No Author keywords available]

Indexed keywords

CAN BUS; COMPUTER NODES; CONTROLLER AREA NETWORK; MESSAGE STREAMS; NON-PREEMPTIVE; RATE-MONOTONIC; RATE-MONOTONIC SCHEDULING; UTILIZATION BOUNDS;

EID: 70449433907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIES.2009.5196186     Document Type: Conference Paper
Times cited : (19)

References (15)
  • 1
    • 70449458608 scopus 로고    scopus 로고
    • CAN Specification, ver.2.0, Bosch GmbH, Stuttgart, Germany, 1991.
    • CAN Specification, ver.2.0, Bosch GmbH, Stuttgart, Germany, 1991.
  • 2
    • 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," Journal of Real-Time Systems, vol.35, no.3, pp.239-272, 2007.
    • (2007) Journal of 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
  • 3
    • 70449406610 scopus 로고    scopus 로고
    • L.George, N.Rivierre, and M.Spuri, Preemptive and non-preemptive real-time uniprocessor scheduling, INRIA, Technical Report RR-2966, Tech.Rep., 1996.
    • L.George, N.Rivierre, and M.Spuri, "Preemptive and non-preemptive real-time uniprocessor scheduling," INRIA, Technical Report RR-2966, Tech.Rep., 1996.
  • 5
    • 84974687699 scopus 로고
    • Scheduling algorithms for multiprogramming in a hard real-time environment
    • C.Liu and J.W.Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment," Journal of the Association for Computing Machinery, vol.20, pp.46-61, 1973.
    • (1973) Journal of the Association for Computing Machinery , vol.20 , pp. 46-61
    • Liu, C.1    Layland, J.W.2
  • 7
    • 48649085082 scopus 로고    scopus 로고
    • Utilization-bound based schedulability analysis of weighted round robin schedulers
    • J.Wu, J.-C.Liu, and W.Zhao, "Utilization-bound based schedulability analysis of weighted round robin schedulers," in 28nd IEEE Real-Time Systems Symposium (RTSS'07), 2007, pp.435--446.
    • (2007) 28nd IEEE Real-Time Systems Symposium (RTSS'07) , pp. 435-446
    • Wu, J.1    Liu, J.C.2    Zhao, W.3
  • 9
    • 34249859727 scopus 로고
    • Distributed broadcast channel access
    • A.K.Mok and S.Ward, "Distributed broadcast channel access," Computer Networks, vol.3, pp.327-335, 1979.
    • (1979) Computer Networks , vol.3 , pp. 327-335
    • Mok, A.K.1    Ward, S.2
  • 13
    • 34547809318 scopus 로고    scopus 로고
    • Overcoming babblingidiot failures in CAN networks: A simple and effective bus guardian solution for the FlexCAN architecture
    • G.Buja, J.R.Pimentel, and A.Zuccollo, "Overcoming babblingidiot failures in CAN networks: A simple and effective bus guardian solution for the FlexCAN architecture," IEEE Transactions on Industrial nformatics, vol.3, pp.225-233, 2007.
    • (2007) IEEE Transactions on Industrial nformatics , vol.3 , pp. 225-233
    • Buja, G.1    Pimentel, J.R.2    Zuccollo, A.3
  • 14
    • 0028418313 scopus 로고
    • Holistic schedulability analysis for distributed hard real-time systems
    • K.Tindell and J.Clark, "Holistic schedulability analysis for distributed hard real-time systems," Microprocessing and Microprogramming, vol.40, pp.117-134, 1994.
    • (1994) Microprocessing and Microprogramming , vol.40 , pp. 117-134
    • Tindell, K.1    Clark, J.2


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