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

Durga Prasad Mohapatra | Zendy; Rajib Mall | Zendy; Rajeev Kumar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Durga Prasad Mohapatra,

Rajib Mall,

Rajeev Kumar

Publication year - 2007

Publication title -

international journal of information and communication technology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.133

H-Index - 11

eISSN - 1741-8070

pISSN - 1466-6642

DOI - 10.1504/ijict.2007.013276

Subject(s) - computer science , java , program slicing , parallel computing , distributed algorithm , slicing , distributed computing , distributed memory , graph , distributed shared memory , node (physics) , construct (python library) , algorithm , theoretical computer science , shared memory , operating system , programming language , memory management , engineering , structural engineering , world wide web , uniform memory access , overlay

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research