Optimization for multi-thread data-flow software

Abstract

This work presents an optimization tool that finds the optimal number of threads for multi-thread data-flow software. Threads are assumed to encapsulate parallel executable key functionalities, are connected through finite capacity queues, and require certain hardware resources. We show how a combination of measurement and calculation, based on queueing theory, leads to an algorithm that recursively determines the best combination of threads, i.e. the best configuration of the multi-thread data-flow software on a given host. The algorithm proceeds on the directed graph of a queueing network that models this software. Experiments on different machines verify our optimization approach. © 2011 Springer-Verlag.