• DocumentCode
    2467873
  • Title

    Dispatch sequences for embedded control models

  • Author

    Alur, Rajeev ; Chandrashekharapuram, Arun

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA
  • fYear
    2005
  • fDate
    7-10 March 2005
  • Firstpage
    508
  • Lastpage
    518
  • Abstract
    We consider the problem of mapping a set of control components to an executable implementation. The standard approach to this problem involves mapping control blocks to periodic tasks, and then generating a schedule. This schedule is platform-dependent, and its execution requires real-time operating system support. We propose an alternative approach which involves generating a dispatch sequence of control blocks in a platform-independent manner. Our solution relies on assigning relative complexity and relative importance measures to control components, and is an adaptation of classical scheduling algorithms such as earliest-deadline-first. We show the benefits of our approach using simulation experiments on two case studies.
  • Keywords
    control engineering computing; embedded systems; operating systems (computers); scheduling; classical scheduling algorithm; control block; dispatch sequence; embedded control model; real-time operating system; Computational modeling; Industrial control; Information science; Job shop scheduling; Mathematical model; Operating systems; Processor scheduling; Real time systems; Robots; Scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real Time and Embedded Technology and Applications Symposium, 2005. RTAS 2005. 11th IEEE
  • ISSN
    1080-1812
  • Print_ISBN
    0-7695-2302-1
  • Type

    conf

  • DOI
    10.1109/RTAS.2005.19
  • Filename
    1388416