Skip to content
GitLab
Projects Groups Topics Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Register
  • Sign in
  • P PROSA - Formally Proven Schedulability Analysis
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Graph
    • Compare revisions
  • Issues 18
    • Issues 18
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 9
    • Merge requests 9
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • RT-PROOFS
  • PROSA - Formally Proven Schedulability Analysis
  • Merge requests
  • !116

Generalize ideal aRTA

  • Review changes

  • Download
  • Patches
  • Plain diff
Merged Sergey Bozhko requested to merge sbozhko/rt-proofs:generalize_aRTA into master Sep 14, 2020
  • Overview 173
  • Commits 7
  • Pipelines 67
  • Changes 23

Summary of the changes:

  • Interference and Interfering workload are now type-classes

  • Generalizes aRTA to "multi-stage" aRTA

  • IBF supports arbitrary parameters (not just relative arrival time). IBF parametrised by the relative arrival time is not expressive enough to support restricted-supply analysis. It was generalized to support a larger class of parameters

  • Rename file [run to completion] file into [lower bound on service]. The file was slightly generalized, now it derives a lower bound on any pre-defined amount of service.

  • Generalize instantiations of interference and interfering workload. Now, the definitions do not directly destruct the processor state.

Edited Jan 20, 2023 by Sergey Bozhko
Assignee
Assign to
Reviewers
Request review from
Time tracking
Source branch: generalize_aRTA