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

Mengna Su

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 62% Cloud and datacenter computing · 38%
Artificial intelligence
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination and fault tolerance
0.612022
NENYA: Cascade Reinforcement Learning for Cost-Aware Failure Mitigation at Microsoft 365 · KDD 2022
Cloud and datacenter computing
cluster resource management and scheduling
0.212022
NENYA: Cascade Reinforcement Learning for Cost-Aware Failure Mitigation at Microsoft 365 · KDD 2022
Cloud and datacenter computing › job scheduling › economic scheduling
cost-aware scheduling
0.212022
NENYA: Cascade Reinforcement Learning for Cost-Aware Failure Mitigation at Microsoft 365 · KDD 2022

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

reinforcement learning · 1.1cascade decision structure · 1.1bandit learning · 1.1
YearPublicationVenuePosition
2022 NENYA: Cascade Reinforcement Learning for Cost-Aware Failure Mitigation at Microsoft 365
abstract
Large-scale distributed systems, such as Microsoft 365's database system, require timely mitigation solutions to address failures and improve service availability and reliability. Still, mitigation actions can be costly as they may cause temporal performance degradation and even incur monetary expenses. Mitigation actions can be either administrated in a reactive fashion to contain detected failures or a proactive fashion to reduce potential failures. The proactive mitigation approach typically relies on a two-stage strategy: the prediction model will firstly identify instances (such as databases or disks) with high failure risk, then appropriate mitigation actions chosen by engineers or an automatic bandit learning model can be applied. As information is not fully shared across those two stages, important factors such as mitigation costs and states of instances are often ignored in one of those two stages. To address these issues, we propose NENYA, an end-to-end mitigation solution for a large-scale database system powered by a novel cascade reinforcement learning model. By taking the states of databases as input, NENYA directly outputs mitigation actions and is optimized based on jointly cumulative feedback on mitigation costs and failure rates. As the overwhelming majority of databases do not require mitigation actions, NENYA utilizes a novel cascade decision structure to firstly reliably filter out such databases and then focus on choosing appropriate mitigation actions for the rest. Extensive offline and online experiments have shown that our methods can outperform existing practices in reducing both failure rates of databases and mitigation costs. NENYA has been integrated into Microsoft 365, a productive platform, with sounding success.
Lu Wang 0029, Pu Zhao 0004, Chuan Luo 0002, Mengna Su, Fangkai Yang, Qingwei Lin, Yingnong Dang, Hongyu Zhang 0002, Saravan Rajmohan, Dongmei Zhang 0001
KDD5