Open AccessStorm Scheduling Based on Non-cooperative Game
Author(s) -
Haixu Ma,
Xin Feng,
Guilei Wang,
Kai Sun,
Mingyuan Xiong
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1601/3/032013
Subject(s) - computer science , scheduling (production processes) , storm , distributed computing , real time computing , fair share scheduling , lagging , computer network , mathematical optimization , quality of service , medicine , oceanography , mathematics , pathology , geology
With the continuous development of Internet technology, a large amount of data with rich value has been generated, and lagging data analysis will affect the timeliness of data, so real-time streaming data processing is becoming increasingly important. Storm is a pure streaming data processing framework, but it uses the polling scheduling algorithm by default. This algorithm ignores the network communication overhead between workers and cluster load balancing. Aiming at Storm’s default scheduling problem, a non-cooperative game-based Storm scheduling algorithm (G-Storm) was proposed. Storm extracts the source data in real time through the component “Spout”, passes it to the logical processing component “Bolt”, and finally loads it into the target warehouse. The experimental results show that the game scheduling algorithm proposed in this paper reduces the system processing delay by 28.6% compared with the default scheduling algorithm.