Abstract
A good message scheduling algorithm could give timeliness guarantee to real-time control network. Based on DM algorithm, this paper presents an improved deadline-based algorithm, Deadline Monotonic with Urgent Message Considered (DMUMC), for FF control network message scheduling. The main idea of DMUMC is that deadline of urgent aperiodic message, such as alarms, was taken into account when establishing BAT. The simulation results show that DMUMC algorithm significantly reduces response time of urgent aperiodic message by adjusting service time of low priority periodic message with large deadline, and improves timeliness and message schedulability of FF control network, compared with traditional methods that didn’t consider the issue of aperiodic message.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Q., Ju, L., Ge, S., Shi, R. (2006). An Improved Deadline-Based Message Scheduling Algorithm for Real-Time Control Network. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence. ICIC 2006. Lecture Notes in Computer Science(), vol 4114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-37275-2_134
Download citation
DOI: https://doi.org/10.1007/978-3-540-37275-2_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37274-5
Online ISBN: 978-3-540-37275-2
eBook Packages: Computer ScienceComputer Science (R0)