By Topic

Automatically Configuring Time-Triggered Schedulers for Use With Resource-Constrained, Single-Processor Embedded Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gendy, A.K. ; Univ. of Leicester, Leicester ; Pont, M.J.

This paper describes a novel two-stage search technique which is intended to support the configuration of time-triggered schedulers for use with resource-constrained embedded systems which employ a single processor. Our overall goal is to identify a scheduler implementation which will ensure that: 1) all task constraints are met; 2) CPU power consumption is "as low as possible"; and 3) a fully cooperative scheduler architecture is employed whenever possible. Our search process is not exhaustive, and it might be described as "best characteristics first" approach. We proceed iteratively, stopping the search when we have identified the first workable solution. We assume that - because we have begun the search with "best characteristics" - any schedule identified will represent a good (but not necessarily completely optimal) solution. We show that the proposed configuration algorithm is highly effective. We also demonstrate that the algorithm has much lower complexity than alternative "branch and bound" search schemes. We conclude by making some suggestions for future work in this area.

Published in:

Industrial Informatics, IEEE Transactions on  (Volume:4 ,  Issue: 1 )