paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Dads: dynamic slicing continuously-running distributed programs with budget constraints

Dads:面向持续运行分布式程序的预算约束动态切片
FSE Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering2020匹配度 4/10 · 论文属于程序分析中的动态切片,并用强化学习在线调整分析配置,与“AI→PL/机器学习改进程序分析”有轻微交叉;但它不是面向 LLM/Agentic 程序的静态分析,也不涉及浮点程序分析或贝叶斯程序分析等核心方向。引用 11 inbox
Xiaoqin Fu, Haipeng Cai, Li Li
crossref: 2026-09-12

AI 速览

一句话:提出首个面向持续运行分布式程序、支持预算约束的分布式在线动态切片器 Dads。

论文针对持续运行的分布式程序,提出动态切片器 Dads。现有动态切片在分布式与长期运行场景下难以兼顾可扩展性、在线分析与成本效益。Dads 按分布式架构设计以利用分布式并行资源,并通过在线分析避免记录执行轨迹,从而节省时间与空间开销。其关键机制是利用强化学习,根据用户给定的分析时间预算持续自动调整分析算法配置,以维持实用的可扩展性与成本效益折衷。作者在八个真实 Java 分布式系统上开展实证评估,展示了 Dads 的可扩展性与成本效益优势。该工具已开源并提供演示视频。

问题
持续运行的分布式程序难以进行可扩展且成本可控的动态切片,尤其还需满足用户指定的分析预算约束。
方法
Dads 采用分布式架构与在线分析避免轨迹记录,并利用强化学习根据分析时间预算动态调整分析算法配置。
评估
在八个真实 Java 分布式系统上进行实证评估,验证其可扩展性与成本效益;工具已开源并提供演示视频。
原文摘要(Abstract)

We present Dads, the first distributed, online, scalable, and cost-effective dynamic slicer for continuously-running distributed programs with respect to user-specified budget constraints. Dads is distributed by design to exploit distributed and parallel computing resources. With an online analysis, it avoids tracing hence the associated time and space costs. Most importantly, Dads achieves and maintains practical scalability and cost-effectiveness tradeoffs according to a given budget on analysis time by continually and automatically adjusting the configuration of its analysis algorithm on the fly via reinforcement learning. Against eight real-world Java distributed systems, we empirically demonstrated the scalability and cost-effectiveness merits of Dads. The open-source tool package of Dads with a demo video is publicly available.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot5739,
  title = {Dads: dynamic slicing continuously-running distributed programs with budget constraints},
  author = {Xiaoqin Fu and Haipeng Cai and Li Li},
  booktitle = {FSE},
  year = {2020},
  doi = {10.1145/3368089.3417920}
}