Gedik, B.Schneider S.Hirzel M.Wu, Kun-Lung2016-02-082016-02-0820141045-9219http://hdl.handle.net/11693/26675This article addresses the profitability problem associated with auto-parallelization of general-purpose distributed data stream processing applications. Auto-parallelization involves locating regions in the application's data flow graph that can be replicated at run-time to apply data partitioning, in order to achieve scale. In order to make auto-parallelization effective in practice, the profitability question needs to be answered: How many parallel channels provide the best throughput? The answer to this question changes depending on the workload dynamics and resource availability at run-time. In this article, we propose an elastic auto-parallelization solution that can dynamically adjust the number of channels used to achieve high throughput without unnecessarily wasting resources. Most importantly, our solution can handle partitioned stateful operators via run-time state migration, which is fully transparent to the application developers. We provide an implementation and evaluation of the system on an industrial-strength data stream processing platform to validate our solution. © 1990-2012 IEEE.EnglishData stream processingElasticityParallelizationData flow analysisData flow graphsProfitabilityApplication developersAuto-parallelizationData partitioningDistributed data stream processingParallel channelParallelizationsResource availabilityData communication systemsArticle10.1109/TPDS.2013.295