Dads: Dynamic slicing continuously-running distributed programs with budget constraints

10Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Fu, X., Cai, H., & Li, L. (2020). Dads: Dynamic slicing continuously-running distributed programs with budget constraints. In ESEC/FSE 2020 - Proceedings of the 28th ACM Joint Meeting European Software Engineering Conference and Symposium on the Foundations of Software Engineering (pp. 1566–1570). Association for Computing Machinery, Inc. https://doi.org/10.1145/3368089.3417920

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free