Please use this identifier to cite or link to this item:
Title: A scheduling algorithm for CAN bus
Authors: WANG YONG
Keywords: Controller Area Network, Scheduling algorithms, Earliest Deadline First, Schedulability, Priority mapping, Dynamic Local Priority
Issue Date: 6-Mar-2004
Citation: WANG YONG (2004-03-06). A scheduling algorithm for CAN bus. ScholarBank@NUS Repository.
Abstract: This thesis discusses the issues of scheduling and priority mapping in CAN bus. A new priority assignment mechanism, the Dynamic Local Priority (DLP) scheme, is proposed to solve the problem of limited number of priority levels for CAN bus. Theoretical analysis shows that DLP mechanism has performance closer to the ideal non-preemptive EDF scheduling than the schedulers implemented by other non-preemptive algorithms. In addition, an effective schedulability condition for non-preemptive EDF algorithm is proposed, which can precisely check the schedulability of any given message set. Finally, a platform-independent scheduling simulator software is developed so as to compare the performances of different scheduling algorithms for CAN bus. And the simulation result shows that both the new schedulability condition and DLP scheme are effective and have advantages over previous methods.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
WangY.pdf1.16 MBAdobe PDF



Page view(s)

checked on Jul 22, 2019


checked on Jul 22, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.