Analysis of Different Variants in Round Robin Algorithms for Load Balancing in Cloud Computing

Mohanty, Subhadarshini; Rekha, K. Smruti

doi:10.5120/12103-8221

Cited by 26 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For evaluation purposes, three different datasets were utilized through testing the proposed algorithm against three different scheduling algorithms: traditional SJF, traditional RR and Time Slice Priority Based RR (TSPBRR) [50]. It was tested in two cases the first SRSQ with static task quantum through each iteration, while changing from one iteration to the next and the second SRSQ with dynamic quantum through the same iteration and from one iteration to the next.…”

Section: Resultsmentioning

confidence: 99%

A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique

2017

View full text Add to dashboard Cite

Cloud computing is a ubiquitous network access model to a shared pool of configurable computing resources where available resources must be checked and scheduled using an efficient task scheduler to be assigned to clients. Most of the existing task schedulers, did not achieve the required standards and requirements as some of them only concentrated on waiting time or response time reduction or even both neglecting the starved processes at all. In this paper, we propose a novel hybrid task scheduling algorithm named (SRDQ) combining Shortest-JobFirst (SJF) and Round Robin (RR) schedulers considering a dynamic variable task quantum. The proposed algorithms mainly relies on two basic keys the first having a dynamic task quantum to balance waiting time between short and long tasks while the second involves splitting the ready queue into two sub-queues, Q1 for the short tasks and the other for the long ones. Assigning tasks to resources from Q 1 or Q 2 are done mutually two tasks from Q 1 and one task from Q 2 . For evaluation purpose, three different datasets were utilized during the algorithm simulation conducted using CloudSim environment toolkit 3.0.3 against three different scheduling algorithms SJF, RR and Time Slice Priority Based RR (TSPBRR) Experimentations results and tests indicated the superiority of the proposed algorithm over the state of art in reducing waiting time, response time and partially the starvation of long tasks.

show abstract

Section: Resultsmentioning

confidence: 99%

A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique

2017

View full text Add to dashboard Cite

show abstract

“…For all the cases arrival time is considered as 0. Again comparison is done between algorithms introduced in [4] (MRR) and [5] (TSPBRR) with a different set of data. Another set of data is applied to Shortest RR, Intelligent time slice and the proposed algorithm.…”

Section: B Data Setmentioning

confidence: 99%

Modified RR Algorithm with Dynamic Time Quantum for Externally Prioritized Tasks

Datta¹

2015

IJRITCC

View full text Add to dashboard Cite

Abstract-The objective of this paper is to modify Round Robin scheduling for soft real time systems. It introduces a variation of round robin algorithm which can schedule tasks considering their priorities in a round robin fashion. Simple Round Robin scheduling algorithm and Priority scheduling algorithm, both have their own drawbacks. The proposed algorithm removes the drawbacks of Round Robin scheduling and Priority scheduling. The proposed scheduling algorithm calculates different time slices for individual processes considering their priorities. Experimental analysis reveals that the proposed algorithm produces better average turnaround time, average waiting time and less number of context switches than some existing algorithms useful for interactive systems.

show abstract

“…Thus some nodes are idle for much of time and some are heavily loaded. Thus it is not a good algorithm [6].…”

Section: Distributed Load Balancingmentioning

confidence: 99%

Juxtaposition of Load Balancing Algorithms in Cloud Computing using Cloud Analyst Simulator

Gangwar¹,

Rana²

2014

IJCA

View full text Add to dashboard Cite

Cloud Computing is a term which is generally used in reference to Internet. The whole Internet can be viewed as a cloud. The cloud is quickly changing a worldwide network of computers into the largest single, "virtual" computer in the world. This includes sharing of resources which increases the load on single machine. Thus the overall performance degrades and this problem is named as load balancing. Load Balancing is one of the challenging issues now a day. To overcome from this problem be reassign the load by implementing various algorithms introduced for this problem. In this paper we study and compare various algorithms, techniques used to solve the problem of Load Balancing and Distributed Load Balancing.

show abstract

Analysis of Different Variants in Round Robin Algorithms for Load Balancing in Cloud Computing

Cited by 26 publications

References 17 publications

A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique

A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique

Modified RR Algorithm with Dynamic Time Quantum for Externally Prioritized Tasks

Juxtaposition of Load Balancing Algorithms in Cloud Computing using Cloud Analyst Simulator

Contact Info

Product

Resources

About