Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Gigascope: a stream database for network applications
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Dynamic application-layer protocol analysis for network intrusion detection
USENIX-SS'06 Proceedings of the 15th conference on USENIX Security Symposium - Volume 15
JudoSTM: A Dynamic Binary-Rewriting Approach to Software Transactional Memory
PACT '07 Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques
Adaptive software transactional memory
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Towards vulnerability-based intrusion detection with event processing
Proceedings of the 5th ACM international conference on Distributed event-based system
High performance content-based matching using GPUs
Proceedings of the 5th ACM international conference on Distributed event-based system
Pub/Sub on stream: a multi-core based message broker with QoS support
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
High-performance location-aware publish-subscribe on GPUs
Proceedings of the 13th International Middleware Conference
StreamHub: a massively parallel architecture for high-performance content-based publish/subscribe
Proceedings of the 7th ACM international conference on Distributed event-based systems
| Hi-index | 0.00 |
Event processing systems are a promising technology for enterprise-scale applications. However, achieving scalability yet maintaining high performance is a challenging problem. This work introduces a parallel matching engine which leverages current chip multi-processors to increase throughput and to reduce the matching time. We present three parallelization techniques, as well as lock-based and software transactional memory-based implementations of each technique, and discuss their impact. The results show a 74% reduction of the average matching time and an improved throughput of over 1600 events/second when using eight processors.