Title :
The utilization bound of non-preemptive rate-monotonic scheduling in Controller Area Networks is 25%
Author :
Andersson, Björn ; Tovar, Eduardo
Author_Institution :
IPP Hurray Res. Group, Polytech. Inst. of Porto, Porto, Portugal
Abstract :
Consider a distributed computer system comprising many computer nodes, each interconnected with a controller area network (CAN) bus. We prove that if priorities to message streams are assigned using rate-monotonic (RM) and if the requested capacity of the CAN bus does not exceed 25% then all deadlines are met.
Keywords :
controller area networks; processor scheduling; CAN; controller area network bus; distributed computer system; nonpreemptive rate-monotonic scheduling; Algorithm design and analysis; Communication system control; Computer networks; Control systems; Distributed computing; Job shop scheduling; Processor scheduling; Real time systems; Scheduling algorithm; Terminology;
Conference_Titel :
Industrial Embedded Systems, 2009. SIES '09. IEEE International Symposium on
Conference_Location :
Lausanne
Print_ISBN :
978-1-4244-4109-9
Electronic_ISBN :
978-1-4244-4110-5
DOI :
10.1109/SIES.2009.5196186
