D_EDF: An efficient scheduling algorithm for real-time multiprocessor system

Thakor, Devendra; Shah, Apurva

doi:10.1109/wict.2011.6141392

Cited by 14 publications

(7 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our result shows that the global scheduling utilizes processors little more efficiently when compared to partitioned and semipartitioned scheduling, thus improving schedulability. When compared with the success ratio and effective processor utilization for the same load in [15], RMA-SJF is analysed for global, semi-partitioned and partitioned scheduling strategies for various system loads.…”

Section: Resultsmentioning

confidence: 99%

“…Guan et al [6] conducted simulation experiments empirically comparing the real-time performance of preemptive and nonpreemptive global fixed-priority scheduling, by which they obtained interesting results suggesting that, for a considerably part of applications on multiprocessor platforms, nonpreemptive scheduling is actually a better choice than preemptive scheduling regarding the real-time performance. Therefore, obtained results are also compared with the success ratio for the same load by Thakor and Shah [15], and they show that the global RMA SJF outperforms the global preemptive EDF (earliest deadline first) and D EDF (deadline monotonic earliest deadline first) in schedulability for the same load. Figure 12 shows success ratio analyzed with EDF, D EDF, and RMA-SJF and Figure 13 shows the effective processor utilization is analyzed with EDF, D EDF, and RMA-SJF.…”

Section: Simulation and Performance Evaluationmentioning

confidence: 97%

“…(2) In [15] periodic tasks are preemptive whereas our contribution considers nonpreemptive tasks, which were considered inferior to preemptiveness, and still achieves good schedulability for overloaded conditions.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT

Pushpa

Devasikamani

2014

Modelling and Simulation in Engineering

View full text Add to dashboard Cite

System modelling with a unified modelling language (UML) is an active research area for developing real-time system development. UML is widely used modelling language in software engineering community, to specify the requirement, and analyse the target system successfully. UML can be used to provide multiple views of the system under design with the help of a variety of structural and behavioural diagrams at an early stage. UML-RT (unified modelling language-real time) is a language used to build an unambiguous executable specification of a real-time system based on UML concepts. This paper presents a unified modeling approach for a newly proposed rate monotonic scheduling algorithm-shortest job first (RMA-SJF) for partitioned, semipartitioned and global scheduling strategies in multiprocessor architecture using UML-RT for different system loads. As a technical contribution, effective processor utilization of individual processors and success ratio are analyzed for various scheduling principles and compared with EDF and D EDF to validate our proposal.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Simulation and Performance Evaluationmentioning

confidence: 97%

See 1 more Smart Citation

Schedulability Analysis for Rate Monotonic Algorithm-Shortest Job First Using UML-RT

Pushpa

Devasikamani

2014

Modelling and Simulation in Engineering

View full text Add to dashboard Cite

show abstract

“…During simulation result it has been observed that the ACO algorithm is equally optimal during underloaded condition and it performs better during overloaded condition. Many researchers worked on overload condition to improve the system performance, Devendra Thakor and A. Shaha [14] proposed D_EDF scheduling algorithm which combines Earliest Deadline First with Deadline Monotonic. Switch between the algorithms by recording the deadline miss count and deadline meet count.…”

Section: Liturature Surveymentioning

confidence: 99%

An Efficient Scheduling Strategy for Overloaded Real Time System

Shinde¹,

Biday²

2017

IJCA

View full text Add to dashboard Cite

Scheduling is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in real time operations the various scheduling techniques are developed. Earliest Deadline First algorithm is optimal scheduling algorithm for single processor real time systems when the systems are preemptive and underloaded. The limitation of this algorithm is, its performance decreases exponentially when system becomes slightly overloaded.The objective of work is to achieve optimum performance in underloaded condition and achieve high performance in overloaded condition. Proposed algorithm is design for scheduling periodic task on uniprocessor platform. With this algorithm we group jobs with nearly identical deadline and execute the jobs of a group by determining both slack time and deadline of job is another approach. The performance of the proposed algorithm is measured in terms of miss count, average response time, average waiting time and number of preemption count with existing Earliest Deadline First and Group Priority Earliest Deadline first scheduling algorithm. Results are presented by comparing proposed algorithm with other real-time algorithms including, EDF and GPEDF. The Proposed algorithm improves the success count and decrease miss count more than 10% compared with GPEDF and more than 30% compared with EDF.

show abstract

“…Devendra Thakor [10] proposed D_EDF scheduling algorithm which combines EDF with DM. Switch algorithm by recording the deadline miss count and deadline met count.…”

Section: Related Scheduling Algorithmmentioning

confidence: 99%