A Parallel Algorithm for Dynamic Slicing of Distributed Java Programs in non-DSM Systems

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Mohapatra, Durga Prasad	-
dc.contributor.author	Mall, R	-
dc.contributor.author	Kumar, R	-
dc.date.accessioned	2006-03-29T05:48:44Z	-
dc.date.available	2006-03-29T05:48:44Z	-
dc.date.issued	2005	-
dc.identifier.citation	Proceedings of the 8th International Conference on Information Technology, December 20 -23, 2005, Bhubaneswar, India	en
dc.identifier.uri	http://hdl.handle.net/2080/274	-
dc.description	Copyright belongs to CIT'05	en
dc.description.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.	en
dc.format.extent	88127 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.subject	Program Slicing	en
dc.subject	Program dependance graph	en
dc.subject	Distributed Programing	en
dc.title	A Parallel Algorithm for Dynamic Slicing of Distributed Java Programs in non-DSM Systems	en
dc.type	Article	en
Appears in Collections:	Conference Papers

Files in This Item:

File	Description	Size	Format
Durga-2005-conf.pdf		86.06 kB	Adobe PDF	View/Open