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 20 of 28 for “"DEPENDENCE GRAPH"”.

  1. 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)

  2. Toward Secure Compartmentalization: Scalable Static Analysis Using Program Dependence Graph

    … coverage, static analysis based upon a Program Dependence Graph (PDG) offers complete coverage of program paths. However, PDG-based static analysis has proven difficult to scale to large software systems. In such systems, PDG queries can require excessive memory and take too long to complete. To …

    rice Repository record for Toward Secure Compartmentalization: Scalable Static Analysis Using Program Dependence Graph (opens in a new tab)

  3. Compiler driver memory system optimization using speculative execution

    … (PEPSE). Towards this, we introduce the Load Dependence Graph (LDG), which is a sub-graph of the traditional Program Dependence Graph(PDG) that computes the address of a load instruction.In the context of data prefetching, we illustrate how PEPSE can accurately predict and effectively prefetch …

    nus Repository record for Compiler driver memory system optimization using speculative execution (opens in a new tab) Download file for Compiler driver memory system optimization using speculative execution (opens in a new tab)

  4. Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems

    … the computation and write program to construct dependence graph explicitly, resulting in programs that are difficult to build, debug and maintain. In this thesis, we repurpose the Hierarchically Tiled Array (HTA) programming model for improving the programmability of the dataflow runtime …

    uiuc Repository record for Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems (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. Understanding and debugging concurrent programs through visualisation

    … and develop concurrent programs through phenomenographic research. The resulting outcome spaces included the students' understandings of tuple spaces, the purpose of a programming assignment and what developing, debugging and testing a concurrent program involves. The outcome spaces included …

    aalto Repository record for Understanding and debugging concurrent programs through visualisation (opens in a new tab)

  7. 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)

  8. Parallelization of ordered irregular algorithms

    … in ordered applications, called the Kinetic Dependence Graph (KDG). We have implemented a high-level user interface for programmers that permits them to write ordered algorithms without needing to understand the Kinetic Dependence Graph or its implementation details. This interface permits …

    texas Repository record for Parallelization of ordered irregular algorithms (opens in a new tab)

  9. An Efficient Framework for Performing Execution-Constraint-Sensitive Transformations That Increase Instruction-Level Parallelism

    … adding extra operations in order to remove those dependences constraining performance. Although aggressive application of these transformations is necessary in order to realize the full performance potential, overly-aggressive application can negate their benefit or even degrade performance. This …

    uiuc Repository record for An Efficient Framework for Performing Execution-Constraint-Sensitive Transformations That Increase Instruction-Level Parallelism (opens in a new tab)

  10. ΑΠΕΙΚΟΝΙΣΗ ΑΛΓΟΡΙΘΜΩΝ ΣΕ LVSI ΑΡΧΙΤΕΚΤΟΝΙΚΕΣ

    … METHODOLOGIES IS THE FORMAL DERIVATION OF THE DEPENDENCE GRAPH OF THE ALGORITHM. THEN, THE DERIVED GRAPH IS MAPPED TO HARDWARE VARIOUS TOPOLOGIES OF ARCHITECTURES, E.G., LINEAR, TWO-DIMENSIONAL, GROUPED ARRAYS. DUE TO THE PLETHORA OF ALTERNATIVES ARCHITECTURES, A DESIGNER CAN CHOOSE EASILY THAT …

    greece Repository record for ΑΠΕΙΚΟΝΙΣΗ ΑΛΓΟΡΙΘΜΩΝ ΣΕ LVSI ΑΡΧΙΤΕΚΤΟΝΙΚΕΣ (opens in a new tab)

  11. 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)

  12. 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)

  13. Quality-based content delivery in internet

    … research. In this thesis, a "Chunk-Level Latency Dependence Model" (C-LDP) is firstly defined for better modeling of today's Internet content delivery process. Based on this model, Object Declaration and Page Structure Table mechanisms are suggested to improve the content delivery. Transformation …

    nus Repository record for Quality-based content delivery in internet (opens in a new tab) Download file for Quality-based content delivery in internet (opens in a new tab)

  14. On the Effectiveness of Source Throttling for Networks-on-Chip in Chip Multiprocessor Designs

    … communication requests, and (3) the width of the dependence graph must be sufficiently large. The second part is full system simulations on public benchmark suites. Source throttling does not bring benefit for these relative realistic cases. Further experiment reveals that the aforementioned …

    tamu Repository record for On the Effectiveness of Source Throttling for Networks-on-Chip in Chip Multiprocessor Designs (opens in a new tab)

  15. A Regression Test Selection Technique for Graphical User Interfaces

    … about those techniques to be applied for the Graphical User Interfaces (GUIs). This thesis addresses the gap. GUIs have characteristics different from traditional software, and the conventional testing techniques do not directly apply to GUIs. Unlike most previous techniques for selective …

    ku Repository record for A Regression Test Selection Technique for Graphical User Interfaces (opens in a new tab)

  16. IEGen: semi-automatic generation of inspectors and executors

    … representation (IR) called an Inspector Dependence Graph (IDG), a method for code generation of inspectors based on an IDG, a method for code generation of executors, and techniques for manipulating affine constraints with uninterpreted function symbol (UFS) expressions to enable code …

    colostate Repository record for IEGen: semi-automatic generation of inspectors and executors (opens in a new tab)

  17. 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)

  18. Towards Making JavaScript Applications Secure and Private

    … static analysis approach to generate a novel graph structure, named Object Dependence Graph (ODG), to address the server-side vulnerability detection challenges, and a cross-browser fingerprinting method that utilizes multiple novel OS and hardware level features to solve the client-side …

    jhu Repository record for Towards Making JavaScript Applications Secure and Private (opens in a new tab)

  19. An exploratory study of socio-technical congruence in an ecosystem of software developers

    … by another project, we say there is a technical dependence between the projects. The socio-technical congruence literature suggests that when there is a technical dependence there may need to be a social dependence. We investigate the alignment between social interactions and technical dependence …

    ubc Repository record for An exploratory study of socio-technical congruence in an ecosystem of software developers (opens in a new tab) Download PDF for An exploratory study of socio-technical congruence in an ecosystem of software developers (opens in a new tab)

Page 1 of 2