1. 05 Jun, 2019 1 commit
  2. 19 May, 2019 1 commit
  3. 07 Dec, 2017 1 commit
  4. 10 Jan, 2017 1 commit
  5. 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.
      a5f12a43
  6. 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
      843c6ffc
  7. 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).
      ac6f0d4e
  8. 05 Aug, 2016 1 commit
  9. 06 Jun, 2016 1 commit
    • Felipe Cerqueira's avatar
      Major Commit - Prosa v0.2 · f7a79913
      Felipe Cerqueira authored
      - Add definitions related to APA scheduling
      - Prove correctness of reduction-based RTA for APA scheduling (FP and EDF)
      - Add implementation of a weak APA scheduler
      - Update definition of taskset to assume uniqueness
      - Modify names and comments to improve readability
      - Remove strong assumptions about priority order in FP scheduling
      - Add tests with FP RTA for every model
      - Add tests for RTA with parallel jobs
      f7a79913
  10. 05 May, 2016 2 commits
  11. 04 May, 2016 1 commit
  12. 31 Mar, 2016 1 commit
  13. 01 Mar, 2016 1 commit
  14. 16 Feb, 2016 1 commit
  15. 01 Feb, 2016 1 commit
    • Felipe Cerqueira's avatar
      Major Changes in RTA and Directory Structure · 32126a75
      Felipe Cerqueira authored
      - Removed unnecessary assumption in RTA about task precedence/no intra-task parallelism.
      - Scheduler models and analyses are organized in separate modules/folders.
      - Added RTA for FP and EDF for schedulers with release jitter.
      - The scheduling invariants were split into more fine-grained assumptions:
        (a) scheduler is work-conserving
        (b) scheduler enforces FP/JLDP priority X
      - New helper lemmas about counting, and sorted/uniq lists
      - Inclusion of tactics feed and feed_n (see documentation).
      - Added a Makefile generator
      32126a75