Distributed dynamic slicing of Java programs
Distributed dynamic slicing of Java programs
复制标题
Java程序的分布式动态切片
DOI：
10.1016/j.jss.2006.01.009
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Mayank Bhasin
中科院分区：
文献类型：
--
作者：
D. Mohapatra;Rajeev Kumar;R. Mall;Dr.M.Senthil Kumar;Mayank Bhasin
提出了一种新的分布式Java程序动态切片技术。我们首先以一组分布式程序依赖图(DPDG)的形式构造分布式Java程序的中间表示。当依赖项在运行时出现和停止时，我们适当地标记和取消标记DPDG的边缘。我们的算法可以在计算机网络上并行运行，网络中的每个节点以完全分布式的方式对动态切片做出贡献。我们的方法不需要维护任何跟踪文件。我们方法的另一个优点是，切片甚至在请求切片之前就已可用。这显著减少了切片命令的响应时间。我们已经在分布式环境中实现了该算法。从我们的实验中获得的结果是有希望的。
We propose a novel dynamic slicing technique for distributed Java programs. We first construct the intermediate representation of a distributed Java program in the form of a set of Distributed Program Dependence Graphs (DPDG). We mark and unmark the edges of the DPDG appropriately as and when dependencies arise and cease during run-time. Our algorithm can run parallely on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. Our approach does not require any trace files to be maintained. Another advantage of our approach is that a slice is available even before a request for a slice is made. This appreciably reduces the response time of slicing commands. We have implemented the algorithm in a distributed environment. The results obtained from our experiments show promise.