Non-preemptive scheduling of messages on controller area network for real-time control applications
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Scheduling messages on the controller area network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixed priority scheduling such as deadline monotonic (DM) is used to calculate these priorities, then in general, it will result in low schedulability. Dynamic scheduling schemes such as earliest deadline (ED) can give greater schedulability, but they are not practical for CAN because if the ID is to reflect message deadlines then a long ID must be used. This increases the length of each message to the point that ED is no better than DM. Our solution to this problem is the mixed traffic scheduler (MTS), which is a cross between ED and DM, and provides high schedulability without needing long IDs. Through simulations, we compare the performance of MTS with that of DM and ED* (an imaginary scheduler which works like ED, except it needs only short IDs). We use a realistic workload in our simulations based on messages typically found in computer integrated manufacturing. Our simulations show that MTS performs much better than DM and at the same level as ED*, except under high loads and tight deadlines, when ED* is superior.Keywords
This publication has 10 references indexed in Scilit:
- On non-preemptive scheduling of period and sporadic tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An analysis of the error in indirect rotor position sensing of switched reluctance motorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Real-time communication in multihop networksIEEE Transactions on Parallel and Distributed Systems, 1994
- On the ability of establishing real-time channels in point-to-point packet-switched networksIEEE Transactions on Communications, 1994
- TTP-a protocol for fault-tolerant real-time systemsComputer, 1994
- Real-time communications in a computer-controlled workcellIEEE Transactions on Robotics and Automation, 1991
- Responsive, deterministic IEEE 802.5 token ring schedulingReal-Time Systems, 1989
- Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraintsJournal of Systems and Software, 1987
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973