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 17 of 17 for “"Data dependence"”.

  1. Modeling Temporal and Spatial Data Dependence with Bayesian Nonparametrics

    <p>In this thesis, temporal and spatial dependence are considered within nonparametric priors to help infer patterns, clusters or segments in data. In traditional nonparametric mixture models, observations are usually assumed exchangeable, even though dependence often exists associated with the …

    duke Repository record for Modeling Temporal and Spatial Data Dependence with Bayesian Nonparametrics (opens in a new tab)

  2. Intraprocedural and interprocedural data dependence analysis for parallel computing

    Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:35Z Item is restricted indefinitely.

    uiuc Repository record for Intraprocedural and interprocedural data dependence analysis for parallel computing (opens in a new tab)

  3. The dependence analysis and synchronization of parallel programs

    … requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha and Snir investigated the problem for straight-line code with data accesses performed on scalars. We extend their results to programs …

    uiuc Repository record for The dependence analysis and synchronization of parallel programs (opens in a new tab)

  4. 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 …

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

  5. Architectural Support for Scalable Speculative Parallelization in Shared -Memory Multiprocessors

    … to reduce the cost of handling cross-thread data dependence violations: run-time learning. Using a new module called the Violation Prediction Table, the hardware learns to stall a thread when it seems likely to trigger a squash, and to release it when it is unlikely to trigger one. …

    uiuc Repository record for Architectural Support for Scalable Speculative Parallelization in Shared -Memory Multiprocessors (opens in a new tab)

  6. Compiler Memory Management and Compound Function Definition for Multiprocessors

    The first part of this thesis deals with managing data in the multi-level memories of a tightly-coupled multiprocessor. One of the problems with this type of multiprocessor is the slow global memory. We examine how a compiler can use data dependence information to determine how data is used in a …

    uiuc Repository record for Compiler Memory Management and Compound Function Definition for Multiprocessors (opens in a new tab)

  7. Algorithms for automatic parallelism, optimization, and optimal processor utilization

    … solution. Currently, compilers that find a data dependence between two statements in a loop do not parallelize the loop. Next we investigate automatic parallelism for these loops by breaking the loop into a set of smaller loops, each of which contains no dependencies and thus can be executed …

    unlv Repository record for Algorithms for automatic parallelism, optimization, and optimal processor utilization (opens in a new tab)

  8. Run-time parallelization: A framework for parallel computation

    … memory access pattern of the program is input data dependent, then static data dependence analysis and consequently parallelization is impossible. Moreover, in this case the compiler cannot apply privatization and reduction parallelization, the transformations that have been proven to be the …

    uiuc Repository record for Run-time parallelization: A framework for parallel computation (opens in a new tab)

  9. Versioning for the Haystack system

    … the repository. The hope is that this additional data will help the user when searching their repository. A person's sense of time and data dependence is a strong organizing princple that can help them locate a file simply because they remember when or why they archived it, or perhaps when they …

    mit Repository record for Versioning for the Haystack system (opens in a new tab)

  10. Predicting execution behavior for codesign synthesis using static analysis

    … of the code using the chosen input set and is data-dependent. Moreover, gathering profile data might not be possible in some environments. This thesis describes a methodology to perform static analysis of the program, generates an annotated flow graph depicting the control and data dependence

    vt Repository record for Predicting execution behavior for codesign synthesis using static analysis (opens in a new tab)

  11. Executables from Program Slices for Java Programs

    … static SSA slicer to efficiently track non-SSA data dependence, and couple this component with our executable slicer backend. We evaluate our slicer extension and find that it produces accurate executable slices for all programs that fall within the limitations of the WALA SSA slicer itself. Our …

    ku Repository record for Executables from Program Slices for Java Programs (opens in a new tab)

  12. Fast offset compensation for a 10Gbps limit amplifier

    … output jitter. Therefore, current high-speed data-link systems suffer from extremely long offset compensation loop settling times in order to satisfy the strict protocol jitter specifications. In the proposed system, the new CMOS peak detector design is the enabling component that allows us …

    mit Repository record for Fast offset compensation for a 10Gbps limit amplifier (opens in a new tab)

  13. Furthering Datalog in the pursuit of program analysis

    … analyses in a declarative language, namely Datalog. This work contains three contributions: expanding the number of programs Datalog, specifically Soufflé (a superset of Datalog), can support; providing a declarative implementation of a well-known analysis; and introducing a new program …

    cambridge Repository record for Furthering Datalog in the pursuit of program analysis (opens in a new tab)

  14. Statistical inference from dependent data : networks and Markov chains

    … often, due to the process according to which data is collected, the samples in a dataset have implicit correlations amongst them. Such correlations are commonly ignored as a first approximation when trying to analyze statistical and computational aspects of an inference task. In this thesis, …

    mit Repository record for Statistical inference from dependent data : networks and Markov chains (opens in a new tab)

  15. Scalable and Broad Hardware Acceleration through Practical Speculative Parallelism

    … during execution, i.e., if it may violate a data dependence, then it is aborted and re-executed. This thesis proposes Chronos, a framework-based approach for building accelerators that use speculation to extract parallelism. Under Chronos, accelerator designers express the algorithm as a set …

    mit Repository record for Scalable and Broad Hardware Acceleration through Practical Speculative Parallelism (opens in a new tab)

  16. TOMOGRAPHIC IMAGE RECONSTRUCTION: IMPLEMENTATION, OPTIMIZATION AND COMPARISON IN DIGITAL BREAST TOMOSYNTHESIS

    … of statistical IR to tomosynthesis imaging data to demonstrate significant image quality improvement over conventional techniques. These techniques include the physical modeling with a local voxel-pair based prior with the flexibility in its parameters to fine-tune image quality, the …

    siu-theses Repository record for TOMOGRAPHIC IMAGE RECONSTRUCTION: IMPLEMENTATION, OPTIMIZATION AND COMPARISON IN DIGITAL BREAST TOMOSYNTHESIS (opens in a new tab)

  17. Scalable and flexible bulk architecture

    … with cross-processor write-after-write (WAW) dependences between them cannot commit concurrently; one squashes the other, even though these are name dependences. To solve the first problem, I propose the IntelliCommit protocol, where a commit grabs all the relevant directory modules in …

    uiuc Repository record for Scalable and flexible bulk architecture (opens in a new tab)