Amer Farroukh
ABSTRACT
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.
- M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra. Matching events in a content-based subscription system. In PODC, 1999. Google Scholar
Digital Library
- C. Cranor, T. Johnson, and O. Spataschek. Gigascope: a stream database for network applications. In SIGMOD, 2003. Google ScholarDigital Library
- P. Damron, A. Fedorova, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Hybrid transactional memory. In SIGOPS, 2006. Google ScholarDigital Library
- H. Dreger, A. Feldmann, M. Mai, V. Paxson, and R. Sommer. Dynamic application-layer protocol analysis for network intrusion detection. In USENIX Security Symposium, 2006. Google ScholarDigital Library
- F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. In SIGMOD, 2001. Google ScholarDigital Library
- G. Li, S. Hou, and H.-A. Jacobsen. A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams. In ICDCS, 2005. Google ScholarDigital Library
- D. Lupei, A. Czajkowski, C. Segulja, M. Stumm, and C. Amza. Automatic adaptation of transactional memory state management to application conflict patterns. In Interact, 2009.Google Scholar
- V. J. Marathe, W. S. Iii, and M. L. Scott. Adaptive software transactional memory. In DISC, 2005. Google ScholarDigital Library
- M. Olszewski, J. Cutler, and J. G. Steffan. Judostm: A dynamic binary-rewriting approach to software transactional memory. In PACT, 2007. Google ScholarDigital Library
- Oracle. Complex event processing in the real world. White Paper, 2007.Google Scholar
- T. W. Yan and H. Garcia-Molina. The SIFT information dissemination system. In TODS, 1999. Google ScholarDigital Library
Index Terms
- Parallel event processing for content-based publish/subscribe systems
Recommendations
Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History
NAS '08: Proceedings of the 2008 International Conference on Networking, Architecture, and StorageEfficient event matching in a content-based publish/subscribe system is an important problem. Most existing matching solutions focus on subscription relations, such as cover and merge. We observe that event matching can leverage matching history and ...
Event Modeling for Content Based Publish/Subscribe Systems
ARTCOM '09: Proceedings of the 2009 International Conference on Advances in Recent Technologies in Communication and ComputingEvent-based middle ware is a scalable and powerful type of middle ware for building large-scale distributed systems. Content Based Publish/Subscribe System (CBPSS) is a convenient interaction model for distributed systems. One of the biggest challenges ...
Location-based matching in publish/subscribe revisited
Middleware '12: Proceedings of the Posters and Demo TrackEvent processing is gaining rising interest in industry and in academia. The common application pattern is that event processing agents publish events while other agents subscribe to events of interest. Extensive research has been devoted to developing ...
Comments