ACM Home Page
Please provide us with feedback. Feedback
Speculative out-of-order event processing with software transaction memory
Full text PdfPdf (445 KB)
Source Distributed event-based systems; Vol. 332 archive
Proceedings of the second international conference on Distributed event-based systems table of contents
Rome, Italy
SESSION: Complex event processing and streaming queries table of contents
Pages 265-275  
Year of Publication: 2008
ISBN:978-1-60558-090-6
Authors
Andrey Brito  TU Dresden, Germany
Christof Fetzer  TU Dresden, Germany
Heiko Sturzrehm  University of Neuchâtel, Switzerland
Pascal Felber  University of Neuchâtel, Switzerland
Sponsors
: IEEE
: ACM
: USENIX
IFIP : International Federation for Information Processing
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 127,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1385989.1386023
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. J. Abadi, Y. Ahmad, M. Balazinska, U. Cetintemel, M. Cherniack, J.-H. Hwang, W. Lindner, A. S. Maskey, A. Rasin, E. Ryvkina, N. Tatbul, Y. Xing, and S. Zdonik. The design of the borealis stream processing engine. In Proceedings of the 2nd Biennial Conference on Innovative Data Systems Research (CIDR'05), Asilomar, CA, January 2005.
2
 
3
R. Barga, J. Goldstein, M. Ali, and M. Hong. Consistent streaming through time: a vision for event stream processing. In Proceedings of the third biennial conference on Innovative data systems research (CIDR'07), Asilomar, USA, January 2007.
 
4
D. Dice and N. Shavit. What really makes transactions faster? In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing. Jun 2006.
5
6
 
7
M. Koparanova and T. Risch. High-performance grid stream database manager for scientific data. In Across Grids 2003, pages 86--92. Springer-Verlag Berlin Heidelberg, 2004.
 
8
9
 
10
M. F. Spear, V. J. Marathe, W. N. S. III, and M. L. Scott. Conflict Detection and Validation Strategies for Software Transactional Memory. In 20th Intl. Symp. on Distributed Computing (DISC), 2006.
11
 
12
 
13
14

Collaborative Colleagues:
Andrey Brito: colleagues
Christof Fetzer: colleagues
Heiko Sturzrehm: colleagues
Pascal Felber: colleagues