{"title":"Automating computational placement in IoT environments: doctoral symposium","authors":"Peter Michalák, S. Heaps, M. Trenell, P. Watson","doi":"10.1145/2933267.2933435","DOIUrl":"https://doi.org/10.1145/2933267.2933435","url":null,"abstract":"The growth in the number of Internet of Things (IoT) devices and applications, and an increase in the capabilities of sensors creates an opportunity to optimise IoT applications by partitioning the computation across all components in the processing chain: sensors, field gateways and clouds. This can be done to optimise a range of factors including performance, energy and cost. This paper presents an overview of an optimiser designed to achieve this. It takes as input a high-level, declarative description of the computation, along with a set of non-functional requirements. From this it aims to generate the best deployment plan. The main use case, described in the paper is the use of wearable sensors for the real-time monitoring of the activity and glucose levels of type II diabetes patients. This paper describes the architecture of the optimiser, gives an example of an energy-based cost model, and shows how the approach applies to the diabetes use case.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"137 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":"116529195","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}
{"title":"Smooth and crispy: integrating continuous event proximity calculation and discrete event detection","authors":"Stein Kristiansen, T. Plagemann, V. Goebel","doi":"10.1145/2933267.2933302","DOIUrl":"https://doi.org/10.1145/2933267.2933302","url":null,"abstract":"Using Complex Event Processing for event detection is appealing for emerging applications in home care and health care because hazards and anomalies need to be detected to alarm a care giver as fast as possible. It is important for a care giver to receive alarms if anomalies and hazards are detected. However, false positives and false negatives can imply high costs and it is important to personalize the application for every individual instantiation. We introduce in this paper the concept of Event Proximity (EProx) to address these challenges. EProx quantifies the closeness of the current situation to an event of interest. EProx enables the system and its users to react to anomalies and hazards before they actually happen. We present a template for EProx calculation and exploit a home care use case to explain how the template is instantiated in Esper. We use synthetic activity traces of a care receiver to verify and demonstrate the usefulness of event proximity calculation.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"7 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":"123355164","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}
{"title":"Continuous graph pattern matching over knowledge graph streams","authors":"Syed Gillani, Gauthier Picard, F. Laforest","doi":"10.1145/2933267.2933306","DOIUrl":"https://doi.org/10.1145/2933267.2933306","url":null,"abstract":"Continuous Graph Pattern Matching (CGPM) is an extended version of the traditional GPM that is evaluated over Knowledge Graph (Kg) streams. It comes with additional constraints of scalability and near-to-real-time response, and is used in many applications such as real-time knowledge management, social networks and sensor networks. Hence, existing GPM solutions for static Kgs are not directly applicable in this setting. This paper studies continuous GPM over Kg streams for two different executional models: event-based and incremental. We first propose a query-based graph pruning technique to filter the unnecessary triples from a Kg event. The pruned events are materialized in a set of vertically partitioned tables. We then use a hybrid join-and-explore technique to further prune and finally match the triples within a Kg event. Considering the on-the-fly execution of queries over pruned Kg events, we use an automata-based model to guide the join and exploration process. This leads to an index-free solution optimised for streaming environments. Experimental results with both synthetic and real-world datasets confirm that our system outperforms the state-of-the-art solutions by (on average) one to two orders of magnitude, in terms of performance and scalability.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"1 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":"123792037","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}
Ioannis Flouris, Vasiliki Manikaki, Nikos Giatrakos, Antonios Deligiannakis, M. Garofalakis, M. Mock, Sebastian Bothe, Inna Skarbovsky, Fabiana Fournier, Marko Stajcer, Tomislav Krizan, Jonathan Yom-Tov, Marijo Volarevic
{"title":"Complex event processing over streaming multi-cloud platforms: the FERARI approach: demo","authors":"Ioannis Flouris, Vasiliki Manikaki, Nikos Giatrakos, Antonios Deligiannakis, M. Garofalakis, M. Mock, Sebastian Bothe, Inna Skarbovsky, Fabiana Fournier, Marko Stajcer, Tomislav Krizan, Jonathan Yom-Tov, Marijo Volarevic","doi":"10.1145/2933267.2933289","DOIUrl":"https://doi.org/10.1145/2933267.2933289","url":null,"abstract":"We present FERARI, a prototype for processing voluminous event streams over multi-cloud platforms. At its core, FERARI both exploits the potential for in-situ (intra-cloud) processing and orchestrates inter-cloud complex event detection in a communication-efficient way. At the application level, it includes a user-friendly query authoring tool and an analytics dashboard providing granular reports about detected events. In that, FERARI constitutes, to our knowledge, the first complete end-to-end solution of its kind. In this demo, we apply the FERARI approach on a real scenario from the telecommunication domain.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"1 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":"128569360","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}
{"title":"Placement of distributed stream processing over heterogeneous infrastructures: doctoral symposium","authors":"Matteo Nardelli","doi":"10.1145/2933267.2933432","DOIUrl":"https://doi.org/10.1145/2933267.2933432","url":null,"abstract":"Data Stream Processing (DSP) applications can extract, in a timely manner, valuable information from distributed data sources (e.g., sensing devices, social networks). These applications are subject to unpredictable and varying workloads and have to satisfy strict quality requirements, usually expressed in terms of latency, availability, and throughput. To successfully execute DSP applications, recent trends investigate the possibility of exploiting decentralized computing resources, which nonetheless pose new challenges due to the network and system heterogeneity, geographic distribution, and non-negligible network latencies. The doctorate work, presented in this paper, investigates the deployment of DSP applications with Quality of Service (QoS) requirements over a distributed infrastructure of heterogeneous computing and networking resources. Specifically, to support our study, we extend an open-source DSP system, Apache Storm, by providing mechanisms for executing distributed QoS-aware placement policies and self-adaptation. Then, we provide a general formulation of the optimal placement problem for DSP applications, modeling the heterogeneity of the execution environment. The ongoing research aims at investigating the following directions. First, we will design heuristics able to determine the best placement in a feasible amount of time. Second, we will investigate runtime adaptation strategies and online placement algorithms. Third, to prove the generality of our approach, we will customize the designed solutions for similar problems (e.g., service selection, container deployment).","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"92 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":"125202858","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}
Emanuele Della Valle, Daniele Dell'Aglio, Alessandro Margara
{"title":"Taming velocity and variety simultaneously in big data with stream reasoning: tutorial","authors":"Emanuele Della Valle, Daniele Dell'Aglio, Alessandro Margara","doi":"10.1145/2933267.2933539","DOIUrl":"https://doi.org/10.1145/2933267.2933539","url":null,"abstract":"Many \"big data\" applications must tame velocity (processing data in-motion) and variety (processing many different types of data) simultaneously. The research on knowledge representation and reasoning has focused on the variety of data, devising data representation and processing techniques that promote integration and reasoning on available data to extract implicit information. On the other hand, the event and stream processing community has focused on the velocity of data, producing systems that efficiently operate on streams of data on-the-fly according to pre-deployed processing rules or queries. Several recent works explore the synergy between stream processing and reasoning to fully capture the requirements of modern data intensive applications, thus giving birth to the research domain of stream reasoning. This tutorial paper offers an overview of the theoretical and technological achievements in stream reasoning, highlighting the key benefits and limitations of existing approaches, and discussing the open challenges and the opportunities for future research. The paper mainly targets researchers and practitioners in the area of event and stream processing. The paper aims to stimulate the discussion on stream reasoning and to further promote the integration of reasoning techniques within event and stream processing systems in three ways: (i) by presenting an active research domain, where researchers on event and stream processing can apply their expertise; (ii) by discussing techniques and technologies that can help advancing the state of the art in event and stream processing; (iii) by identifying the open problems in the field of stream reasoning, and drawing attention to promising research directions.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"31 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":"125864160","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}
{"title":"Theory and implementation of a distributed event based platform","authors":"K. Chandy","doi":"10.1145/2933267.2940321","DOIUrl":"https://doi.org/10.1145/2933267.2940321","url":null,"abstract":"This paper presents theory and an implementation of a Distributed Event Based System (DEBS) platform. The theory is based on a simple model that forms the basis of the implementation. Though this paper is about a DEBS platform, a description of the theory and model provides the motivation for the design. Many software libraries operate on \"data at rest', i.e. fixed data structures such as arrays and graphs. By contrast, DEBS systems operate on \"data in motion,\" i.e., data structures that change, in increments, over time. Many software libraries are designed for sequential execution or synchronous parallel execution. By contrast, DEBS systems have multiple agents executing asynchronously. The paper presents sufficient conditions that enable programs operating on data at rest to be reconfigured as networks of asynchronous agents operating on data structures that change incrementally as time progresses. The paper provides a brief description of a DEBS platform, called StreamPy, implemented in Python. StreamPy enables the use of libraries designed to operate on data at rest --- particularly for data analytics, artificial intelligence, and scientific computation --- for data in motion. An event is either defined by a pre-specified pattern or an event is learned from data. Learning what is, and what is not, an event requires the use of machine learning algorithms. A goal of StreamPy is to incorporate machine learning into data streaming to obtain a DEBS platform that learns what is an event and then to continually improve this learning.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"104 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":"126760483","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}
Suad Sejdovic, Yvonne Hegenbarth, Gerald H. Ristow, Roland Schmidt
{"title":"Proactive disruption management system: how not to be surprised by upcoming situations","authors":"Suad Sejdovic, Yvonne Hegenbarth, Gerald H. Ristow, Roland Schmidt","doi":"10.1145/2933267.2933271","DOIUrl":"https://doi.org/10.1145/2933267.2933271","url":null,"abstract":"In most industrial processing scenarios the value of a product increases over time in the value chain. To avoid unnecessary processing steps, it is of immense importance to detect defects as early as possible in the value creating process. These situations of interest can be distinguished as specified and unspecified situations, dependent on whether the cause-effect relation is known and defined or not. In this article we describe ongoing work on a proactive disruption management system for manufacturing environments, which helps being prepared for the unexpected by applying a combination of unsupervised and supervised machine learning for the identification and prediction of unspecified situations and adopting data mining techniques to derive predictive patterns for specified situations. We also introduce a real-world use case from the field of semiconductor manufacturing and present first preliminary results.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"2 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":"133950633","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}
O. Etzion, Fabiana Fournier, Inna Skarbovsky, B. Halle
{"title":"A model driven approach for event processing applications","authors":"O. Etzion, Fabiana Fournier, Inna Skarbovsky, B. Halle","doi":"10.1145/2933267.2933268","DOIUrl":"https://doi.org/10.1145/2933267.2933268","url":null,"abstract":"This paper presents The Event Model (TEM) as a means to design, develop, implement, and maintain event-driven applications. The friendly, yet rigorous, representation of the event logic in Excel-like tables makes the model accessible to people lacking IT skills. The Event Model follows the model driven engineering approach and can be classified as a CIM (Computation Independent Model). The goal is to strive for automatic transformation along with the model driven engineering. In this paper we provide a methodology to transform the CIM into a running event driven application. We demonstrate our methodology using an example taken from mobile phone fraud detection.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"34 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":"134069203","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}
A. Koliousis, M. Weidlich, R. Fernandez, A. Wolf, Paolo Costa, P. Pietzuch
{"title":"The SABER system for window-based hybrid stream processing with GPGPUs: demo","authors":"A. Koliousis, M. Weidlich, R. Fernandez, A. Wolf, Paolo Costa, P. Pietzuch","doi":"10.1145/2933267.2933291","DOIUrl":"https://doi.org/10.1145/2933267.2933291","url":null,"abstract":"Heterogeneous architectures that combine multi-core CPUs with many-core GPGPUs have the potential to improve the performance of data-intensive stream processing applications. Yet, a stream processing engine must execute streaming SQL queries with sufficient data-parallelism to fully utilise the available heterogeneous processors, and decide how to use each processor in the most effective way. Addressing these challenges, we demonstrate Saber, a hybrid high-performance relational stream processing engine for CPUs and GPGPUs. Saber executes window-based streaming SQL queries in a data-parallel fashion and employs an adaptive scheduling strategy to balance the load on the different types of processors. To hide data movement costs, Saber pipelines the transfer of stream data between CPU and GPGPU memory. In this paper, we review the design principles of Saber in terms of its hybrid stream processing model and its architecture for query execution. We also present a web front-end that monitors processing throughput.","PeriodicalId":277061,"journal":{"name":"Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems","volume":"104 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":"132182471","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}