By Topic

Using a flexible real-time scheduling strategy in a distributed embedded application

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

4 Author(s)
Becker, L.B. ; Fac. of Informatics, Univ. Fed. do Rio Grande do Sul, Brazil ; Gergeleit, M. ; Schemmer, S. ; Nett, E.

The increasing complexity of current real-time applications demands systems to make good use of the available computational resources. Guaranteeing timing behavior using traditional real-time scheduling policies is turning to be unfeasible, as these policies are based in pessimistic worst-case assumptions that pre-allocate resources even though they will be rarely used. The time-aware fault-tolerant (TAFT) scheduler presents a flexible scheduling strategy that allows the construction of schedules maximizing the CPU utilization. This work presents the use of the TAFT scheduler with computational intensive distributed embedded applications, in order to keep a high ratio of successful tasks completion and so guaranteeing its computational progress. More specifically, the paper sketches a "TAFT-based" fusion algorithm for laser-scanner data and derives the requirements that the execution of this algorithm has on the CPU-scheduling.

Published in:

Emerging Technologies and Factory Automation, 2003. Proceedings. ETFA '03. IEEE Conference  (Volume:2 )

Date of Conference:

16-19 Sept. 2003