1. 20 Aug, 2019 1 commit
    • Sergey Bozhko's avatar
      tighten response-time recurrence for EDF · d6cdcfe1
      Sergey Bozhko authored
      When we were writing the paper on Abstract RTA, we noticed that the response-time recurrence for EDF does not match the known bound.
      This merge request tightens the analysis in Prosa to match the known bound.
  2. 05 Jun, 2019 1 commit
  3. 12 May, 2019 1 commit
  4. 05 Apr, 2019 1 commit
  5. 10 Jan, 2017 1 commit
  6. 25 Nov, 2016 1 commit
    • Felipe Cerqueira's avatar
      Restructure directory + Add jitter-aware RTA · a5f12a43
      Felipe Cerqueira authored
      - Added definitions and implementation of jitter-aware RTA for
        uniprocessor scheduling.
      - The Prosa directory was restructured to better accomodate the different
        types of arrival sequences and schedules.
  7. 18 Oct, 2016 1 commit
    • Felipe Cerqueira's avatar
      Major commit: Suspension-Oblivious Analysis · 843c6ffc
      Felipe Cerqueira authored
      - Add generic definition of job suspension based on the cumulative service
      - Define the dynamic suspension model (based on task suspension bounds)
      - Add suspension semantics for uniprocessor schedules
      - Formalize reduction from suspension-aware schedule to suspension-oblivious
        schedule by inflating costs (works with JLDP policies and non-unique priorities)
      - Formalize suspension-oblivious FP RTA using the reduction
      - Add implementation of a concrete suspension-aware scheduler
      - Test suspension-oblivious FP RTA with an actual task set
      - Add simpler definition for JLFP policies
      - Generalize busy interval lemmas from FP to JLFP scheduling
  8. 06 Sep, 2016 1 commit
    • Felipe Cerqueira's avatar
      Major commit: Uniprocessor RTA · ac6f0d4e
      Felipe Cerqueira authored
      This commit contains several updates related to uniprocessor scheduling.
      - Basic definitions of uniprocessor scheduling (see model/uni)
      - Definitions of worload and service for generic sets of jobs (see service.v and workload.v in model/uni)
      - Definitions and lemmas about busy intervals (see model/uni/basic/busy_interval.v)
      - Definition of an arrival bound for sporadic tasks (see model/arrival_bounds.v)
      - Definitions and correctness proofs of the RTA for FP scheduling
        (also works with non-unique priorities and arbitrary deadlines, but gives pessimistic bounds)
      - Implementation of the FP RTA to check for contradictory assumptions
      In addition, we have also defined partitioned scheduling and proven how it relates
      with uniprocessor (see model/partitioned).