Skip to content
Snippets Groups Projects
Select Git revision
  • master default protected
  • classic-prosa
  • wip-hunspell
  • prepare_MC_PR
  • tutorial
  • fset
  • embed_arr_seq_uniq
  • v0.5
  • v0.4
  • v0.3
  • v0.2
  • v0.1
12 results
Blame Permalink
Forked from RT-PROOFS / PROSA - Formally Proven Schedulability Analysis
Source project has a limited visibility.
  • Kimaya Bedarkar's avatar
    bf4bf448
    add an RTA for FIFO scheduling based on aRTA · bf4bf448
    Kimaya Bedarkar authored and Björn Brandenburg's avatar Björn Brandenburg committed 
    Provide an RTA for FIFO scheduling on ideal uniprocessors based on an
instantiation of abstract RTA. The provided RTA is works for tasks
described by arbitrary arrival curves and is independent of the
workload's preemption model (since FIFO schedules are necessarily
non-preemptive).
    bf4bf448
    History
    add an RTA for FIFO scheduling based on aRTA
    Kimaya Bedarkar authored and Björn Brandenburg's avatar Björn Brandenburg committed 
    Provide an RTA for FIFO scheduling on ideal uniprocessors based on an
instantiation of abstract RTA. The provided RTA is works for tasks
described by arbitrary arrival curves and is independent of the
workload's preemption model (since FIFO schedules are necessarily
non-preemptive).