The utilization bound of non-preemptive rate-monotonic scheduling in Controller Area Networks is 25%

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.