Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zenglin Pu

dblp:357/3743 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing
distributed stream processing
0.712023
ContTune: Continuous Tuning by Conservative Bayesian Optimization for Distributed Stream Data Processing Systems · Proc. VLDB Endow. 2023
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.712023
ContTune: Continuous Tuning by Conservative Bayesian Optimization for Distributed Stream Data Processing Systems · Proc. VLDB Endow. 2023

Methods — techniques the papers use, named apart from their topics

conservative exploration · 1.3bayesian optimization · 1.3
YearPublicationVenuePosition
2023 ContTune: Continuous Tuning by Conservative Bayesian Optimization for Distributed Stream Data Processing Systems
abstract
The past decade has seen rapid growth of distributed stream data processing systems. Under these systems, a stream application is realized as a Directed Acyclic Graph (DAG) of operators, where the level of parallelism of each operator has a substantial impact on its overall performance. However, finding optimal levels of parallelism remains challenging. Most existing methods are heavily coupled with the topological graph of operators, unable to efficiently tune under-provisioned jobs. They either insufficiently use previous tuning experience by treating successively tuning independently, or explore the configuration space aggressively, violating the Service Level Agreements (SLA). To address the above problems, we propose ContTune, a continuous tuning system for stream applications. It is equipped with a novel Big-small algorithm, in which the Big phase decouples the tuning from the topological graph by decomposing the job tuning problem into sub-problems that can be solved concurrently. We propose a conservative Bayesian Optimization (CBO) technique in the Small phase to speed up the tuning process by utilizing the previous observations. It leverages the state-of-the-art (SOTA) tuning method as conservative exploration to avoid SLA violations. Experimental results show that ContTune reduces up to 60.75% number of reconfigurations under synthetic workloads and up to 57.5% number of reconfigurations under real workloads, compared to the SOTA method DS2.
Jinqing Lian, Xinyi Zhang 0002, Yingxia Shao, Zenglin Pu, Qingfeng Xiang, Yawen Li 0001, Bin Cui 0001
Proc. VLDB Endow.4