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 93 for “"Parallel programming (Computer science)"”.

  1. A SequenceL interpreter using tuplespaces

    SequenceL is an implicitly parallelizing language that determines all the parallelisms in a computer program. This thesis is a preliminary investigation into a Tuple space based implementation of SequenceL. The results of the research are: • Tuple space was identified as a simple and straight …

    ttu Repository record for A SequenceL interpreter using tuplespaces (opens in a new tab)

  2. Indexical parallel programming

    Indexical programming means programming languages and/or computational models based on indexical logic and possible world semantics. Indexical languages can be considered as the result of enriching conventional languages by allowing constructs to vary according to an implicit context or index. …

    uvic Repository record for Indexical parallel programming (opens in a new tab)

  3. Par: An approach to architecture-independent parallel programming.

    … the problem of writing portable programs for parallel computers, including shared memory, distributed, and non-uniform memory access architectures. The basis of our approach is to separate the expression of the algorithm from the machine-dependent details that are necessary to achieve good …

    arizona-thes Repository record for Par: An approach to architecture-independent parallel programming. (opens in a new tab)

  4. Explicit parallel programming

    While many parallel programming languages exist, they rarely address programming languages from the issue of communication (implying expressability, and readability). A new language called Explicit Parallel Programming (EPP), attempts to provide this quality by separating the responsibility for the …

    vt Repository record for Explicit parallel programming (opens in a new tab)

  5. Problem specific environments for parallel scientific computing

    Parallelism is one of the key components of large scale, high performance computing. Extensive use of parallelism has yielded a tremendous increase in the raw processing speed of high performance systems, but parallel problem solving remains difficult. These difficulties are typically solved by …

    vt Repository record for Problem specific environments for parallel scientific computing (opens in a new tab)

  6. Chitra: a visualization system to analyze the dynamics of parallel programs

    … is gaining popularity in the field of Computer Science, especially in areas such as performance evaluation and program animation. In this thesis, we explore the possibility of using visualization to analyze parallel program dynamics. We have developed a visualization system, Chitra for …

    vt Repository record for Chitra: a visualization system to analyze the dynamics of parallel programs (opens in a new tab)

  7. Time-parallelisation techniques with applications to plasma simulation

    <p>Parallel-in-time (PinT) methods have become an increasingly popular tool in the numerical solution of time-dependent Partial Differential Equations (PDEs), in light of their potential for extracting additional concurrency when spatial parallelism saturates. Particularly complex applications, …

    oxford Repository record for Time-parallelisation techniques with applications to plasma simulation (opens in a new tab)

  8. Supporting fault-tolerant parallel programming in Linda.

    As people are becoming increasingly dependent on computerized systems, the need for these systems to be dependable is also increasing. However, programming dependable systems is difficult, especially when parallelism is involved. This is due in part to the fact that very few high-level programming …

    arizona-thes Repository record for Supporting fault-tolerant parallel programming in Linda. (opens in a new tab)

  9. Pointer analysis : building a foundation for effective program analysis

    … and model checking, optimization and parallelization, program understanding, hardware synthesis, and more. In this thesis we present a suite of new algorithms aimed at improving pointer analysis scalability. These new algorithms make inclusion-based analysis (the most precise flow- and …

    texas Repository record for Pointer analysis : building a foundation for effective program analysis (opens in a new tab)

Page 1 of 5