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

Load-aware shedding in stream processing systems 流处理系统中的负载感知脱落

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933311

Nicolo Rivetti, Yann Busnel, Leonardo Querzoni

引用次数: 32

High performance top-k processing of non-linear windows over data streams 数据流上非线性窗口的高性能top-k处理

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933507

A. Kammoun, Syed Gillani, C. Gravier, Julien Subercaze

{"title":"High performance top-k processing of non-linear windows over data streams","authors":"A. Kammoun, Syed Gillani, C. Gravier, Julien Subercaze","doi":"10.1145/2933267.2933507","DOIUrl":"https://doi.org/10.1145/2933267.2933507","url":null,"abstract":"This year's DEBS Grand Challenge offers two very challenging queries over social networks data. These queries -- each for a different reason -- cannot be handled by traditional techniques and therefore call for the development of a specific architecture and data structures. In the first query, the novelty is the non-linearity of the expiration of the elements. Since a traditional sliding window is not suitable, we investigate here the data structures offering the best tradeoffs for all the required operations. In the second query, unlike traditional approaches where no persistent data is stored over the stream, we have to manage a friendship graph which is persistent throughout the system execution. Due to the centrality of this structure, a careful design is therefore required. The common point of the algorithmic approaches that we developed for both queries, is the overwhelming usage of bounds -- upper and lower --, in order execute expensive computations only when required. We devise, for the Query 1, a bound based on the score decay. For the Query 2, we use Turan's theorem to limit the clique computation. The combination of lazy evaluation, careful implementation and thorough testing lead to the realization of an efficient streaming process system.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115146449","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}

引用次数: 1

Real-time social network graph analysis using StreamMine3G 实时社交网络图形分析使用StreamMine3G

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933514

André Martin, Andrey Brito, C. Fetzer

引用次数: 4

Incremental deployment and migration of geo-distributed situation awareness applications in the fog 雾中地理分布式态势感知应用的增量部署和迁移

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933317

Enrique Saurez, Kirak Hong, D. Lillethun, U. Ramachandran, Beate Ottenwälder

{"title":"Incremental deployment and migration of geo-distributed situation awareness applications in the fog","authors":"Enrique Saurez, Kirak Hong, D. Lillethun, U. Ramachandran, Beate Ottenwälder","doi":"10.1145/2933267.2933317","DOIUrl":"https://doi.org/10.1145/2933267.2933317","url":null,"abstract":"Geo-distributed Situation Awareness applications are large in scale and are characterized by 24/7 data generation from mobile and stationary sensors (such as cameras and GPS devices); latency-sensitivity for converting sensed data to actionable knowledge; and elastic and bursty needs for computational resources. Fog computing [7] envisions providing computational resources close to the edge of the network, consequently reducing the latency for the sense-process-actuate cycle that exists in these applications. We propose Foglets, a programming infrastructure for the geo-distributed computational continuum represented by fog nodes and the cloud. Foglets provides APIs for a spatio-temporal data abstraction for storing and retrieving application generated data on the local nodes, and primitives for communication among the resources in the computational continuum. Foglets manages the application components on the Fog nodes. Algorithms are presented for launching application components and handling the migration of these components between Fog nodes, based on the mobility pattern of the sensors and the dynamic computational needs of the application. Evaluation results are presented for a Fog network consisting of 16 nodes using a simulated vehicular network as the workload. We show that the discovery and deployment protocol can be executed in 0.93 secs, and joining an already deployed application can be as quick as 65 ms. Also, QoS-sensitive proactive migration can be accomplished in 6 ms.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133037800","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}

引用次数: 169

Automatic learning of predictive rules for complex event processing: doctoral symposium

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933430

Raef Mousheimish, Y. Taher, K. Zeitouni

引用次数: 12

SnappyData: a hybrid system for transactions, analytics, and streaming: demo SnappyData:一个用于事务、分析和流媒体的混合系统:演示

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933295

Jags Ramnarayan, Sudhir Menon, S. Wale, Hemant Bhanawat

引用次数: 7

Frames 帧

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933304

Michael Grossniklaus, D. Maier, James Miller, Sharmadha Moorthy, K. Tufte

引用次数: 25

Experience of event stream processing for top-k queries and dynamic graphs 具有top-k查询和动态图的事件流处理经验

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933516

Joong-Hyun Choi, Kang-Woo Lee, Eun-Sun Cho

引用次数: 0

A policy-based coordination architecture for distributed complex event processing in the internet of things: doctoral symposium 物联网中分布式复杂事件处理的基于策略的协调架构:博士研讨会

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933431

Jorge C. B. Fonseca, C. Ferraz, Kiev Gama

引用次数: 13

Evolving pub/sub subscriptions for multiplayer online games: demo 发展多人在线游戏的pub/sub订阅:演示

Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems Pub Date : 2016-06-13 DOI: 10.1145/2933267.2933297

César Cañas, Kaiwen Zhang, Bettina Kemme, J. Kienzle, H. Jacobsen

{"title":"Evolving pub/sub subscriptions for multiplayer online games: demo","authors":"César Cañas, Kaiwen Zhang, Bettina Kemme, J. Kienzle, H. Jacobsen","doi":"10.1145/2933267.2933297","DOIUrl":"https://doi.org/10.1145/2933267.2933297","url":null,"abstract":"We identify a class of content-based pub/sub applications with highly dynamic subscriptions. This includes location-based notification systems, predictive stock trading, and multiplayer games. The traditional method of handling subscription changes by engaging in expensive re-subscription protocols is inadequate when the workload is sufficiently large. We propose evolving subscriptions as a technique to alleviate the overhead of subscription churn when handling regular patterns of subscription changes. Subscribers express as a function of time the evolution of its subscriptions. The pub/sub brokers can then independently modify the evolving subscriptions without requiring further communication with the subscribers. In this demo, we present our design and implementation for supporting evolving subscriptions in the context of a multiplayer online game. We first show how evolving subscriptions are expressed to the pub/sub system. We then demonstrate its usage with a game client, which displays real-time performance measurements between the regular system and our enhanced version. We show the relative impact of using evolving subscriptions by running different experiments with our game engine.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125822602","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}

引用次数: 2