A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems. (20th April 2007)

• Record Type: Journal Article
• Authors: Mohapatra, Durga Prasad; Mall, Rajib; Kumar, Rajeev
• Is Part Of: International journal of information and communication technology. Volume 1:Number 1(2007)
• Page Start: 38
• Page End: 49
• Publication Date: 2007-04-20
• Subjects: 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; Information technology -- Periodicals; Computer science -- Periodicals; Telecommunication -- Periodicals; 004.05
• Languages: English
• ISSNs: 1466-6642

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.