Skip to search formSkip to main contentSkip to account menu
Proportionate progress: A notion of fairness in resource allocation
TLDR
This work defines a notion of proportionate progress, called P-fairness, and uses it to design an efficient algorithm which solves the periodic scheduling problem.
View on ACM
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
TLDR
An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is described for the scheduling of such mixed-criticality task systems, andalyses of EF-VD significantly superior to previously-known ones are presented, based on metrics such as processor speedup factor and utilization bounds.
View on IEEE
Preemptively scheduling hard-real-time sporadic tasks on one processor
TLDR
The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable) and lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.
View on IEEE
Response-Time Analysis for Mixed Criticality Systems
TLDR
This paper considers a novel implementation scheme for fixed priority uniprocessor scheduling of mixed criticality systems that requires that jobs have their execution times monitored and sufficient response-time analysis is provided.
View on IEEE
Techniques for Multiprocessor Global Schedulability Analysis
  • Sanjoy Baruah
  • Mathematics
    28th IEEE International Real-Time Systems…
  • 2007
TLDR
The scheduling of sporadic task systems upon multiprocessor platforms is considered, when inter-processor migration is permitted, and a new schedulability test is proposed and proved correct.
View on IEEE
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
TLDR
The preemptive scheduling of periodic, real-time task systems on one processor is investigated, and it is shown that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ∑2p-complete.
View on Springer
Generalized Multiframe Tasks
TLDR
A framework for determining feasibility for a wide variety of task systems is established and a framework is applied to this task model to obtain a feasibility-testing algorithm that runs in time pseudo-polynomial in the size of the input for all systems of such tasks whose densities are bounded by a constant less than one.
View on Springer
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
TLDR
Algorithms are presented for the static-priority and dynamic-priority feasibility-analysis of systems of independent recurring real-time tasks in a preemptive uniprocessor environment.
View on Springer
Static-priority scheduling on multiprocessors
TLDR
It is proven that this scheduling algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm and successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocesser platform.
View on IEEE
Towards the Design of Certifiable Mixed-criticality Systems
TLDR
This paper proposes a formal model for representing mixed-criticality workloads and demonstrates the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements.
View on IEEE
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License