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 287 for “"parallelization"”.
-
Facilitating High Performance Code Parallelization
… spirit of facilitating high performance code parallelization, we present a tool that automatically generates Spark Java code from minimal user-supplied inputs. Spark has emerged as the tool of choice for efficient big data analysis. However, users still have to learn the complicated Spark API …
-
Machine Descriptors of Retargetable Parallelization
… description framework for retargeting compiler parallelization is demonstrated.
-
Parallelization of SIFT on Rigel
With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to …
-
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 …
-
Interprocedural Parallelization Using Memory Classification Analysis
… such as those found in FFT codes. A unified parallelization framework is described, which combines privatization, reduction and induction analysis. Array references using subscripting arrays, such as are found in sparse codes are precisely representable using ARDs, and can sometimes be …
-
SUDS : automatic parallelization for raw processors
A computer can never be too fast or too cheap. Computer systems pervade nearly every aspect of science, engineering, communications and commerce because they perform certain tasks at rates unachievable by any other kind of system built by humans. A computer system's throughput, however, is …
-
On The Parallelization Of Integer Polynomial Multiplication
With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort for taking advantage of those architectures by designing parallel algorithms has been made. To achieve this goal, one needs to consider both algebraic complexity and parallelism, plus making efficient …
-
Parallelization of ECG template-based abnormality detection
In order to develop techniques to predict cardiac arrest, long-term study of electrocardiogram (ECG) data needs to be done to detect changes in electrical activity of diseased hearts. In the past, limitations of computing power and storage space restricted the duration of long-term studies to …
-
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
-
Parallelization of the mosaic image alighment algorithm
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Compiler-Hardware Co-Design for Pervasive Parallelization
Modern computer systems have hundreds of processor cores, so highly parallel programs are critical to achieve high performance. But parallel programming remains difficult on current systems, so many programs are still sequential. This dissertation presents new compilers and hardware architectures …
-
Efficient Parallelization of 2D Ising Spin Systems
The problem of efficient parallelization of 2D Ising spin systems requires realistic algorithmic design and implementation based on an understanding of issues from computer science and statistical physics. In this work, we not only consider fundamental parallel computing issues but also ensure that …
-
Parallelization of dynamic programming recurrences in computational biology
The rapid growth of biosequence databases over the last decade has led to a performance bottleneck in the applications analyzing them. In particular, over the last five years DNA sequencing capacity of next-generation sequencers has been doubling every six months as costs have plummeted. The data …
-
Early Vision Optimization: Parametric Models, Parallelization and Curvature
Early vision is the process occurring before any semantic interpretation of an image takes place. Motion estimation, object segmentation and detection are all parts of early vision, but recognition is not. Many of these tasks are formulated as optimization problems and one of the key factors for …
-
Run-time parallelization: A framework for parallel computation
… 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 most effective in removing data dependences and increasing the amount of …
-
An efficient parallelization of a real scientific application
… in performance can be achieved by the parallelization of a real scientific application for a heterogeneous network of Sun and Silicon Graphics workstations connected by an Ethernet network, but that this is affected by a number of factors. These factors include communication delays, …
-
Tensor decomposition and parallelization of Markov Decision Processes
… paper develops this MDP tensor decomposition and parallelization algorithm, and analyzes both its computational performance and the optimality of its resultant solutions.
-
Parallelization of the Euler Equations on Unstructured Grids
Several different time-integration algorithms for the Euler equations are investigated on two distributed-memory parallel computers using an explicit message-passing paradigm: these are classic Euler Explicit, four-stage Jameson-style Runge-Kutta, Block Jacobi, Block Gauss-Seidel, and Block …
-
Iterative Schedule Optimization for Parallelization in the Polyhedron Model
… approach to iterative schedule optimization for parallelization and tiling in the polyhedron model. Our approach targets loop programs that profit from data locality optimization and coarse-grained loop parallelization. The schedule search space can be explored either randomly or by means of a …
Page 1 of 15