engleski

Dynamic Thread Assigment in a Tandem of Threadpools Inspired by the Adaptation Mechanism in Honeybee Foraging

Multithreaded server applications need to run in highly dynamic environments, where loads are continuously changing. Self-adaptation and self- optimization thus become desirable features of their behaviour. In this paper we demonstrated how to apply the honeybee recruitment mechanism to optimize the number of threads in a tandem of thread pools. Measurement of sojourn times show efficiency in processing requests that have particular characteristics related to service time distribution and CPU boundness factor.

multithreading; threadpool; CPU bound; self-management; honeybee foraging

nije evidentirano