*banner
 

Anytime Control Algorithms for Embedded Real-Time Systems
Luca Greco

Citation
Luca Greco. "Anytime Control Algorithms for Embedded Real-Time Systems". Talk or presentation, 29, April, 2008; Presented at the CHESS Seminar, Berkeley, CA.

Abstract
In this talk we consider scheduling the execution of a number of different software tasks implementing a hierarchy of real-time controllers for a given plant. Controllers are considered to be ordered according to a measure of the performance they provide. Software tasks implementing higher-performance controllers are assumed to require a larger worst-case execution time. Control tasks are to be scheduled within given availability limits on execution time, which change stochastically in time. The ensuing switching system is prone to instability, unless a very conservative policy is enforced of always using the simplest, least performant controller. The presented method allows to condition the stochastic scheduling of control tasks so as to obtain a better exploitation of computing capabilities, while guaranteeing almost sure stability of the resulting switching system.

Electronic downloads

Citation formats  
  • HTML
    Luca Greco. <a
    href="http://chess.eecs.berkeley.edu/pubs/424.html"><i>Anytime
    Control Algorithms for Embedded Real-Time
    Systems</i></a>, Talk or presentation,  29,
    April, 2008; Presented at the <a
    href="http://chess.eecs.berkeley.edu/seminar.htm"
    >CHESS Seminar</a>, Berkeley, CA.
  • Plain text
    Luca Greco. "Anytime Control Algorithms for Embedded
    Real-Time Systems". Talk or presentation,  29, April,
    2008; Presented at the <a
    href="http://chess.eecs.berkeley.edu/seminar.htm"
    >CHESS Seminar</a>, Berkeley, CA.
  • BibTeX
    @presentation{Greco08_AnytimeControlAlgorithmsForEmbeddedRealTimeSystems,
        author = {Luca Greco},
        title = {Anytime Control Algorithms for Embedded Real-Time
                  Systems},
        day = {29},
        month = {April},
        year = {2008},
        note = {Presented at the <a
                  href="http://chess.eecs.berkeley.edu/seminar.htm"
                  >CHESS Seminar</a>, Berkeley, CA.},
        abstract = {In this talk we consider scheduling the execution
                  of a number of different software tasks
                  implementing a hierarchy of real-time controllers
                  for a given plant. Controllers are considered to
                  be ordered according to a measure of the
                  performance they provide. Software tasks
                  implementing higher-performance controllers are
                  assumed to require a larger worst-case execution
                  time. Control tasks are to be scheduled within
                  given availability limits on execution time, which
                  change stochastically in time. The ensuing
                  switching system is prone to instability, unless a
                  very conservative policy is enforced of always
                  using the simplest, least performant controller.
                  The presented method allows to condition the
                  stochastic scheduling of control tasks so as to
                  obtain a better exploitation of computing
                  capabilities, while guaranteeing almost sure
                  stability of the resulting switching system.},
        URL = {http://chess.eecs.berkeley.edu/pubs/424.html}
    }
    

Posted by Christopher Brooks on 5 May 2008.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

You are not logged in 
©2002-2014 Chess