• DocumentCode
    884256
  • Title

    On satisfying timing constraints in hard-real-time systems

  • Author

    Xu, Jia ; Parnas, David Lorge

  • Author_Institution
    Dept. of Comput. Sci., York Univ., North York, Ont., Canada
  • Volume
    19
  • Issue
    1
  • fYear
    1993
  • fDate
    1/1/1993 12:00:00 AM
  • Firstpage
    70
  • Lastpage
    84
  • Abstract
    The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hard-real-time system. They examine some of the major concerns in pre-run-time scheduling and consider what formulations of mathematical scheduling problems can be used to address those concerns. This work provides a guide to the available algorithms
  • Keywords
    operating systems (computers); real-time systems; scheduling; hard-real-time systems; mathematical scheduling problems; pre-run-time scheduling; timing constraints; Application software; Computer applications; Control systems; Degradation; Error correction; Military computing; Processor scheduling; Scheduling algorithm; Software safety; Timing;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.210308
  • Filename
    210308
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=884256