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 20 for “"automatic parallelization"”.
-
Automatic parallelization of Prolog programs
Prolog has a number of advantages for use in rapid prototyping. The explotation of parallelism holds the promise of making these prototypes directly executable. This dissertation addresses the parallel execution of Prolog programs without restricting the language to a pure subset or requiring user …
-
SUDS : automatic parallelization for raw processors
… System), a compiler and runtime system that can automatically find and exploit the available concurrency of scalar operations in imperative programs with arbitrary unstructured and unpredictable control flow. The core compiler transformation that enables this is scalar queue conversion. Scalar …
-
Symbolic analysis techniques for effective automatic parallelization
Made available in DSpace on 2011-05-07T12:55:55Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624292.pdf: 5755308 bytes, checksum: a606b4b119bd2f869783098a4f5ae735 (MD5) Previous issue date: 1995
-
The interprocedural analysis and automatic parallelization of scheme programs
Restriction data tranferred 2014-07-01T11:21:24-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission
-
Source to source compiler for the automatic parallelization of JavaScript code
… of a source-to-source compiler for the automatic parallelization of JavaScript code. The proposed compiler transforms the input code to an AST (Abstract syntax tree). Afterward, we applied a dependence analysis, followed by fusion and fission techniques. As a later part, new portions of …
-
A domain specific language for facilitating automatic parallelization and placement of SDR patterns into heterogeneous computing architectures
… framework were developed to alleviate these parallelization and optimization processes together with developing execution models for DSP and dataflow models of computation suitable for SDR-specific computations. The OptiSDR target HCAs are composed of graphics processing units (GPUs), …
-
Efficient parallel processing and fault tolerance in a streaming join system
… performance optimizations like batching and automatic parallelization, having performance comparable to lossy windowed joins while maintaining its strong correctness semantics. The individual contributions of the thesis come from further extending RiverJoin by adding functionality required …
-
Extracting Parallelism from Legacy Sequential Code Using Transactional Memory
… decades, there has been a growing interest in automatic parallelization. This is to relieve programmers from the painful and error-prone manual parallelization process, and to cope with new architecture trend of multi-core and many-core CPUs. Automatic parallelization techniques vary in …
-
Parallel sorting and Star-P data movement and tree flattening
… on some systems. The third problem concerns automatic parallelization. By representing a computation as a binary tree, which we assume is given, it can be shown that the height corresponds to the parallel execution time, given enough processors. The main result of the chapter is an algorithm …
-
PetaBricks : a language and compiler for algorithmic choice
… choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking.
-
Theory, Techniques, and Experiments in Solving Recurrences in Computer Programs
The study of theoretical and practical issues in automatic parallelization across application and language boundaries is an appropriate and timely task. In this work, we discuss theory and techniques that we have determined useful in solving recurrences in computer programs. In chapter two we …
-
On Communication-Computation Overlap in High-Performance Computing
… at the end-user level. This is achieved by an automatic run-time tuning of non-blocking collective-communication operations, which allows the communication library to maximize communication-computation overlap, and choose the best performing implementation for a non-blocking-collective …
-
Accelerating Hardware Simulation on Multi-cores
… makes improving its simulation performance via parallelization even more challenging. This work investigates automatic parallelization of simulation algorithms used to simulate hardware models. In particular, we focus on parallelizing the simulation of hardware designs described at the RTL using …
-
Correctness, Precision and Efficiency in the Sharing Analysis of Real Logic Languages
… sharing is important; for instance, for their automatic parallelization and for many optimisations of the unification procedure, such as occurs-check reduction. Because of its usefulness, a considerable amount of research has been done on the design and development of techniques for the static …
-
Autotuning programs with algorithmic choice
… choices. Choices also include different automatic parallelization techniques, data distributions, algorithmic parameters, transformations, and blocking. PetaBricks also introduces novel techniques to autotune algorithms for different convergence criteria or quality of service …
-
Guided Automatic Binary Parallelisation
… expensive task. Without source code, existing automatic performance enhancing and parallelisation techniques are not applicable for legacy software or parts of new applications linked with legacy libraries. In this dissertation, three tools are presented to address the challenge of optimising …
-
Evaluating the Scalability of SDF Single-chip Multiprocessor Architecture Using Automatically Parallelizing Code
… from simpler processors and execute the automatically parallelizing application on the single-chip multiprocessor. SDF has many desirable features such as high throughput, scalability, and low power consumption, which meet the requirements of the next generation of CPU design. Compared …
-
Identifying, Quantifying, Extracting and Enhancing Implicit Parallelism
… burden on the programmers by requiring explicit parallelization for performance. Implicit Parallelization is an alternative that could ease the burden on programmers by parallelizing applications “under the covers” while maintaining sequential semantics externally. This thesis develops a novel …
-
Code Optimization in the Polyhedron Model - Improving the Efficiency of Parallel Loop Nests
A safe basis for automatic loop parallelization is the polyhedron model which represents the iteration domain of a loop nest as a polyhedron in $\mathbb{Z}^n$. However, turning the parallel loop program in the model to efficient code meets with several obstacles, due to which performance may …
-
The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation
… programming; therefore, techniques for automatic parallelisation will become indispensable. We aim at extending the well-known polyhedron model, which promises this automation, beyond some of its current restrictions. Up to now, loop bounds and array subscripts in the modelled codes must …