The Community for Technology Leaders
Green Image
Issue No. 01 - Jan. (2014 vol. 25)
ISSN: 1045-9219
pp: 126-135
Alessandro Margara , Dipt. di Elettron. e Inf., Politec. di Milano, Milan, Italy
Gianpaolo Cugola , Dipt. di Elettron. e Inf., Politec. di Milano, Milan, Italy
Matching incoming event notifications against received subscriptions are a fundamental part of every publish-subscribe infrastructure. In the case of content-based systems this is a fairly complex and time consuming task, whose performance impacts that of the entire system. In the past, several algorithms have been proposed for efficient content-based event matching. While they differ in most aspects, they have in common the fact of being conceived to run on conventional, sequential hardware. On the other hand, parallel hardware is becoming available off-the-shelf: the number of cores inside CPUs is constantly increasing, and CUDA makes it possible to access the power of GPU hardware for general purpose computing. In this paper, we describe a new publish-subscribe content-based matching algorithm designed to run efficiently both on multicore CPUs and CUDA GPUs. A detailed comparison with two state-of-the-art sequential matching algorithms demonstrates how the use of parallel hardware can bring impressive speedups in content-based matching. At the same time, our analysis identifies the characteristic aspects of multicore and CUDA programming that mostly impact performance.
Graphics processing units, Filtering algorithms, Instruction sets, Phase change materials, Matched filters, Hardware, Arrays,performance evaluation (efficiency and effectiveness)), Multiple data stream architectures (multiprocessors), distributed systems, performance of systems, concurrent programming (parallel programming), systems and software (distributed systems
Alessandro Margara, Gianpaolo Cugola, "High-Performance Publish-Subscribe Matching Using Parallel Hardware", IEEE Transactions on Parallel & Distributed Systems, vol. 25, no. , pp. 126-135, Jan. 2014, doi:10.1109/TPDS.2013.39
182 ms
(Ver 3.3 (11022016))