Parallel Matching Algorithms of Publish/Subscribe System

Publish/subscribe systems form an important communication paradigms in distributed systems. However, how to leverage current chip multi-processors to increase throughput and reduce the matching time still need further research. In this paper, we present and implement two types of parallel matching algorithms. Experiments show that relatively independent matching algorithm produces similar throughput as complete independent matching algorithm and the average matching time of collaborative matching algorithm is reduced by approximately 77% as the number of threads increases from one to six.