2018 · 13 citations · 25 references
ComputingComputer ScienceComputer SystemsCloud InfrastructureDistributed SystemsQueuing TheoryCloud Resource ManagementDistributed Data ProcessingDistributed Systems PerformancePerformance Bottleneck AnalysisPerformance ModelingStream ProcessingCloud Computing ResourcesCloud Performance BenchmarkingData Stream ProcessingDistributed Stream ProcessingReal-time Performance AnalysisReal-time Systems PerformanceStream Processing PerformanceSystem Stability
Real‑time data processing is essential, yet building large‑scale distributed stream systems is complex, with challenges in performance, cost, and outage impact. The study evaluates cloud‑based stream processing performance by examining back‑pressure and expected utilization. Using a queueing‑theory algorithm, the authors predict throughput and latency across different VM resources, a method applicable to frameworks such as Apache Storm and Heron for large‑scale, long‑running jobs. Benchmarking on the Australian Nectar cloud demonstrates effective utilization and provides a detailed performance analysis.
Real-time data processing is often a necessity as it can provide insights that have less value if discovered off-line or after the fact. However, large-scale stream processing systems are non-trivial to build and deploy. While there are many frameworks that allow users to create large-scale distributed systems, there remains many challenges in understanding the performance, cost of deployment and considerations and impact of potential (partial) outages on real-time systems performance. Our work considers the performance of Cloud-based stream processing systems in terms of back-pressure and expected utilization. The performance of an exemplar stream application is explored using different Cloud-based virtual machine resources and where the scale of deployment and cost benefits are taken into consideration in relation to the overall performance. To achieve this, we develop an algorithm based on queueing theory to predict the throughput and latency of stream data processing while supporting system stability. Our methodology for making fundamental measurements is applicable to mainstream stream processing frameworks such as Apache Storm and Heron. The method is especially suitable for large-scale distributed stream processing where jobs can run for extended time periods. We benchmark the performance of the system on the national research cloud of Australia (Nectar), and present a performance analysis based on estimating the overall effective utilization.
25
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Spark: cluster computing with working sets
Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin et al. · 2010 · 4.2K citations
Aurora: a new model and architecture for data stream management
Daniel J. Abadi, Don Carney, Ugur �etintemel et al. · The VLDB Journal · 2003 · 1.5K citations
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Han Hu, Yonggang Wen, Tat‐Seng Chua et al. · IEEE Access · 2014 · 1.1K citations · Full text
S4: Distributed Stream Computing Platform
Leonardo Neumeyer, Bruce Robbins, Anish Nair et al. · 2010 · 905 citations