Non-Preemptive Scheduling of Messages on controller Area Network for Real-Time Control Applications (1995) [39 citations — 8 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zuberi95non-preemptivescheduling,author = {Khawar M. Zuberi and Kang G. Shin},
title = {Non-Preemptive Scheduling of Messages on controller Area Network for Real-Time Control Applications},
booktitle = {IEEE Transactions On Robotics And Automation},
year = {1995},
pages = {240--249}
}
Years of Citing Articles
Abstract:
Scheduling messages on the Controller Area Network (CAN) corresponds to assigning identifiers (IDs) to messages according to their priorities. If fixedpriority 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.
