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

Full metadata record

DC FieldValueLanguage
contributor.authorMohapatra, D P-
contributor.authorMall, R-
contributor.authorKumar, R-
identifier.citationProceedings of the 8th International Conference on Information Technology, December 20 -23, 2005, Bhubaneswar, Indiaen
descriptionCopyright belongs to CIT'05en
description.abstractWe 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.en
format.extent88127 bytes-
subjectProgram Slicingen
subjectProgram dependance graphen
subjectDistributed Programingen
titleA Parallel Algorithm for Dynamic Slicing of Distributed Java Programs in non-DSM Systemsen
Appears in Collections:Conference Papers

Files in This Item:

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

Show simple item record

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


Powered by DSpace Feedback