Implementation of algorithms for computing information propagation delays through sequences of fixed-priority periodic tasks

K-REx Repository

Show simple item record Tadakamalla, Vineet 2011-05-05T13:55:33Z 2011-05-05T13:55:33Z 2011-05-05
dc.description.abstract Nowadays, there is a rapid increase in the complexity of large automotive and control systems because of the integration of external software modules in them. Many of these systems are based on sampled-data control theory. And because of the different timing constraints of individual modules, each module has a different sampling rate. Typically, these systems operate with periodic task sequences and the information flows between the tasks. Generally the information propagates from tasks operating at one period to tasks operating at different periods. When this happens, unusually long information propagation delays can occur which can be disastrous because the system cannot respond to the changes until this delay has been elapsed. Although for arbitrary set of task sets the delays can be very long, Howell and Mizuno (2010) considers a set of task sequences with special constraints and some very useful bounds are derived for the worst case occurrences of them. Howell and Mizuno (2011) has laid out algorithms that compute the delays for certain special cases of task sequences considered in Howell and Mizuno (2010). The purpose of this project is to understand and implement the algorithms from Howell and Mizuno (2011). The implementation is done so that it avoids the manual computation of the delays and helps in better understanding the ideas presented in Howell and Mizuno (2011). The application can be tested against any valid input that meets our assumptions, and it constructs a schedule that exhibits the worst case behavior and from the schedule it computes the worst case information propagation delays. en_US
dc.language.iso en_US en_US
dc.publisher Kansas State University en
dc.subject Propagation en_US
dc.subject Delays en_US
dc.title Implementation of algorithms for computing information propagation delays through sequences of fixed-priority periodic tasks en_US
dc.type Report en_US Master of Science en_US
dc.description.level Masters en_US
dc.description.department Department of Computing and Information Sciences en_US
dc.description.advisor Rodney R. Howell en_US
dc.subject.umi Computer Science (0984) en_US 2011 en_US May en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search K-REx

Advanced Search


My Account

Center for the

Advancement of Digital


118 Hale Library

Manhattan KS 66506

(785) 532-7444