Quantum Varying Deficit Round Robin Scheduling Over Priority Queues

Xu, J. Q.; Zhu, Zhengyu; Ren, Xiang; Tian, Yang; Luo, Ying

doi:10.1109/cis.2007.182

Cited by 12 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, E-DRR achieves the best results with respect to QvDRR and DRR in all traffic configurations, with significant enhancements in terms of goodput, delay and jitter. In order to evaluate fairness among different flows in terms of throughput, the Fairness Measure (FM) index defined in [9] has been considered. In order to compare fairness behavior of the different schedulers, FM has been calculated according to the following three steps:…”

Section: Simulations and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

An innovative uplink scheduler for enhancing multi-rate fairness in WiMAX

Andreadis

Rizzuto

Zambon

2011

2011 50th FITCE Congress - "ICT: Bridging an Ever Shifting Digital Divide"

View full text Add to dashboard Cite

WiMAX is one of the most interesting solutions for broadband wireless access, offering QoS features for multimedia traffics and applications. However, without the definition of a mandatory scheduling algorithm for the assignment of channel resources, WiMAX standard is open to enhancements by QoS research groups and developers. In this paper, BS uplink scheduling algorithms are considered and an innovative solution is proposed in order to improve multi-rate fairness and QoS management. The proposed scheduler, named E-DRR, has been compared with the existing solutions through exhaustive simulations, showing its enhancements in terms of QoS performance and multi-rate fairness in resource allocation.

show abstract

Section: Simulations and Resultsmentioning

confidence: 99%

“…Another solution in literature is Quantum varying Deficit Round Robin (QvDRR) scheduler [9]. It takes advantage of priority queuing, which can meet the requirements of real-time applications by arranging them with DRR mechanisms.…”

Section: Multi-rate Fairnessmentioning

confidence: 99%

An innovative uplink scheduler for enhancing multi-rate fairness in WiMAX

Andreadis

Rizzuto

Zambon

2011

2011 50th FITCE Congress - "ICT: Bridging an Ever Shifting Digital Divide"

View full text Add to dashboard Cite

show abstract

“…RR is considered the most widely used scheduling algorithm in CPU scheduling [3], [6] also used for flow passing scheduling through a network device [7]. An essential task in operating systems in CPU Scheduling is the process of allocating a specific process for a time slice.…”

Section: Introductionmentioning

confidence: 99%

Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

Mohammed¹,

AbdulMajid²,

Mustafa³

2016

IJCA

View full text Add to dashboard Cite

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. In this study, we propose a priority multi queues algorithm with dynamic quantum time. The algorithm uses multi queues with different quantum times for the processes. The quantum times for the processes are depending on the priorities which in turn depending on the burst times of the processes. The proposed algorithm has been compared with varying time quantum algorithm which already exist to improve the original round robin algorithm. With proposed algorithm, the simple Round-Robin algorithm has been improved by about 35%. By controlling quantum time, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput.

show abstract

“…Section II provides a detailed discussion about existing similar works done in this field like PBDRR [11], Time quantum using fuzzy logic [10], an improved RR algorithm [12] and dynamic quantum [5], [13]. Section III presents the analysis & experiment discussion along with results.…”

Section: Introductionmentioning

confidence: 99%

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

Quantum Varying Deficit Round Robin Scheduling Over Priority Queues

Cited by 12 publications

References 4 publications

An innovative uplink scheduler for enhancing multi-rate fairness in WiMAX

An innovative uplink scheduler for enhancing multi-rate fairness in WiMAX

Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

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

Contact Info

Product

Resources

About