• Title/Summary/Keyword: thread worker pool

Search Result 4, Processing Time 0.017 seconds

A Performance Comparison of Web-Server Implementation Schemes (웹 서버 구현 방안들에 대한 성능 비교)

  • Lim, Dong-gwan;Seon, Ju-ho;Kim, Jong-Wook;Kim, Yong-Seok
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.215-219
    • /
    • 2007
  • For Web server implementations, there are 4 main schemes: process-per-request (PPR), thread-per-request (TPR), worker thread pool (WTP), and worker thread pool with buffers (WTPB). This paper compares performance of the schemes in response time point of view. WTPB shows the best performance. The appropriate number of worker threads for WTPB depends on the request service time. For short requests, the number can be very small. But for longer requests, it is about 1/6 of the number of simultaneous connections.

  • PDF

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

  • Ju, Woo-Suk;Im, Choong-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.6
    • /
    • pp.876-881
    • /
    • 2009
  • 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.

  • PDF

Design and Implementation of a Web Server Using a Learning-based Dynamic Thread Pool Scheme (학습 기반의 동적 쓰레드 풀 기법을 적용한 웹 서버의 설계 및 구현)

  • Yoo, Seo-Hee;Kang, Dong-Hyun;Lee, Kwon-Yong;Park, Sung-Yong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.23-34
    • /
    • 2010
  • As the number of user increases according to the improvement of the network, the multi-thread schemes are used to process the service requests of several users who are connected simultaneously. The static thread pool scheme has the problem of occupying a static amount of system resources. On the other hand, the dynamic thread pool scheme can control the number of threads according to the users' requests. However, it has disadvantage that this scheme cannot react to the requests which are larger than the maximum value assigned. In this paper, a web server using a learning-based dynamic thread pool scheme is suggested, which will be running on a server programming of a multi-thread environment. The suggested scheme adds the creation of the threads through the prediction of the next number of periodic requests using Auto Regressive scheme with the web server apache worker MPM (Multi-processing Module). Unlike previous schemes, in order to set the exact number of the necessary threads during the unchanged number of work requests in a certain period, K-Nearest Neighbor algorithm is used to learn the number of threads in advance according to the number of requests. The required number of threads is set by comparing with the previously learned objects. Then, the similar objects are selected to decide the number of the threads according to the request, and they create the threads. In this paper, the response time has decreased by modifying the number of threads dynamically, and the system resources can be used more efficiently by managing the number of threads according to the requests.

A IOCP-based Server for Product Information Management System of Small and Medium Size Manufacturing Companies (중소 제조업체의 생산정보 관리시스템을 위한 IOCP 기반 서버)

  • Rim, Seong-Rak;Song, Ki-Seok
    • Journal of Information Technology Applications and Management
    • /
    • v.14 no.4
    • /
    • pp.31-41
    • /
    • 2007
  • In order to keep global competitiveness, most of small and medium size manufacturing companies require to equip a product information management system which collects and analyzes the data generated at the manufacturing lines and then provides information for manager or worker to make a decision. However, these companies have a cost problem for adopting the enterprise resource planning system mostly used in large companies. To overcome this problem, we suggest an IOCP-based server for the product information management system suitable for small and medium size manufacturing companies. The basic concept of suggested server is that it is possible to process concurrently the connection requests coming from data collector and client by using the facility of asynchronous notification of OS and protect a server against overload by using the thread pool.

  • PDF