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

Maximizing Determinism in Stream Processing Under Latency Constraints 延迟约束下流处理的确定性最大化

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

Nikos Zacheilas, V. Kalogeraki, Y. Nikolakopoulos, Vincenzo Gulisano, M. Papatriantafilou, P. Tsigas

{"title":"Maximizing Determinism in Stream Processing Under Latency Constraints","authors":"Nikos Zacheilas, V. Kalogeraki, Y. Nikolakopoulos, Vincenzo Gulisano, M. Papatriantafilou, P. Tsigas","doi":"10.1145/3093742.3093921","DOIUrl":"https://doi.org/10.1145/3093742.3093921","url":null,"abstract":"The problem of coping with the demands of determinism and meeting latency constraints is challenging in distributed data stream processing systems that have to process high volume data streams that arrive from different unsynchronized input sources. In order to deterministically process the streaming data, they need mechanisms that synchronize the order in which tuples are processed by the operators. On the other hand, achieving real-time response in such a system requires careful tradeoff between determinism and low latency performance. We build on a recently proposed approach to handle data exchange and synchronization in stream processing, namely ScaleGate, which comes with guarantees for determinism and an efficient lock-free implementation, enabling high scalability. Considering the challenge and trade-offs implied by real-time constraints, we propose a system which comprises (a) a novel data structure called Slack-ScaleGate (SSG), along with its algorithmic implementation; SSG enables us to guarantee the deterministic processing of tuples as long as they are able to meet their latency constraints, and (b) a method to dynamically tune the maximum amount of time that a tuple can wait in the SSG data-structure, relaxing the determinism guarantees when needed, in order to satisfy the latency constraints. Our detailed experimental evaluation using a traffic monitoring application deployed in the city of Dublin, illustrates the working and benefits of our approach.","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"24 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":"124085094","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}

引用次数: 35

Hardware Accelerated Application Integration Processing: Industry Paper 硬件加速应用集成处理:工业论文

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

Daniel Ritter, Jonas Dann, Norman May, S. Rinderle-Ma

引用次数: 12

Building Connected Car Applications on Top of the World-Wide Streams Platform: Demo 基于全球流平台构建联网汽车应用:演示

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

W. V. Raemdonck, T. V. Cutsem, K. S. Esmaili, M. Cortes, P. Dobbelaere, L. Hoste, Eline Philips, M. Roelands, L. Trappeniers

引用次数: 5

REMI, Reusable Elements for Multi-Level Information Availability: Demo REMI，多级信息可用性的可重用元素:演示

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

A. Gal, Nicolo Rivetti, Arik Senderovich, D. Gunopulos, I. Katakis, N. Panagiotou, V. Kalogeraki

引用次数: 1

Cascading Data Corruption: About Dependencies in Cyber-Physical Systems: Poster 级联数据损坏:关于网络物理系统中的依赖关系:海报

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

Stefan Gries, M. Hesenius, V. Gruhn

引用次数: 5

Consistent Stream Processing: Doctoral Symposium 一致性流处理:博士研讨会

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

Lorenzo Affetti

引用次数: 2

Data Streaming and its Application to Stream Processing: Tutorial 数据流及其在流处理中的应用教程

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

Leonardo Querzoni, Nicolo Rivetti

引用次数: 3

Challenges to Achieving High Availability at Scale 实现大规模高可用性的挑战

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

W. Shulte

{"title":"Challenges to Achieving High Availability at Scale","authors":"W. Shulte","doi":"10.1145/3093742.3097270","DOIUrl":"https://doi.org/10.1145/3093742.3097270","url":null,"abstract":"Facebook is a social network that connects more than 1.8 billion people. To serve these many users requires infrastructure which is composed of thousands of interdependent systems that span geographically distributed data centers. But what is the guiding principle for building and operating these systems? For Facebook’s infrastructure teams the answer is: Systems must always be available and never lose data. This talk will explore this quest. We will focus on three aspects. Availability and consistency. What form of consistency do Facebook’s systems guarantee? Strong consistency makes understanding easy but has latency penalties, weak consistency is fast but difficult to reason for developers and users. We describe our usage of eventual consistency and delve into how Facebook constructs its caching and replicated storage systems to minimize the duration for achieving consistency. We share empirical data that measures the effectiveness of our design. Availability and correctness. With network partitions, relaxed forms of consistency, and software bugs, how do we guarantee a consistent state? We present two systems to find and repair structural errors in Facebook’s social graph, one batch and one real-time. Availability and scale. Sharding is one of the standard answers to operate at scale. But how can we develop one system that can shard storage as well as compute? We will introduce a new Sharding-as-a-Service component. We will show and evaluate how its design and service policies control for latency, failure tolerance and operationally efficiency. 1998 ACM Subject Classification Computer; C 1.4 Distributed Architectures; C.2.4 Distributed Systems; C.4 Fault Tolerance, Reliability, Availability and Serviceability; D 1.3 Distributed Programming; D 4.7 Distributed Systems; E 1 Distributed Data Structures","PeriodicalId":325666,"journal":{"name":"Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems","volume":"23 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":"115845317","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}

引用次数: 0

Human Body Related Event Processing: Tutorial 人体相关事件处理:教程

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

O. Etzion

引用次数: 0

SecureStreams: A Reactive Middleware Framework for Secure Data Stream Processing SecureStreams:用于安全数据流处理的响应式中间件框架

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

Aurélien Havet, Rafael Pires, P. Felber, Marcelo Pasin, Romain Rouvoy, V. Schiavoni

引用次数: 30