CFP last date
22 April 2024
Reseach Article

Survey on Dynamic Slicing over Distributed Computing

Published on September 2015 by Chandra Prakash Gupta, Irfanur Rahman, Rakesh Kumar Ray
International Conference on Emergent Trends in Computing and Communication
Foundation of Computer Science USA
ETCC2015 - Number 1
September 2015
Authors: Chandra Prakash Gupta, Irfanur Rahman, Rakesh Kumar Ray
b9d4674d-5335-4971-ad98-9cfc74290270

Chandra Prakash Gupta, Irfanur Rahman, Rakesh Kumar Ray . Survey on Dynamic Slicing over Distributed Computing. International Conference on Emergent Trends in Computing and Communication. ETCC2015, 1 (September 2015), 39-48.

@article{
author = { Chandra Prakash Gupta, Irfanur Rahman, Rakesh Kumar Ray },
title = { Survey on Dynamic Slicing over Distributed Computing },
journal = { International Conference on Emergent Trends in Computing and Communication },
issue_date = { September 2015 },
volume = { ETCC2015 },
number = { 1 },
month = { September },
year = { 2015 },
issn = 0975-8887,
pages = { 39-48 },
numpages = 10,
url = { /proceedings/etcc2015/number1/22334-4555/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Emergent Trends in Computing and Communication
%A Chandra Prakash Gupta
%A Irfanur Rahman
%A Rakesh Kumar Ray
%T Survey on Dynamic Slicing over Distributed Computing
%J International Conference on Emergent Trends in Computing and Communication
%@ 0975-8887
%V ETCC2015
%N 1
%P 39-48
%D 2015
%I International Journal of Computer Applications
Abstract

In this paper, discussed on dynamic program slicing algorithm which simplifies dependence and discussed the intermediate representation of a dynamic program slicing technique a Concurrent System Dependence Graph (CSDG) and intermediate representation of a distributed Java program in the form of a set of Distributed Program Dependence Graphs (DPDG). The algorithm can run parallel on a network of computers, with each node in the network contributing to the dynamic slice in a fully distributed fashion. The approaches discussed will not require any trace files to be maintained. Another advantage of this approach is that a slice is available even before a request for a slice is made. Analysis of the complexities of both the algorithm for dynamic program slicing technique and distributed dynamic slicing in Java

References
  1. Computing dynamic slices of concurrent object-oriented programs. Durga P. Mohapatra, RajibMalland Rajeev Kumar.
  2. Distributed dynamic slicing of Java programs. Durga P. Mohapatra, Rajjev Kumar, Rajib Mall, D. S. Kumar and MayankBhasin.
  3. E. Duesterwald, R. Gupta, M. Soffa, Volume 757, 1993, pp 497-511,Distributed slicing and partial re-execution for distributed programs.
  4. Mund, G. , Mal , R. , Sarkar, S. , 2002. An efficient dynamic program slicing technique. Information and Software Technology 44, 123–132.
  5. Goswami, D. , Mall, R. , 2002. An efficient method for computing dynamic program slices. Information Processing Letters 81, 111–117.
  6. Distributed slicing and partial re-execution for distributed programs. E. Duesterwald, R. Gupta,M. Soffa.
  7. Dynamic Program Slicing. Hiralal Agrawal, Joseph R. Horgan.
  8. D. P. Mohapatra et al. / The Journal of Systems and Software 79 (2006) 1661–1678 1669.
  9. G. B. Mund, R. Mall, S. Sarkar, Computation of intraprocedural dynamic program slices, Information and Software Technology 45 (2003) 499–512.
Index Terms

Computer Science
Information Sciences

Keywords

Program Slicing Static Slicing Dynamic Slicing Debugging Object-oriented Programs Threads Multithreading Java Distributed Programming Synchronization