1 / 26

Slicing Concurrent Programs

This paper explores the complexities and optimizations of slicing concurrent programs, with a focus on nested threads and interference dependence. It also discusses the limitations of previous solutions.

ppatino
Download Presentation

Slicing Concurrent Programs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Slicing Concurrent Programs S. Ramesh Mangala Gowri Nanda Indian Institute of Technology, Bombay

  2. Organization • Previous work • Nested threads • Threads nested within loops • Complexity and Optimizations

  3. Static Slicing • The Slice of a program with respect to a program point p and a variable x consists of all statements and predicates of the program that might affect the value of x at point p.

  4. Interference dependence : A node S1 is interference dependent on a node S2 if S2 defines a variable v, S1 uses the variable v and S1 and S2 execute in parallel.

  5. Limitations of previous solutions: 1. Nested threads 2. Threads nested within loops

  6. CoAncestor ( i, j ) is defined to be the nearest common ancestor of two parallel executing nodes i and j. CoRegion ( i, j ) is the region enclosed between CoAncestor ( i, j ) and its corresponding coend node.

More Related