A Systematical Review on Round Robin as Task Scheduling Algorithms in Cloud Computing

The utilization of cell phones and desktop computers on a global scale has experienced a significant growth in recent years. This tendency has heightened global competition and demanded firms' regional development for their continued viability. For these criteria to be met, it is required to efficiently employ resources in pursuit of operational excellence. In the context of cloud computing (CC), task scheduling is a key research topic. Task scheduling is an approach that employs an efficient algorithm to map client tasks to appropriate and accessible virtualized resources. Since CC is a distributed and scalable realm, it is more difficult to schedule work. Therefore, an effective approach to work scheduling is required since it is regarded as vital for system performance. Traditional algorithms including round-robin (RR), first come first serve (FCFS), largest job first (LJF), and shortest job first (SJF). To enhance the RR algorithm, several researchers have concentrated on choosing a suitable quantum time and provided a variety of approaches. Several researchers use Cloudsim to model CC infrastructure and applications. This review is intended to explore further because there are still many problems that will be corrected and resolved in further research. This paper can be a valuable resource for researchers who want to improve or develop RR or implement it in CC or various other related fields.