Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines

Salmani, Vahid; Naghibzadeh, Mahmoud; Kahani, Mohsen

doi:10.1109/cit.2007.121

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It uses tasks' deadline to determine the priorities and at the same time applies processor affinity and feasibility check. We refer the reader to [14] for more details.…”

Section: Approachmentioning

confidence: 99%

See 1 more Smart Citation

Investigating the effect of processor affinity on uniform parallel machine scheduling

Khatib-Astaneh

Salmani

Yazdi

et al. 2009

2009 International Conference on Application of Information and Communication Technologies

Self Cite

View full text Add to dashboard Cite

In this paper we study the effect of processor affinity on real-time scheduling algorithms in uniform multiprocessor environments. For this reason we compare our two previously proposed algorithms called EFDF and FLLF, with two well know algorithms, namely global EDF and global LLF. Despite its non-optimality, EDF is an appropriate algorithm to use on multiprocessors. However, the performance of the traditional algorithms such as EDF and LLF significantly degrades in overloaded situations. Moreover, they produce a relatively large number of migrations which may prove unacceptable for use on some parallel machines. It is shown that our proposed algorithms not only demonstrate a performance as good as that of EDF in non-overloaded conditions but also overcome its deficiencies in overloaded situations in many aspects. Furthermore, they impose much less overhead on the system.

show abstract

“…It uses tasks' deadline to determine the priorities and at the same time applies processor affinity and feasibility check. We refer the reader to [14] for more details.…”

Section: Approachmentioning

confidence: 99%

“…Proposed in [14], the Earliest Feasible Deadline First (EFDF) scheduling algorithm is built on top of the GEDF algorithm. It uses tasks' deadline to determine the priorities and at the same time applies processor affinity and feasibility check.…”

Section: Approachmentioning

confidence: 99%

Investigating the effect of processor affinity on uniform parallel machine scheduling

Khatib-Astaneh

Salmani

Yazdi

et al. 2009

2009 International Conference on Application of Information and Communication Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

Multiprocessor Feasibility Analysis of Recurrent Task Systems with Specified Processor Affinities

Baruah¹,

Brandenburg

2013

2013 IEEE 34th Real-Time Systems Symposium

View full text Add to dashboard Cite

An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

Singh¹

2011

IJACSA

View full text Add to dashboard Cite

Abstract-To this paper we have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for earliest deadline first are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. We have applied some modification to the global earliest deadline first algorithms to decrease the number of task migration and also to add predictability to its behavior. The Aim of this work is to provide a sensitivity analysis for task deadline context of multiprocessor system by using a new approach of EFDF (Earliest Feasible Deadline First) algorithm. In order to decrease the number of migrations we prevent a job from moving one processor to another processor if it is among the m higher priority jobs. Therefore, a job will continue its execution on the same processor if possible (processor affinity). The result of these comparisons outlines some situations where one scheme is preferable over the other. Partitioning schemes are better suited for hard real-time systems, while a global scheme is preferable for soft real-time systems.

show abstract

Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines

Cited by 3 publications

References 8 publications

Investigating the effect of processor affinity on uniform parallel machine scheduling

Investigating the effect of processor affinity on uniform parallel machine scheduling

Multiprocessor Feasibility Analysis of Recurrent Task Systems with Specified Processor Affinities

An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

Contact Info

Product

Resources

About