Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 15 of 15 for “"Dependence Graphs"”.

  1. Semantic program dependence graphs

    Semantic program dependence graphs, or semantic pdgs, are an attractive intermediate program representation for use in advanced optimizing and parallelizing compilers. The semantic pdg, which is based on the program dependence graph, has a compositional semantics that provides an elegant …

    rice Repository record for Semantic program dependence graphs (opens in a new tab)

  2. Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints

    … a method of detecting clones using a program dependence graph and subgraph isomorphism to identify similar subgraphs, ultimately illuminating clones. The project imposes few constraints when comparing code segments to potentially reveal more clones.

    calpoly Repository record for Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints (opens in a new tab)

  3. Processor parallelism considerations and memory latency reduction in shared memory multiprocessors

    … the maximum speedup for a loop with a cyclic dependence graph is limited by its critical dependence ratio, independent of the number of iterations in the loop. The fine-grained processors are better suited for executing these loops with cyclic dependence graphs, while the multiprocessor has …

    uiuc Repository record for Processor parallelism considerations and memory latency reduction in shared memory multiprocessors (opens in a new tab)

  4. Optimistic computation

    … verified. We model computations by their program dependence graphs, then present a series of application-independent transformations on the dependence graphs that convert pessimistic computations into semantically equivalent optimistic computations. We demonstrate the viability of this approach by …

    rice Repository record for Optimistic computation (opens in a new tab)

  5. The exploitation of pipeline parallelism by compile time dataflow analysis

    … of resource conflicts is accomplished with data dependence analysis, while the elimination of resource conflicts is accomplished by instruction stream code transformation. The transformation of instruction streams is guided by data dependence analysis, and dependence graphs. This thesis is based …

    unlv Repository record for The exploitation of pipeline parallelism by compile time dataflow analysis (opens in a new tab) Download PDF for The exploitation of pipeline parallelism by compile time dataflow analysis (opens in a new tab)

  6. Fault Location via Precise Dynamic Slicing

    … value through a chain of data and/or control dependences. However, the challenge of making precise dynamic slicing practical has not been addressed. This dissertation addresses this challenge and makes precise dynamic slicing useful for debugging realistic applications. First, the cost of …

    arizona-thes Repository record for Fault Location via Precise Dynamic Slicing (opens in a new tab)

  7. Scheduling in STAPL

    … STAPL algorithms are written in terms of PARAGRAPHs which are high level descriptions of task dependence graphs. Scheduling plays a very important role in the efficient execution of parallel programs. In this thesis, we present our work to enable efficient scheduling of parallel programs …

    tamu Repository record for Scheduling in STAPL (opens in a new tab)

  8. Interprocedural symbolic analysis

    … gives 0 to 39 percent reductions in array dependences at call sites, with 10 to 25 percent increases in analysis time. Symbolic analysis is essential to data dependence testing, array section analysis, and other high-level program manipulations. We give methods for building symbolic …

    rice Repository record for Interprocedural symbolic analysis (opens in a new tab)

  9. Optimized Event-Driven Runtime Systems for Programmability and Performance

    … for example by introducing unnecessary dependences. In addition, some of these models, like MPI, have a performance model which thinly veils a particular machine's parameters from the problem that is to be solved. We postulate that an expressive parallel programming model should not …

    rice Repository record for Optimized Event-Driven Runtime Systems for Programmability and Performance (opens in a new tab)

  10. Enhancing a Scalable, Lexical Search Tool via Integration with a Semantically-Based Analysis Engine

    … and traversal of modularized program dependence graphs (mPDGs) without tightly coupling ModCP to the existing industrial codebase. In addition, this research introduces a multi-strategy framework that maps structural software metrics to Agile story points. Users can select among …

    calgary Repository record for Enhancing a Scalable, Lexical Search Tool via Integration with a Semantically-Based Analysis Engine (opens in a new tab)

  11. A Lightweight Technique for Detecting Semantic Conflicts with Static Analysis

    … whereas configurations that combine program dependence information with data-flow analysis achieve higher recall. Finally, we performed an empirical comparison between lightweight static analyses and analyses based on System Dependence Graphs (SDGs), with the goal of characterizing their …

    brazil-ufpe Repository record for A Lightweight Technique for Detecting Semantic Conflicts with Static Analysis (opens in a new tab)

  12. A Sparse Program Dependence Graph For Object Oriented Programming Languages

    The Program Dependence Graph (PDG) has achieved widespread acceptance as a useful tool for software engineering, program analysis, and automated compiler optimizations. This thesis presents the Sparse Object Oriented Program Dependence Graph (SOOPDG), a formalism that contains elements of …

    ucf Repository record for A Sparse Program Dependence Graph For Object Oriented Programming Languages (opens in a new tab)