DSpace@nitr >
National Institue of Technology- Rourkela >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/274

Title: A Parallel Algorithm for Dynamic Slicing of Distributed Java Programs in non-DSM Systems
Authors: Mohapatra, D P
Mall, R
Kumar, R
Keywords: Program Slicing
Program dependance graph
Distributed Programing
Issue Date: 2005
Citation: Proceedings of the 8th International Conference on Information Technology, December 20 -23, 2005, Bhubaneswar, India
Abstract: We propose a parallel algorithm for dynamic slicing of distributed Java programs. 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.
Description: Copyright belongs to CIT'05
URI: http://hdl.handle.net/2080/274
Appears in Collections:Conference Papers

Files in This Item:

File Description SizeFormat
Durga-2005-conf.pdf86KbAdobe PDFView/Open

Show full item record

All items in DSpace are protected by copyright, with all rights reserved.

 

Powered by DSpace Feedback