Optimal Scheduling Algorithm for Distributed Streaming of Data Flow across Edge Devices and Cloud

Author(s):  
J. Geetha ◽  
D.S. Jayalakshmi ◽  
Ritu Pravakar ◽  
Pallavi D. Naik ◽  
S. Sirisha Reddy
2002 ◽  
Vol 51 (4) ◽  
pp. 444-448 ◽  
Author(s):  
Chan-Ik Park ◽  
Tae-Young Choe

2020 ◽  
Vol 9 (9) ◽  
pp. 518
Author(s):  
Qing Zhu ◽  
Meite Chen ◽  
Bin Feng ◽  
Yan Zhou ◽  
Maosu Li ◽  
...  

Massive spatiotemporal data scheduling in a cloud environment play a significant role in real-time visualization. Existing methods focus on preloading, prefetching, multithread processing and multilevel cache collaboration, which waste hardware resources and cannot fully meet the different scheduling requirements of diversified tasks. This paper proposes an optimized spatiotemporal data scheduling method based on maximum flow for multilevel visualization tasks. First, the spatiotemporal data scheduling framework is designed based on the analysis of three levels of visualization tasks. Second, the maximum flow model is introduced to construct the spatiotemporal data scheduling topological network, and the calculation algorithm of the maximum data flow is presented in detail. Third, according to the change in the data access hotspot, the adaptive caching algorithm and maximum flow model parameter switching strategy are devised to achieve task-driven spatiotemporal data optimization scheduling. Compared with two typical methods of first come first serve (FCFS) and priority scheduling algorithm (PSA) by simulating visualization tasks at three levels, the proposed maximum flow scheduling (MFS) method has been proven to be more flexible and efficient in adjusting each spatiotemporal data flow type as needed, and the method realizes spatiotemporal data flow global optimization under limited hardware resources in the cloud environment.


Sign in / Sign up

Export Citation Format

Share Document