Speculative out-of-order event processing with software transaction memory Export

@inproceedings{citeulike:5377945, abstract = {In event stream applications, events flow through a network of components that perform various types of operations, e.g., filtering, aggregation, transformation. When the operation only depends on the input events, one can trivially parallelize its processing by replicating the associated components. This is not possible, however, with stateful components or when there exist dependencies between the events. Parallel versions of a number of simple stream mining operators have been designed, but, in general, complex and user-defined operators are limited by single thread performance. In this paper, we propose leveraging the processing capabilities of multi-core processors to improve the efficiency of stateful components using optimistic parallelization techniques (as provided by transactional memory). We show that, even though some speculative event executions might need to be disregarded, the overall throughput increases noticeably in the general case and latency can be reduced by pre-processing out-of-order events. Moreover, we show how simple conflict predictors can boost the parallelism even more and reduce the amount of resources used for a given level of parallelism.}, address = {New York, NY, USA}, author = {Brito, Andrey and Fetzer, Christof and Sturzrehm, Heiko and Felber, Pascal}, booktitle = {DEBS '08: Proceedings of the second international conference on Distributed event-based systems}, citeulike-article-id = {5377945}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1386023}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1385989.1386023}, doi = {10.1145/1385989.1386023}, isbn = {978-1-60558-090-6}, keywords = {event\_based\_systems, event\_stream\_processing}, location = {Rome, Italy}, pages = {265--275}, posted-at = {2009-08-06 09:45:37}, priority = {2}, publisher = {ACM}, title = {Speculative out-of-order event processing with software transaction memory}, url = {http://dx.doi.org/10.1145/1385989.1386023}, year = {2008} }

TY - CONF ID - citeulike:5377945 L3 - citeulike-article-id:5377945 N2 - In event stream applications, events flow through a network of components that perform various types of operations, e.g., filtering, aggregation, transformation. When the operation only depends on the input events, one can trivially parallelize its processing by replicating the associated components. This is not possible, however, with stateful components or when there exist dependencies between the events. Parallel versions of a number of simple stream mining operators have been designed, but, in general, complex and user-defined operators are limited by single thread performance. In this paper, we propose leveraging the processing capabilities of multi-core processors to improve the efficiency of stateful components using optimistic parallelization techniques (as provided by transactional memory). We show that, even though some speculative event executions might need to be disregarded, the overall throughput increases noticeably in the general case and latency can be reduced by pre-processing out-of-order events. Moreover, we show how simple conflict predictors can boost the parallelism even more and reduce the amount of resources used for a given level of parallelism. CY - Rome, Italy SN - 978-1-60558-090-6 AD - New York, NY, USA EP - 275 TI - Speculative out-of-order event processing with software transaction memory PB - ACM T2 - DEBS '08: Proceedings of the second international conference on Distributed event-based systems SP - 265 KW - event_based_systems KW - event_stream_processing AU - Brito, Andrey AU - Fetzer, Christof AU - Sturzrehm, Heiko AU - Felber, Pascal PY - 2008/// UR - http://dx.doi.org/10.1145/1385989.1386023 ER -