Centralized Matchmaking for Minimal Agents
Klm Bertels, N. Panchanathan · 2004
In this paper we propose a simple though efficient mechanism to enable distributed processing among nodes to communicate with each other and to dynamically rebalance the workload among them. We discuss a centralized matching mechanism and investigate different matching functions, varying in the amount of information that is taken into account. The main contribution of this paper is that the simplest mechanism, called FirstMatch, results in the fastest matchmaking achieving matching rates of 99%. We also show that this time efficiency does not have a cost in terms of efficient task allocation and resource utilization.