Abstract
SUMMARYThis paper describes the architecture, prototype implementation and performance analysis of a complex event processing engine that can scale up to very large numbers of concurrent events while keeping the requirements on system resources predictable and low. The main innovation of this approach is that each instantiated event pattern is handled by a dedicated Erlang process, instead of a single or shared operating system thread. This in turn, reduces the latency in processing the event processing as it avoids the overheads associated with resource contention. We demonstrate how this approach can achieve linear event processing times under high event loads, using modest computing resources. Copyright © 2013 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
