RSS updating task scheduler based on multi-priority
Li Le · Journal of Sichuan University · 2008
RSS is now becoming the hot point in the Internet. How to schedule RSS efficiently and reasonably attracts dedicated study in both research fields and industry. In order to solve this problem, a Closest-and-Nearest-Visited-Arithmetic (CNVA) is proposed. The contribution of this paper includes: (1) Analyses the weakness of simply scheduler. (2) Proposes a History-Reviewed-Arithmetic (HRA) based on visiting frequency. (3) Proposes CNVA based on HRA. (4) Experiments shows that the new method increases the speed by 6 times compared to traditional methods.