A distributed task scheduling strategy for massive mobile application security detection

A distributed scheduling strategy is designed in this paper for a security detection platform containing mass mobile applications. This strategy proposes a load-balancing algorithm, which is based on the dynamic feedback and achieves remarkable simplification and efficiency. It not only solves the problem that massive mobile applications are detected in slow speed, but also can support the expansion of this platform. Comparing with other traditional strategies, such as round-robin algorithm, this algorithm contributes to a more efficient scheduling results, and it has been testified by vast experiments.