Current real-time scheduling methods focus on periodic tasks with fixed (or at least bounded) execution times. However, many tasks used in control and optimization applications do not fit this pattern. "Anytime" or incremental algorithms whose performance is variable and improves as their execution time increases are examples of such tasks. We have developed an adaptive scheduling framework to deal with multiple anytime tasks that compete with each other for processing time. This work explores the issues surrounding anytime tasks, how they are scheduled, how they adapt, and how they interact with more traditional scheduling techniques.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Anytime scheduling for real-time embedded control applications


    Beteiligte:
    Shackleton, J. (Autor:in) / Cofer, D. (Autor:in) / Cooper, S. (Autor:in)


    Erscheinungsdatum :

    01.01.2004


    Format / Umfang :

    734810 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Anytime Scheduling for Real-Time Embedded Control Applications

    Shackleton, J. / IEEE / AIAA | British Library Conference Proceedings | 2004


    Real-Time Robot Deliberation by Compilation and Monitoring of Anytime Algorithms

    Zilberstein, S. / American Institute of Aeronautics and Astronautics / United States; National Aeronautics and Space Administration | British Library Conference Proceedings | 1994


    Anytime Control Algorithm: Model Reduction Approach

    Raktim Bhattacharya / Gary Balas | AIAA | 2004


    Scheduling complex automotive embedded real-time systems

    Lauer, Christoph / Hielscher, Kai-Steffen / German, Reinhard et al. | IEEE | 2010


    Anywhere, Anyplace, Anytime

    Hilliard, J. / Travel and Tourism Research Association | British Library Conference Proceedings | 1993