A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems

  • Authors:
  • Durga Prasad Mohapatra;Rajib Mall;Rajeev Kumar

  • Affiliations:
  • Department of CSE, National Institute of Technology, Rourkela 769008, Orissa, India.;Department of CSE, Indian Institute of Technology, Kharagpur, WB 721302, India.;Department of CSE, Indian Institute of Technology, Kharagpur, WB 721302, India

  • Venue:
  • International Journal of Information and Communication Technology
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a parallel algorithm for dynamic slicing of distributed Java programs in non-Distributed Shared Memory (DSM) systems. Given a distributed Java program, we first construct an intermediate representation in the form of a Distributed Program Dependence Graph (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, so that each node in the network contributes to the dynamic slice by computing its local portion of the global slice in a fully distributed fashion.