Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems最新文献_第6页

A New Application Benchmark for Data Stream Processing Architectures in an Enterprise Context: Doctoral Symposium 企业环境下数据流处理体系结构的新应用基准:博士研讨会

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3093902

Guenter Hesse, Christoph Matthies, Benjamin Reissaus, M. Uflacker

{"title":"A New Application Benchmark for Data Stream Processing Architectures in an Enterprise Context: Doctoral Symposium","authors":"Guenter Hesse, Christoph Matthies, Benjamin Reissaus, M. Uflacker","doi":"10.1145/3093742.3093902","DOIUrl":"https://doi.org/10.1145/3093742.3093902","url":null,"abstract":"Against the backdrop of ever-growing data volumes and trends like the Internet of Things (IoT) or Industry 4.0, Data Stream Processing Systems (DSPSs) or data stream processing architectures in general receive a greater interest. Continuously analyzing streams of data allows immediate responses to environmental changes. A challenging task in that context is assessing and comparing data stream processing architectures in order to identify the most suitable one for certain settings. The present paper provides an overview about performance benchmarks that can be used for analyzing data stream processing applications. By describing shortcomings of these benchmarks, the need for a new application benchmark in this area, especially for a benchmark covering enterprise architectures, is highlighted. A key role in such an enterprise context is the combination of streaming data and business data, which is barely covered in current data stream processing benchmarks. Furthermore, first ideas towards the development of a solution, i.e., a new application benchmark that is able to fill the existing gap, are depicted.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Loosely Coupled Approach for Web-Based Collaborative 3D Design: Doctoral Symposium 基于网络的协同三维设计的松耦合方法:博士研讨会

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3093905

C. Desprat, Benoît Caudesaygues, H. Luga, J. Jessel

引用次数: 1

Raphtory: Decentralised Streaming for Temporal Graphs: Doctoral Symposium 图片集:时间图的分散流:博士研讨会

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3096341

Benjamin A. Steer, Félix Cuadrado, R. Clegg

引用次数: 0

Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time 最坏情况常数时间下的低延迟滑动窗口聚合

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3093925

Kanat Tangwongsan, Martin Hirzel, S. Schneider

{"title":"Low-Latency Sliding-Window Aggregation in Worst-Case Constant Time","authors":"Kanat Tangwongsan, Martin Hirzel, S. Schneider","doi":"10.1145/3093742.3093925","DOIUrl":"https://doi.org/10.1145/3093742.3093925","url":null,"abstract":"Sliding-window aggregation is a widely-used approach for extracting insights from the most recent portion of a data stream. The aggregations of interest can usually be cast as binary operators that are associative, but they are not necessarily commutative nor invertible. Non-invertible operators, however, are difficult to support efficiently. The best published algorithms require O(log n) aggregation steps per window operation, where n is the sliding-window size at that point. For a FIFO window, this can be improved to O(1) on average by using two aggregation stacks. This paper presents DABA, a novel algorithm for aggregating FIFO sliding windows that significantly improves upon these time bounds. DABA requires only O(1) aggregation steps per operation in the worst case (not just on average). As such, DABA asymptotically improves the performance of sliding-window aggregation without restricting the operator to be invertible. Our experimental results demonstrate that these theoretical improvements hold in practice. DABA is a substantial improvement over the state of the art in terms of both latency and throughput.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"135 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132054498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 50

Automatic Anomaly Detection over Sliding Windows: Grand Challenge 滑动窗口上的自动异常检测:大挑战

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3095105

Tarek Zaarour, Niki Pavlopoulou, S. Hasan, U. Hassan, E. Curry

引用次数: 11

Complex Event Recognition Languages: Tutorial 复杂事件识别语言:教程

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-06-08 DOI: 10.1145/3093742.3095106

A. Artikis, Alessandro Margara, M. Ugarte, Stijn Vansummeren, M. Weidlich

引用次数: 42

Minimizing Communication Overhead in Window-Based Parallel Complex Event Processing 最小化基于窗口的并行复杂事件处理中的通信开销

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 2017-05-16 DOI: 10.1145/3093742.3093914

R. Mayer, M. Tariq, K. Rothermel

{"title":"Minimizing Communication Overhead in Window-Based Parallel Complex Event Processing","authors":"R. Mayer, M. Tariq, K. Rothermel","doi":"10.1145/3093742.3093914","DOIUrl":"https://doi.org/10.1145/3093742.3093914","url":null,"abstract":"Distributed Complex Event Processing has emerged as a well-established paradigm to detect situations of interest from basic sensor streams, building an operator graph between sensors and applications. In order to detect event patterns that correspond to situations of interest, each operator correlates events on its incoming streams according to a sliding window mechanism. To increase the throughput of an operator, different windows can be assigned to different operator instances---i.e., identical operator copies---which process them in parallel. This implies that events that are part of multiple overlapping windows are replicated to different operator instances. The communication overhead of replicating the events can be reduced by assigning overlapping windows to the same operator instance. However, this imposes a higher processing load on the single operator instance, possibly overloading it. In this paper, we address the trade-off between processing load and communication overhead when assigning overlapping windows to a single operator instance. Controlling the trade-off is challenging and cannot be solved with traditional reactive methods. To this end, we propose a model-based batch scheduling controller building on prediction. Evaluations show that our approach is able to significantly save bandwidth, while keeping a user-defined latency bound in the operator instances.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130291954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems 第11届ACM分布式和基于事件系统国际会议论文集

Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems Pub Date : 1900-01-01 DOI: 10.1145/3093742

引用次数: 0