Blog
About

6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Model-Free Control for Distributed Stream Data Processing using Deep Reinforcement Learning

      Preprint

      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In this paper, we focus on general-purpose Distributed Stream Data Processing Systems (DSDPSs), which deal with processing of unbounded streams of continuous data at scale distributedly in real or near-real time. A fundamental problem in a DSDPS is the scheduling problem with the objective of minimizing average end-to-end tuple processing time. A widely-used solution is to distribute workload evenly over machines in the cluster in a round-robin manner, which is obviously not efficient due to lack of consideration for communication delay. Model-based approaches do not work well either due to the high complexity of the system environment. We aim to develop a novel model-free approach that can learn to well control a DSDPS from its experience rather than accurate and mathematically solvable system models, just as a human learns a skill (such as cooking, driving, swimming, etc). Specifically, we, for the first time, propose to leverage emerging Deep Reinforcement Learning (DRL) for enabling model-free control in DSDPSs; and present design, implementation and evaluation of a novel and highly effective DRL-based control framework, which minimizes average end-to-end tuple processing time by jointly learning the system environment via collecting very limited runtime statistics data and making decisions under the guidance of powerful Deep Neural Networks. To validate and evaluate the proposed framework, we implemented it based on a widely-used DSDPS, Apache Storm, and tested it with three representative applications. Extensive experimental results show 1) Compared to Storm's default scheduler and the state-of-the-art model-based method, the proposed framework reduces average tuple processing by 33.5% and 14.0% respectively on average. 2) The proposed framework can quickly reach a good scheduling solution during online learning, which justifies its practicability for online control in DSDPSs.

          Related collections

          Most cited references 8

          • Record: found
          • Abstract: not found
          • Article: not found

          Determining the initial states in forward-backward filtering

           F. Gustafsson (1996)
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Adaptive online scheduling in storm

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Performance modeling of distributed and replicated databases

               M. Jarke,  M. Nicola (2000)
                Bookmark

                Author and article information

                Journal
                02 March 2018
                Article
                10.14778/3184470.3184474
                1803.01016

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                Custom metadata
                14 pages, this paper has been accepted by VLDB 2018
                cs.DC cs.AI

                Comments

                Comment on this article