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 502 for “"Parallel algorithms"”.

  1. Tree-structured parallel algorithms

    <p>This paper presents a study of tree-structured parallel algorithms. Concepts such as flow, synchronous and asynchronous tree algorithms, and speed-up for this class of algorithms are defined. It is shown that under certain reasonable assumptions the speed-up, in going from a sequential to a …

    ut-knoxville Repository record for Tree-structured parallel algorithms (opens in a new tab)

  2. Parallel algorithms for corner stitching

    … layout editing systems. This thesis pro-poses parallel algorithms for the batch insertion and deletion operations of the corner stitching data structure. By adding parallel constructs to the serial corner stitching algorithms, new ones are developed that generate multiple streams of …

    ut-knoxville Repository record for Parallel algorithms for corner stitching (opens in a new tab)

  3. Parallel Algorithms For Steiner Forest

    … 96/95. Several heuristic and approximation algorithms, with different approximation guarantees, have been proposed for the Steiner Forest Problem. Despite the several research in designing sequential and parallel algorithms to its closely related problem, Steiner Tree Problem, we are not …

    wayne-thes Repository record for Parallel Algorithms For Steiner Forest (opens in a new tab)

  4. Parallel algorithms for inductance extraction

    … challenging task. This work presents a class of parallel algorithms for fast and accurate inductance extraction of VLSI circuits. We use the solenoidal basis approach that converts the linear system into a reduced system. The reduced system of equations is solved by a preconditioned iterative …

    tamu Repository record for Parallel algorithms for inductance extraction (opens in a new tab)

  5. Parallel Algorithms for VHDL Simulation

    … settled on a partitioning based approach to parallelization. This technique gives us acceptable speedups, if the partitioning and placement of partitions on processors is done carefully. Partitioning and placement issues are examined thoroughly in this thesis.

    uiuc Repository record for Parallel Algorithms for VHDL Simulation (opens in a new tab)

  6. Practical parallel algorithms for chordal graphs

    <p>Given a chordal graph, parallel solutions are given for finding the set of maximal cliques, a perfect elimination ordering and a minimum coloring. The solutions to these problems have a variety of applications. While other parallel solutions to these problems exist, this paper presents …

    ut-knoxville Repository record for Practical parallel algorithms for chordal graphs (opens in a new tab)

  7. Parallel Algorithms for the Maximum Flow

    … including Edmonds and Karp. With the advent of parallel computers, it is of great interest to see whether more efficient algorithms can be designed and implemented. The networks which we will consider will be both capacitated and bounded. Compared with a capacitated network, the problem of …

    glasgow Download PDF for Parallel Algorithms for the Maximum Flow (opens in a new tab)

  8. Fast Parallel Algorithms for Basic Problems

    Parallel processing is one of the most active research areas these days. We are interested in one aspect of parallel processing, i.e. the design and analysis of parallel algorithms. Here, we focus on non-numerical parallel algorithms for basic combinatorial problems, such as data structures, …

    odu Repository record for Fast Parallel Algorithms for Basic Problems (opens in a new tab)

  9. Parallel algorithms for labeled graph matching

    Includes bibliographical references (pages 114-122).

    colo-mines Repository record for Parallel algorithms for labeled graph matching (opens in a new tab)

  10. Massively parallel algorithms for sparse graphs

    … machines that work on a given graph problem in parallel. The Massively Parallel Computation (MPC) model captures the strengths and limitations of such parallel systems and is a widely accepted theoretical framework for analyzing modern parallel algorithms. This thesis considers fundamental graph …

    aalto Repository record for Massively parallel algorithms for sparse graphs (opens in a new tab)

  11. Parallel algorithms for dynamics of robotic manipulators

    The advent of relatively inexpensive parallel computing systems has motivated the investigation of parallel algorithms and architectures as a means of achieving more efficient robot dynamics algorithms. In this thesis, both the inverse dynamics and the forward (simulat10n) dynamics of rigid body …

    uvic Repository record for Parallel algorithms for dynamics of robotic manipulators (opens in a new tab)

  12. Solving chaotic ODEs with time-parallel algorithms

    … modelling, and fluid dynamics. Standard time-parallel algorithms work well for linear systems or over short time intervals, but perform poorly on long periods dominated by chaos.<br><br>To address this problem, we develop a framework for finite-time convergence based on the theory of …

    oxford Repository record for Solving chaotic ODEs with time-parallel algorithms (opens in a new tab)

  13. Communication efficient parallel algorithms for nonnumerical computations

    … symbolic computations on realistic models of parallel architectures. Within this goal, the thesis represents the initial effort to achieve efficient parallel solutions for a number of non-numerical problems on networks of processors. The specific contributions of the thesis are new parallel …

    rice Repository record for Communication efficient parallel algorithms for nonnumerical computations (opens in a new tab)

Page 1 of 26