Browse > Article
http://dx.doi.org/10.12673/jkoni.2013.17.2.189

A History-based Dynamic Thread Pool Method for Reducing Thread Creation and Removal Overheads  

Oh, Sam-Kweon (College of NewIT Engineering(Department of Computer Engineering), Hoseo University)
Kim, Jin-Sub (College of NewIT Engineering(Department of Computer Engineering), Hoseo University)
Abstract
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.
Keywords
History-based; Dynamic Thread Pool; Overhead; Throughput;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Silberschatz, P.B. Galvin, and G. Gagne. Operating System Concepts Essentials, First Edition Binder Ready Version. John Wiley & Sons, 2011.
2 Brian Goetz. Java theory and practice: Thread pools and work queues. IBM Develop works, http://www.ibm.com/developerworks/library/j-jtp0730, 2002.
3 D. Xu and B. Bode. "Performance study and dynamic optimization design for thread pool systems," PhD thesis, United States Department of Energy. Office of Science, 2004.
4 D.C. Schmidt, "Evaluating architectures for multi-threaded object request broker." Communications of the ACM, vol. 41, no. 10, pp. 54-60, 1998.
5 Dynamic TAO Documentation, http://choices.cs.uiuc.edu/2k/dynamicTAO/doc/
6 D.H. Kang, S. Han, S.H. Yoo, and S. Park, "Prediction-based dynamic thread pool scheme for efficient resource usage," In Computer and Information Technology Workshops, CIT Workshops 2008, IEEE 8th International Conference, pp. 159-164, 2008.
7 DongHyun Kang, SeoHee Yoo, Sungyong Park. "A Dynamic Thread Pool Scheme based on the Learning for a Web Server," ITC-CSCC(International Technical Conference on Circuits Systems , Computers and Communications), pp. 268-271, 2009.
8 AutoRegressive, http://local.wasp.uwa.edu.au/-pbourke/miscellaneous/ar/
9 Chang-Hwan Lee, "Calculating Attribute Weights in K-Nearest Neighbor Algorithms using Information Theory," KIISE JCSE, vol. 32, no. 9, pp. 920-926, September 2005.   과학기술학회마을
10 Lee, K.L. and Pham, H.N. and Kim, H. and Youn, H.Y. and Song, O. "A Novel Predictive and Self-Adaptive Dynamic Thread Pool Management," Parallel and Distributed Processing with Applications (ISPA), 2011 IEEE 9th International Symposium, pp. 93-98, 2011.
11 Jinsub Kim, "A History-based Thread Pool Method for Reducing Overhead of Thread Creation and Deletion," Master's thesis for a degree in Hoseo University, 2012.