Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13788
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
Source: 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.
URI: http://scholarbank.nus.edu.sg/handle/10635/13788
Appears in Collections:Master's Theses (Open)

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

OPEN

NoneView/Download

Page view(s)

320
checked on Dec 18, 2017

Download(s)

298
checked on Dec 18, 2017

Google ScholarTM

Check


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