Abstract
the computing network based on cloud computing is becoming more and more complex. How to effectively unload the computing tasks is the key problem to improve the service ability of the computing network. In this paper, a mathematical model of task unloading problem in computing network is established, and an optimal solution based on improved greedy algorithm is proposed, which can quickly find the way of resource chain task dynamic unloading and realize task fast allocation and calculation. In this paper, the search space for greedy algorithms is too large and there is a lack of support for HPC LAN. Therefore, the greedy algorithm search is improved from one layer to two layers, which are respectively searched by the strongly connected graph and strongly connected graph of the virtual graph, which can adapt to the computing network with complex structure, and has friendly characteristics for high-performance computing LAN.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
