Prediction-based Dynamic Thread Pool System for Massively Multi-player Online Game Server

  • Published : 2009.06.30

Abstract

Online game servers usually has been using the static thread pool system. But this system is not fit for huge online game server because the overhead is always up-and-down. Therefore, in this paper, we suggest the new algorithm for huge online game server. This algorithm is based on the prediction-based dynamic thread pool system. But it was developed for web servers and every 0.1 seconds the system prediction the needed numbers of threads and determine the thread pool size. Some experimental results show that the check time of 0.4 seconds is the best one for online game server and if the number of worker threads do not excess or lack to the given threshold then we do not predict and keep the current state. Otherwise we apply the prediction algorithm and change the number of threads. Some experimental results shows that this proposed algorithm reduce the overhead massively and make the performance of huge online game server improved in comparison to the static thread pool system.

Keywords

References

  1. Richter J., Advanced Windows, 3rd Edition, Microsoft Press, 1996.
  2. Jones, A., and Ohlund, J., Network programming for Microsoft windows, 2nd Edition, Microsoft Press, 1995.
  3. Jung, J. J., Han, S. Y., and Park, S. Y. "Prediction- based dynamic thread pool model for efficient resource usage," Computer Systems and Theory, Vol.31, No.4, pp. 213-223, 2004.
  4. Ling, Y., Mullen, T., and Lin, X., "Analysis of Optimal Thread Pool Size," ACM SIGOPS Operating System Review, Vol.34, No.2, pp. 42-55, 2000. https://doi.org/10.1145/346152.346320
  5. Peterson, J. L., and Silberschatz, A., Operating System Concepts, 2nd Edition , Addison-Wesley Publishing Co. Inc., 1985.