 10 Jan, 2017 4 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

 25 Nov, 2016 7 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored
 Added definitions and implementation of jitteraware RTA for uniprocessor scheduling.  The Prosa directory was restructured to better accomodate the different types of arrival sequences and schedules.

 26 Oct, 2016 2 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

 19 Oct, 2016 1 commit


Felipe Cerqueira authored

 18 Oct, 2016 6 commits


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 suspensionaware schedule to suspensionoblivious schedule by inflating costs (works with JLDP policies and nonunique priorities)  Formalize suspensionoblivious FP RTA using the reduction  Add implementation of a concrete suspensionaware scheduler  Test suspensionoblivious FP RTA with an actual task set  Add simpler definition for JLFP policies  Generalize busy interval lemmas from FP to JLFP scheduling

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

 06 Oct, 2016 3 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

 06 Sep, 2016 5 commits


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 nonunique 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).

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

 05 Aug, 2016 2 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

 03 Aug, 2016 1 commit


Felipe Cerqueira authored

 17 Jul, 2016 1 commit


Björn Brandenburg authored

 15 Jul, 2016 1 commit


Felipe Cerqueira authored

 14 Jul, 2016 1 commit


Felipe Cerqueira authored

 13 Jul, 2016 1 commit


Björn Brandenburg authored
The BSD version of `find` needs to be given '.' as the search path.

 12 Jul, 2016 1 commit


Felipe Cerqueira authored

 08 Jun, 2016 3 commits


Felipe Cerqueira authored

Felipe Cerqueira authored

Felipe Cerqueira authored

 06 Jun, 2016 1 commit


Felipe Cerqueira authored
 Add definitions related to APA scheduling  Prove correctness of reductionbased 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
