• Title/Summary/Keyword: Thread Pool

Search Result 28, Processing Time 0.023 seconds

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

Prediction-based Dynamic Thread Pool Model for Efficient Resource Usage (효율적인 자원 사용을 위한 예측기반 동적 쓰레드 풀 기법)

  • 정지훈;한세영;박성용
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.3_4
    • /
    • pp.213-223
    • /
    • 2004
  • A dynamic thread pool model is one of a multi-thread server programming model that handles many requests from users concurrently. In most cases, bounded thread pool model is used for server programming. Because it reduces a thread overhead by creating a pool of threads in advance, it ran response more quickly to users' requests. But this model always occupies system resource when there are small amount of requests, which prevents other applications from using available resources. In this paper, for the utilization of occupied but unused resources, we proposed and implemented a prediction-based dynamic thread pool scheme using customized exponential average. From the experiments, we show that this scheme outperforms hounded thread pool model and uses small resources.

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

A History-based Dynamic Thread Pool Method for Reducing Thread Creation and Removal Overheads (스레드 생성 및 삭제 오버헤드를 줄이기 위한 히스토리 기반의 동적 스레드풀 방법)

  • Oh, Sam-Kweon;Kim, Jin-Sub
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.2
    • /
    • pp.189-195
    • /
    • 2013
  • In an environment with frequent job requests and short job processing times, thread pool methods are frequently used to increase throughput by reducing overheads due to thread creation and removal. A watermark method normally reduces unnecessary uses of resources by keeping the number of threads less than those needed in the maximum. In the absence of available threads, however, it processes jobs by creating additional threads up to a specified limit so that the system overhead increases due to creation of threads, which results in throughput degradation. This paper presents a history-based dynamic method that alleviates throughput degradation. By estimating and maintaining the number of threads needed for jobs, it reduces overheads due to thread creation and removal. According to experiments, compared to the watermark thread pool method, it shows average 33% increase in the number of threads kept and average 62% reduction in the number of threads created, which results in 6% increase in terms of system throughput.

Bit Register Based Algorithm for Thread Pool Management (스레드 풀 관리를 위한 비트 레지스터 기반 알고리즘)

  • Shin, Seung-Hyeok;Jeon, Jun-Cheol
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.2
    • /
    • pp.331-339
    • /
    • 2017
  • This paper proposes a thread pool management technique of an websocket server that is applicable to embedded systems. WebSocket is a proposed technique for consisting a dynamic web, and is constructed using HTML5 and jQuery. Various studies have been progressing to construct a dynamic web by Apache, Oracle and etc. Previous web service systems require high-capacity, high-performance hardware specifications and are not suitable for embedded systems. The node.js which is consist of HTML5 and jQuery is a typical websocket server which is made by open sources, and is a java script based web application which is composed of a single thread. The node.js has a limitation on the performance for processing a high velocity data on the embedded system. We make up a multi-thread based websoket server which can solve the mentioned problem. The thread pool is managed by a bit register and suitable for embedded systems. To evaluate the performance of the proposed algorithm, we uses JMeter that is a network test tool.

Application of Data Processing Technology on Large Clusters to Distribution Automation System (대용량 데이터 처리기술을 배전자동화 시스템에 적용)

  • Lee, Sung-Woo;Ha, Bok-Nam;Seo, In-Yong;Jang, Moon-Jong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.2
    • /
    • pp.245-251
    • /
    • 2011
  • Quantities of data in the DMS (Distribution management system) or SCADA (Supervisory control and data acquisition) system is enormously large as illustrated by the usage of term flooding of data. This enormous quantity of data is transmitted to the status data or event data of the on-site apparatus in real-time. In addition, if GIS (Geographic information system) and AMR (Automatic meter reading), etc are integrated, the quantity of data to be processed in real-time increases unimaginably. Increase in the quantity of data due to addition of system or increase in the on-site facilities cannot be handled through the currently used Single Thread format of data processing technology. However, if Multi Thread technology that utilizes LF-POOL (Leader Follower -POOL) is applied in processing large quantity of data, large quantity of data can be processed in short period of time and the load on the server can be minimized. In this Study, the actual materialization and functions of LF POOL technology are examined.

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.

Experimental Evaluation and Flexible Performance Improvement of IoT Middleware for Efficient Connectivity (사물간의 효율적인 연결을 위한 사물인터넷 미들웨어 실험 평가 및 성능 향상 방법)

  • Jeon, Soo Bin;Lee, Chung San;Han, Young Tak;Jung, In Bum
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.9
    • /
    • pp.385-396
    • /
    • 2017
  • Many IoT platforms have been proposed for various IoT devices, from low-end to high-end performance. We previously proposed a new IoT platform called MinT that supports the operation of the sensing devices and network communication. In the proposed platform, the things can flexibly connect to each other and efficiently share their information. Most IoT platforms, including the MinT, support thread pooling to quickly process requests. However, using a thread pool with a fixed thread count can cause network delay and inefficient energy consumption. In this paper, we propose an enhanced method to manage the thread pool efficiently by adjusting the number of threads every cycle to regulate the device's performance. In particular, we aim to improve the performance of the Interaction Thread Pool Group, which is responsible for analyzing, processing, and re-transmitting the received packets. The experiment shows that the improved method increases the average throughput by approximately 25% compared to the existing platforms. Finally, using the proposed method, the MinT can reduce the transmission delay and energy consumption of devices in the IoT environment.

Temperature thread multiscale finite element simulation of selective laser melting for the evaluation of process

  • Lee, Kang-Hyun;Yun, Gun Jin
    • Advances in aircraft and spacecraft science
    • /
    • v.8 no.1
    • /
    • pp.31-51
    • /
    • 2021
  • Selective laser melting (SLM), one of the most widely used powder bed fusion (PBF) additive manufacturing (AM) technology, enables the fabrication of customized metallic parts with complex geometry by layer-by-layer fashion. However, SLM inherently poses several problems such as the discontinuities in the molten track and the steep temperature gradient resulting in a high degree of residual stress. To avoid such defects, thisstudy proposes a temperature thread multiscale model of SLM for the evaluation of the process at different scales. In microscale melt pool analysis, the laser beam parameters were evaluated based on the predicted melt pool morphology to check for lack-of-fusion or keyhole defects. The analysis results at microscale were then used to build an equivalent body heat flux model to obtain the residual stress distribution and the part distortions at the macroscale (part level). To identify the source of uneven heat dissipation, a liquid lifetime contour at macroscale was investigated. The predicted distortion was also experimentally validated showing a good agreement with the experimental measurement.

Experimental Evaluation Method for Performance Analysis in Web Application Services (웹 응용 서비스에서 성능 분석을 위한 실험적인 평가 기법)

  • Kim, Namyun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.69-75
    • /
    • 2016
  • The performance of a web application is an essential issue to provide high quality of the services in interactive web environments. On a sudden increase in traffic in a very short span of time, the servers became CPU starved and would become unresponsive. This would lead to a bad experience for the clients of web service. This paper deals with the effects of two configurable software settings of J2EE application servers: the maximum size of the thread pool and the maximum size of database connection pool. In order to figure out the optimum configuration value, this paper builds experimental evaluation method for web performance analysis. Finally, a case study related with the proper experimental method is presented with performance result.