Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

Mohanty, Rakesh; Behera, Himansu Sekhar; Patwari, Khusbu; Dash, Monisha; Prasanna, M. Lakshmi

doi:10.14569/ijacsa.2011.020209

Cited by 38 publications

(18 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These mechanisms are more like a gentleman's agreement and many applications do not follow them strictly, so that these mechanisms cannot solve the problem in bandwidth control. Moreover, priorities assigned by OS are based on CPU timeslicing instead of bandwidth [18], so that they cannot guarantee the QoS for Web applications. To achieve application-level bandwidth scheduling, the network packets should be associated with their corresponding processes.…”

Section: Application-level Bandwidthmentioning

confidence: 99%

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

Wang

Chen

et al. 2018

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

Quality of service (QoS) is an important performance indicator for Web applications and bandwidth is a key factor affecting QoS. Current methods use network protocols or ports to schedule bandwidth, which require tedious manual configurations or modifications of the underlying network. Some applications use dynamic ports and the traditional port-based bandwidth control methods cannot deal with them. A new QoS control method based on local bandwidth scheduling is proposed, which can schedule bandwidth at application level in a user-transparent way and it does not require tedious manual configurations. Experimental results indicate that the new method can effectively improve the QoS for applications, and it can be easily integrated into current Web applications without the need to modify the underlying network.

show abstract

Section: Application-level Bandwidthmentioning

confidence: 99%

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

Wang

Chen

et al. 2018

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

show abstract

“…Mohanty et al [3] proposed priority based Dynamic Round Robin algorithm to combine the dynamic time quantum and priority based selection of processes. In this way, time slice for each process is calculated and it changes after every round of execution.…”

Section: Related Workmentioning

confidence: 99%

“…In next round, the processes having SC as 1 assign double the time slice of its previous round whereas the processes with SC equal to 0 given the time quantum equal to the sum of the previous time quantum and ceiling of the half of the previous time quantum. After various examples, it reflected that as time quantum is dynamic therefore reducing no of context switching, average waiting and response time [3].…”

Section: Related Workmentioning

confidence: 99%

“…In the case of multiple processes to be executed, scheduling of processes requires a careful and must ensure fairness so that process starvation is minimized [2]. Scheduling process can be performed using software like scheduler or dispatcher [3]. Round Robin (RR) is most commonly known algorithm that helps in scheduling processes for OS [1], [4], [5].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems

Haseeb¹,

Tayyab²,

Hameed³

et al. 2017

ijacsa

View full text Add to dashboard Cite

Abstract-CPU scheduling is defined as scheduling multiple processes that are required to be executed in a specific time period. A large number of scheduling algorithms have been proposed to achieve maximum CPU utilization/throughput and minimizing turn around, waiting and response time. Existing studies claim that Round Robin (RR) is providing best results in terms of above-mentioned factors. In RR, a process is assigned to CPU for a fixed time quantum then the process starts its execution, in case that assigned time quantum greater than CPU's capacity then remaining section of that process waits for its next turn. Although RR schedules processes in an efficient manner, however, it has certain limitations such as if time quantum is too small or large, it causes frequent context switching and response time can increase. To address these identified problems, various improved versions of RR also exist. The purpose of this paper is twofold: 1) a comparison between different improved versions of RR; and 2) a new algorithm named Ordering Divisional Scheduling Algorithm (ODSA) is also proposed that combines various features of different algorithms and is actually an improvement to RR. Our results show that ODSA can schedule processes with less turn around and average waiting time as compared to existing solutions.

show abstract

“…Another factors is the fairness. Slowdown-driven [13] and round-robin [15], [16] policies are suitable choices for fairness. However, existing algorithms failed to make full use of the fairness in dynamic environments, and caused obvious unfairness to longermakespan jobs or shorter-makespan jobs (longer-makespan jobs means they have more longer makespans than shortermakespan jobs by using the same single DAG algorithm).…”

Section: Introductionmentioning

confidence: 99%

Schedule Dynamic Multiple Parallel Jobs with Precedence-Constrained Tasks on Heterogeneous Distributed Computing Systems

Liu

Xie

Liu

et al. 2015

2015 14th International Symposium on Parallel and Distributed Computing

View full text Add to dashboard Cite

Computer systems tend to be heterogeneous parallel and distributed computing systems, which are characterized by having various types of computational units interconnected via networks for executing multiple parallel jobs precedenceconstrained tasks. Scheduling multiple jobs, which arrive at different instants, on such systems for fastest execution is a wellknown NP-hard optimization problem. In order to achieve highperformance of systems, two important factors can be improved. One factor is the heterogeneity. Most algorithms use the upward rank value for ordering tasks and the earliest finish time for assigning processors. These two criteria can be improved to permit creating accurate and efficient schedules in heterogeneous distributed computing systems. Another factor is the fairness, existing algorithms are for static scheduling, and failed to make full use of the fairness in dynamic environments, such that obvious unfairness to longer-makespan jobs or shorter-makespan jobs can be caused. A dynamic multiple parallel jobs scheduling algorithm called F DMHSV (Fairness of Dynamic Multiple Heterogeneous Selection Value) is proposed to address the above problems to achieve high-performance of systems in this paper. Both example and extensive experimental evaluation demonstrate significant improvement of the F DMHSV algorithm.

show abstract

Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

Cited by 38 publications

References 4 publications

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

An Application-Level QoS Control Method Based on Local Bandwidth Scheduling

ODSA: A Novel Ordering Divisional Scheduling Algorithm for Modern Operating Systems

Schedule Dynamic Multiple Parallel Jobs with Precedence-Constrained Tasks on Heterogeneous Distributed Computing Systems

Contact Info

Product

Resources

About