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 9 of 9 for “"multi-core machines"”.

  1. Threaded WARPED : An Optimistic Parallel Discrete Event Simulator for Cluster of Multi-Core Machines

    … platforms. However, the emergence of low-cost multi-core and many-core processors suitable for use in Beowulf clusters provides an opportunity for PDES execution on a platform containing both shared memory and distributed memory parallelism. This thesis explores the migration of an existing …

    ohiolink Repository record for Threaded WARPED : An Optimistic Parallel Discrete Event Simulator for Cluster of Multi-Core Machines (opens in a new tab)

  2. High performance data processing pipeline for connectome segmentation

    … size. The main contributions of this thesis are multiple algorithmic techniques for 2- dimensional pixel classification of varying accuracy and speed trade-off, as well as a fast object segmentation algorithm. The majority of the system is parallelized for multi-core machines, and with minor …

    mit Repository record for High performance data processing pipeline for connectome segmentation (opens in a new tab)

  3. A Unified Framework for Parallel Anisotropic Mesh Adaptation

    … adaptation captures features of the solution at multiple scales while, minimizing the required number of elements. However, it also introduces new challenges on top of mesh generation. Also, the increased complexity of the targeted cases requires departing from traditional surface-constrained …

    odu Repository record for A Unified Framework for Parallel Anisotropic Mesh Adaptation (opens in a new tab)

  4. On The Parallelization Of Integer Polynomial Multiplication

    … 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 use …

    uwo Repository record for On The Parallelization Of Integer Polynomial Multiplication (opens in a new tab)

  5. Secure and high-performance big-data systems in the cloud

    … index-repair operations which are expensive. The core contribution of HINDEX is a scheduling framework for deferred and lightweight execution of index repairs. HINDEX has been implemented and is currently being transferred to an IBM big data product. Second, I proposed Auto-pipelining for …

    gatech Repository record for Secure and high-performance big-data systems in the cloud (opens in a new tab)

  6. Enriching the Web of Data with topics and links

    … (LINDA) system. Our first solution can exploit multi-core machines, whereas the second and third approach are designed to run in a distributed shared-nothing environment. We discuss and evaluate the properties of our approaches leading to recommendations which algorithm to use in a specific …

    potsdam-diss Repository record for Enriching the Web of Data with topics and links (opens in a new tab)

  7. Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms

    … Ordered Binary Decision Diagrams (ROBDD) on multi-core machines. In order to perform multiple BDD operations concurrently, our algorithm uses a breadth-first search (BFS). As ROBDD algorithms are memory-intensive, maintaining locality of data is an important issue. Therefore, we propose the …

    vt Repository record for Strategies for Performance and Quality Improvement of Hardware Verification and Synthesis Algorithms (opens in a new tab)

  8. Parallel Algorithms, Optimizations, and Benchmarks for Metric and Graph Clustering

    … that take advantage of modern shared-memory multi-core machines and dynamic algorithms that can efficiently update the result without re-computing from scratch. We also present approximate clustering algorithms that scale to high-dimensional data. The first part of this thesis studies …

    mit Repository record for Parallel Algorithms, Optimizations, and Benchmarks for Metric and Graph Clustering (opens in a new tab)

  9. Distributed timing analysis

    … timing with billions of transistors across multiple modes and corners is quickly becoming the major bottleneck to the overall chip design closure process. To alleviate the long runtimes, recent trends are driving the need of distributed timing analysis (DTA) in electronic design automation …

    uiuc Repository record for Distributed timing analysis (opens in a new tab)