Composing high-level stream processing pipelines

被引:0
|
作者
Tanmaya Mahapatra
机构
[1] Technical University of Munich,
[2] Software and Systems Engineering Research Group,undefined
[3] Technical University of Munich,undefined
[4] School of Medicine,undefined
[5] Institute of Medical Informatics,undefined
[6] Statistics and Epidemiology (IMedIS),undefined
来源
关键词
Flow-based programming; Graphical pipelines; Mashup tools; Graphical stream processing; Stream analytics; End-user programming; Data Analytics as a Service (DAaaS); Data Analytics Applications (DAAs);
D O I
暂无
中图分类号
学科分类号
摘要
The growing number of Internet of Things (IoT) devices provide a massive pool of sensing data. However, turning data into actionable insights is not a trivial task, especially in the context of IoT, where application development itself is complex. The process entails working with heterogeneous devices via various communication protocols to co-ordinate and fetch datasets, followed by a series of data transformations. Graphical mashup tools, based on the principles of flow-based programming paradigm, operating at a higher-level of abstraction are in widespread use to support rapid prototyping of IoT applications. Nevertheless, the current state-of-the-art mashup tools suffer from several architectural limitations which prevent composing in-flow data analytics pipelines. In response to this, the paper contributes by (i) designing novel flow-based programming concepts based on the actor model to support data analytics pipelines in mashup tools, prototyping the ideas in a new mashup tool called aFlux and providing a detailed comparison with the existing state-of-the-art and (ii) enabling easy prototyping of streaming applications in mashup tools by abstracting the behavioural configurations of stream processing via graphical flows and validating the ease as well as the effectiveness of composing stream processing pipelines from an end-user perspective in a traffic simulation scenario.
引用
收藏
相关论文
共 50 条
  • [21] QUICK PIPING:: A fast, high-level model for describing processor pipelines
    Milner, CW
    Davidson, JW
    ACM SIGPLAN NOTICES, 2002, 37 (07) : 175 - 184
  • [22] High-Level Stream Parallelism Abstractions with SPar Targeting GPUs
    Rockenbach, Dinei A.
    Griebler, Dalvan
    Danelutto, Marco
    Fernandes, Luiz G.
    PARALLEL COMPUTING: TECHNOLOGY TRENDS, 2020, 36 : 543 - 552
  • [23] RunStream: A High-Level Rapid Prototyping Framework for Stream Ciphers
    Khalid, Ayesha
    Paul, Goutam
    Chattopadhyay, Anupam
    Abediostad, Faezeh
    Din, Syed Imad Ud
    Hassan, Muhammad
    Biswas, Baishik
    Ravi, Prasanna
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2016, 15 (03)
  • [24] Neuropsychological evidence of high-level processing in binocular rivalry
    Daini, Roberta
    Facchin, Alessio
    Bignotti, Marco
    Lentini, Cristina
    Peverelli, Milena
    O'Shea, Robert P.
    Molteni, Franco
    BEHAVIOURAL NEUROLOGY, 2010, 23 (04) : 233 - 235
  • [25] High-level aftereffects in visual processing of complex images
    Daelli, V.
    van Rijsbergen, N.
    Treves, A.
    PERCEPTION, 2007, 36 : 99 - 99
  • [26] A HIGH-LEVEL LANGUAGE FOR PARALLEL IMAGE-PROCESSING
    BROWN, J
    CROOKES, D
    IMAGE AND VISION COMPUTING, 1994, 12 (02) : 67 - 79
  • [27] Ultrafilter conditions for high-level waste sludge processing
    Geeting, J. G. H.
    Hallen, R. T.
    Peterson, R. A.
    SEPARATION SCIENCE AND TECHNOLOGY, 2006, 41 (11) : 2313 - 2324
  • [28] Parallel processing in high-level categorization of natural images
    Guillaume A. Rousselet
    Michèle Fabre-Thorpe
    Simon J. Thorpe
    Nature Neuroscience, 2002, 5 : 629 - 630
  • [29] Parallel high-level image processing on a standard PC
    Ercan, MF
    Fung, YF
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 1, PROCEEDINGS, 2003, 2667 : 752 - 760
  • [30] High-Level Programming Abstractions for Distributed Graph Processing
    Kalavri, Vasiliki
    Vlassov, Vladimir
    Haridi, Seif
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (02) : 305 - 324