An analysis of EDF schedulability on a multiprocessor

Baker, Theodore P.

doi:10.1109/tpds.2005.88

Cited by 131 publications

(82 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They introduced a notion that they call minimum demand. The minimum demand of a given collection of jobs in any specific time interval is the minimum amount of execution that the sequence of jobs could require within that interval in order to meet all its deadlines 4 . We illustrate the difference between demand and minimum demand by a simple example.…”

Section: Model and Notationmentioning

confidence: 99%

Improved multiprocessor global schedulability analysis

et al. 2010

View full text Add to dashboard Cite

A new technique was recently introduced by Bonifaci et al. for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is generalized so that it is applicable to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by any work-conserving algorithm. The resulting analysis technique is applied to obtain a new sufficient global Deadline Monotonic (DM) schedulability test. It is shown that this new test is quantitatively superior to pre-existing DM schedulability analysis tests; in addition, the degree of its deviation from any hypothetical optimal scheduler (that may be clairvoyant) is quantitatively bounded. A new global EDF schedulability test is also proposed here that builds on the results of Bonifaci et al. This new test is shown to be less pessimistic and more widely applicable than the earlier result was, while retaining the strong theoretical properties of the earlier result.

show abstract

Section: Model and Notationmentioning

confidence: 99%

Improved multiprocessor global schedulability analysis

et al. 2010

View full text Add to dashboard Cite

show abstract

“…This result holds for EDF and other policies and has not been improved since then. Subsequent work has analyzed the advantage of trading speed for machines [9], while further work on conditions for the schedulability of EDF has been done by Baker [3].…”

Section: Related Workmentioning

confidence: 99%

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

2011

View full text Add to dashboard Cite

Abstract. We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and ε > 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on m speed-(2 − 1/m + ε) machines, or that the system is infeasible for m speed-1 machines. The running time of the algorithm is polynomial in the size of the task system and 1/ε. We also provide an improved bound trading off speed for additional machines. Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.

show abstract

“…Once a task is allocated to a core, it is inserted into the task queue of that core, where incoming tasks are ordered according to the EDF policy [3], which priorizes the tasks with the closest deadlines. Thus, the three tasks with the closest deadlines will be always mapped into the three hardware threads implemented in each core.…”

Section: Power-aware Schedulermentioning

confidence: 99%

A Dynamic Power-Aware Partitioner with Task Migration for Multicore Embedded Systems

March

Sahuquillo

Petit

et al. 2011

Euro-Par 2011 Parallel Processing

View full text Add to dashboard Cite

Abstract. Nowadays, a key design issue in embedded systems is how to reduce the power consumption, since batteries have a limited energy budget. For this purpose, several techniques such as Dynamic Voltage Scaling (DVS) or task migration can be used. DVS allows reducing power by selecting the optimal voltage supply, while task migration achieves this effect by balancing the workload among cores. This paper first analyzes the impact on energy due to task migration in multicore embedded systems with DVS capability and using the well-known Worst Fit (WF) partitioning heuristic. To reduce overhead, migrations are only performed at the time that a task arrives to and/or leaves the system and, in such a case, only one migration is allowed. The huge potential on energy saving due to task migration, leads us to propose a new dynamic partitioner, namely DP, that migrates tasks in a more efficient way than typical partitioners. Unlike WF, the proposed algorithm examines which is the optimal target core before allowing a migration. Experimental results show that DP can improve energy consumption in a factor up to 2.74 over the typical WF algorithm.

show abstract

An analysis of EDF schedulability on a multiprocessor

Cited by 131 publications

References 13 publications

Improved multiprocessor global schedulability analysis

Improved multiprocessor global schedulability analysis

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

A Dynamic Power-Aware Partitioner with Task Migration for Multicore Embedded Systems

Contact Info

Product

Resources

About