• DocumentCode
    2168036
  • Title

    A Method for Satisfying Asynchronous and Periodic Timing Requirements in Real-Time Embedded Systems

  • Author

    Xu, Jia

  • Author_Institution
    Dept. of Comput. Sci. & Eng., York Univ., Toronto, ON
  • fYear
    2008
  • fDate
    12-15 Oct. 2008
  • Firstpage
    455
  • Lastpage
    462
  • Abstract
    A method for satisfying asynchronous and periodic timing requirements in real-time embedded systems is presented. A guiding principle for this method is that it should exploit to a maximum extent any knowledge about system processes´ characteristics that is available both before run-time and during run-time. The method consists of two phases: a pre-run-time phase and a run-time phase. In the pre-run-time phase, some of the asynchronous processes will be converted into new periodic processes while processor capacity will be reserved for all the remaining asynchronous processes. With the use of an optimal scheduling algorithm, the schedulability of the set of the new and original periodic processes will be determined, while the schedulability of all the asynchronous processes will be verified by checking their worst-case response times. In the run-time phase, asynchronous processes are scheduled for execution while guaranteeing that all the processes that have already been scheduled in the pre-run-time phase will always meet their deadlines.
  • Keywords
    embedded systems; processor scheduling; asynchronous timing requirements; optimal scheduling algorithm; periodic timing requirements; pre-run-time phase; processor capacity; real-time embedded systems; worst-case response times; Delay; Embedded system; Optimal scheduling; Processor scheduling; Real time systems; Runtime; Sampling methods; Scheduling algorithm; Sensor systems; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mechtronic and Embedded Systems and Applications, 2008. MESA 2008. IEEE/ASME International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-2367-5
  • Electronic_ISBN
    978-1-4244-2368-2
  • Type

    conf

  • DOI
    10.1109/MESA.2008.4735659
  • Filename
    4735659