Scheduling algorithms based on weakly hard real-time constraints


The problem of scheduling weakly hard real-time tasks is addressed in this paper. The paper first analyzes the characters of μ-pattern and weakly hard real-time constraints, then, presents two scheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, for weakly hard real-time systems. Different from traditional algorithms used to guarantee deadlines… (More)
DOI: 10.1007/BF02945471


  • Presentations referencing similar topics