GIBET TANI, Hicham and EL AMRANI, Chaker - Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data

jdmdh:3104 - Journal of Data Mining & Digital Humanities, January 2, 2018, Special Issue on Scientific and Technological Strategic Intelligence (2016)
Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data

Authors: GIBET TANI, Hicham and EL AMRANI, Chaker

Cloud Computing and Big Data are the upcoming Information Technology (IT) computing models. These groundbreaking paradigms are leading IT to a new set of rules that aims to change computing resources delivery and exploitation model, thus creating a novel business market that is exponentially growing and attracting more and more investments from both providers and end users that are looking forward to make profits from these innovative models of computing. In the same context, researchers and investigators are wrestling time in order to develop, test and optimize Cloud Computing and Big Data platforms, whereas several studies are ongoing to determine and enhance the essential aspects of these computing models especially compute resources allocation. The processing power scheduling is crucial when it comes to Cloud Computing and Big Data because of the data growth management and delivery design proposed by these new computing models, that requires faster responses from platforms and applications. Hence originates the importance of developing high efficient scheduling algorithms that are compliant with these computing models platforms and infrastructures requirement.


Source : oai:HAL:hal-01443713v1
Volume: Special Issue on Scientific and Technological Strategic Intelligence (2016)
Published on: January 2, 2018
Submitted on: January 31, 2017
Keywords: Scheduling Algorithms,Cloud Computing Simulation,First Come First Served,Cloud Computing,Big Data,Algorithme de planification,Simulation Cloud Computing,Round Robin,Premier Arrivé Premier Servi,[INFO] Computer Science [cs]


Share

Consultation statistics

This page has been seen 930 times.
This article's PDF has been downloaded 34 times.