Share This Author
Proportionate progress: A notion of fairness in resource allocation
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.
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
- Sanjoy Baruah, V. Bonifaci, L. Stougie
- Computer Science24th Euromicro Conference on Real-Time Systems
- 11 July 2012
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.
Preemptively scheduling hard-real-time sporadic tasks on one processor
- Sanjoy Baruah, A. Mok, L. Rosier
- Mathematics Proceedings 11th Real-Time Systems Symposium
- 5 December 1990
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.
Response-Time Analysis for Mixed Criticality Systems
- Sanjoy Baruah, A. Burns, Robert I. Davis
- Business, Computer ScienceIEEE 32nd Real-Time Systems Symposium
- 29 November 2011
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.
Techniques for Multiprocessor Global Schedulability Analysis
- Sanjoy Baruah
- Mathematics28th IEEE International Real-Time Systems…
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.
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
- Sanjoy Baruah, L. Rosier, Rodney R. Howell
- Mathematics, Computer ScienceReal-Time Systems
- 1 October 1990
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.
Generalized Multiframe Tasks
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.
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
- Sanjoy Baruah
- Computer ScienceReal-Time Systems
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.
Static-priority scheduling on multiprocessors
- Björn Andersson, Sanjoy Baruah, Jan Jonsson
- Computer ScienceProceedings 22nd IEEE Real-Time Systems Symposium…
- 8 May 2001
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.
Towards the Design of Certifiable Mixed-criticality Systems
- Sanjoy Baruah, Haohan Li, L. Stougie
- Computer Science, Business16th IEEE Real-Time and Embedded Technology and…
- 12 April 2010
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.