Improved response time analysis of tasks scheduled under preemptive Round-Robin

Racu, Razvan; Li, Li; Henia, Rafik; Hamann, Arne; Ernst, Rolf

doi:10.1145/1289816.1289861

Cited by 24 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Matthias et al [12] proposed a solution for Linux SCHED_RR, to assign equal share of CPU to different users instead of process. Racu et al [13] presents an approach to compute best case and worst case response time of round robin scheduling. In Merywns et al [14] used Euclidian distance for calculating Quantum value.…”

Section: Background Workmentioning

confidence: 99%

Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

Srilatha

Sravani

Divya

2017

IJECE

View full text Add to dashboard Cite

In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in less throughput. In this paper a method using Manhattan distance has been proposed that decides a quantum value. The computation of the time quantum value is done by the distance or difference between the highest burst time and lowest burst time. The experimental analysis also shows that this algorithm performs better than RR algorithm and by reducing number of context switches, reducing average waiting time and also the average turna round time.

show abstract

Section: Background Workmentioning

confidence: 99%

Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

Srilatha

Sravani

Divya

2017

IJECE

View full text Add to dashboard Cite

show abstract

“…Matthias et al [9] proposed a solution for Linux SCHED_RR, to assign equal share of CPU to different users instead of process. Racu et al [10] presents an approach to compute best case and worst case response time of round robin scheduling.…”

Section: Related Workmentioning

confidence: 99%

An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time

Negi¹

2013

IJCA

View full text Add to dashboard Cite

Round Robin scheduling algorithm is the most often used scheduling algorithm in timesharing systems as it is fair to all processes and is starvation free. But along with these advantages it suffers from some drawbacks such as more number of context switches, long waiting and long turnaround time. The main objective of this paper is to improve existing round robin algorithm by extending the time quantum in real time for candidate processes in such a manner that its fairness property is not lost. The proposed algorithm in this paper finds the remaining time of a process in its last turn and then based on some threshold value, decides whether its time quantum should be extended or not. A mathematical model has been developed to prove that the proposed algorithm works better than the conventional round robin algorithm. The result of experimental study also shows that the proposed improved version of round robin algorithm performs better than the conventional round robin algorithm in terms various performance metrics such as number of context switches, average waiting and turnaround time. General TermsScheduling, Round Robin Scheduling.

show abstract

“…Algorithms exist for a multitude of scheduling and bus arbitration schemes, e.g. for static priority preemptive scheduling [30], Round Robin [21], or CAN Bus [7]. Using these functions, Compositional Performance Analysis derives bounds on the individual response time of each task in the system also under the assumption of communicating tasks.…”

Section: System Modelmentioning

confidence: 99%

A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems

Neukirchner

Stein

Ernst

2011

2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

Self Cite

View full text Add to dashboard Cite

Integration of system components is a crucial challenge in the design of embedded real-time systems, as complex non-functional interdependencies may exist.[20] presented a framework, enabling autonomous verification of timing properties in the system itself. The work presented in this paper, takes that approach one step further, enabling autonomuous assignment of execution priorities under timing constraints. We present a distributed heuristic algorithm for the constraint statisfaction problem (CSP) of finding feasible priority assignments in static priority preemptive (SPP) scheduled hard real-time systems. The proposed heuristic considers end-to-end path latency constraints in arbitrary task graphs mapped on arbitrary platform graphs.

show abstract

Improved response time analysis of tasks scheduled under preemptive Round-Robin

Cited by 24 publications

References 18 publications

Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance

An Improved Round Robin Approach using Dynamic Time Quantum for Improving Average Waiting Time

A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems

Contact Info

Product

Resources

About