Authors: Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
Addresses: 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
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.
Keywords: program slicing; program dependence graphs; distributed programming; message passing; non-distributed shared memory systems; distributed shared memory; DSM; non-DSM; distributed Java; networking; networks; ICT.
International Journal of Information and Communication Technology, 2007 Vol.1 No.1, pp.38 - 49
Available online: 19 Apr 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article