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 1468 for “"Speedup"”.

  1. Methodology for Accurate Speedup Prediction

    … experimental results. We show that runtimes and speedup can be predicted more accurately by analyzing the functional forms of the sequential and parallel times of critical code segments of a parallel application that affect the speedup of a parallel program. We then combine the functional forms …

    portland-state Repository record for Methodology for Accurate Speedup Prediction (opens in a new tab)

  2. Evaluating Speedup in Parallel Compilers

    … on parallel compilers that target computation speedup by parallelizing the process of program compilation during the lexical analysis and semantic analysis phase. Parallelization brings along with it issues like synchronization, concurrency and communication overhead. In the semantic analysis …

    unf Repository record for Evaluating Speedup in Parallel Compilers (opens in a new tab) Download PDF for Evaluating Speedup in Parallel Compilers (opens in a new tab)

  3. Speedup of Optical Scanner Characterization System

    … level curves, this improves execution time. The speedups realized from the algorithms detailed in this thesis are presented. Overall, about 4 orders of magnitude speedup were achieved. The algorithms that find level curves from surfaces employ approximations, so a comparison with prior results …

    boise Repository record for Speedup of Optical Scanner Characterization System (opens in a new tab)

  4. Program Speedup Through Concurrent Record Processing

    Made available in DSpace on 2014-12-10T20:13:44Z (GMT). No. of bitstreams: 1 7511635.pdf: 5477296 bytes, checksum: e357845fc491f91fa6e9e4956fd93b81 (MD5) Previous issue date: 1974

    uiuc Repository record for Program Speedup Through Concurrent Record Processing (opens in a new tab)

  5. Modeling speedup in parallel sparse matrix factorization

    … we first determine upper and lower bounds on the speedup that can be expected in practice for this problem, and end with a parameterized model that is capable of reproducing the full range of behavior within these bounds, including the speedups actually observed in practice. This model suggests …

    ut-knoxville Repository record for Modeling speedup in parallel sparse matrix factorization (opens in a new tab)

  6. Speedup of Iterative Programs in Multiprocessing Systems

    Made available in DSpace on 2014-12-10T20:13:46Z (GMT). No. of bitstreams: 1 7514094.pdf: 3796548 bytes, checksum: 11ace6b0808ecb3212eb1bf9de3106c0 (MD5) Previous issue date: 1975

    uiuc Repository record for Speedup of Iterative Programs in Multiprocessing Systems (opens in a new tab)

  7. Towards a Quantum Speedup via Applications and Architectures

    … This is achieved through applying a quantum speedup for Backtracking algorithms to classical algorithms for solving the Travelling Salesman Problem when the degree of the graph is at most 3 or 4. We then obtain further polynomial speedups when the degree of the graph is at most 6, by a …

    bristol Repository record for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab) Download PDF for Towards a Quantum Speedup via Applications and Architectures (opens in a new tab)

  8. Techniques to speedup test generation for VLSI circuits

    The increasing complexity of logic circuits has made the problem of test generation intractable. In this dissertation we investigate three different techniques to speed up the test generation process. The first approach attempts to exploit the hierarchy inherent in any complex digital design. An …

    uiuc Repository record for Techniques to speedup test generation for VLSI circuits (opens in a new tab)

  9. Asynchronous Cellular Automata - Special Networks Local Slowdown Produces Global Speedup

    Information processing in living tissues is dramatically different from what we see in common man-made computer. The data and processing is distributed into the activity of cells which communicate only with neighboring cells. There is no clock for the global synchronization of cellular activities. …

    usf Repository record for Asynchronous Cellular Automata - Special Networks Local Slowdown Produces Global Speedup (opens in a new tab)

  10. Software/Hardware Tradeoffs in the Speedup of Color Image Processing Algorithms

    … at several different methods of improving the speedup of color image processing algorithms and compares the tradeoffs among them. The methods for increasing the execution time of an algorithm include implementing Single Input Multiple Data (SIMD) instructions, using Posix threads to code across …

    rit Repository record for Software/Hardware Tradeoffs in the Speedup of Color Image Processing Algorithms (opens in a new tab)

  11. Using the Greenup, Powerup and Speedup Metrics to Evaluate Software Energy Efficiency

    … This thesis proposes the Greenup, Powerup, and Speedup (GPS-UP) metrics to systematically evaluate the energy efficiency of serial and parallel applications. The GPS-UP metrics transform the performance, power, and energy of a program into one of the eight categories on the GPS-UP energy …

    texas-state Repository record for Using the Greenup, Powerup and Speedup Metrics to Evaluate Software Energy Efficiency (opens in a new tab)

  12. PaSE : Parallel Speedup Estimation Framework for Network-on-Chip Based Multi-core Systems

    … simulations traditionally used to evaluate the speedup with these systems are computationally expensive and time consuming. On the other hand, analytical speedup models such as Amdahl’s law are powerful and fast ways to calculate the achievable speedup of these systems. However, Amdahl’s Law …

    rit Repository record for PaSE : Parallel Speedup Estimation Framework for Network-on-Chip Based Multi-core Systems (opens in a new tab)

  13. Analytical speedup modeling for parallel applications with variable memoryaccess delay in symmetric architectures

    … of cores that current architectures can offer, speedup models suitable for describing such differences are quite desirable for either offline or online scheduling decisions. This thesis presents a novel analytical speedup model that considers variations in the average data-access delay to …

    brazil-ufrn Repository record for Analytical speedup modeling for parallel applications with variable memoryaccess delay in symmetric architectures (opens in a new tab)

  14. Application speedup characterization: modeling parallelization overhead and variations of problem size and number of cores

    … extra overhead. Throughout the years, many speedup models were proposed. Most of them based on Amdahl’s Law or Gustafson’s Law. However, many of those make considerations such as a fixed parallel fraction, or a parallel fraction that varies linearly with problem size, and inexistent …

    brazil-ufrn Repository record for Application speedup characterization: modeling parallelization overhead and variations of problem size and number of cores (opens in a new tab)

  15. An Expanded Speedup Model for the Early Phases of High Performance Computing Cluster (HPCC) Design

    … then attempt to quantify the maximum theoretical speedup that can be achieved by a cluster relative to a sequential processor. The studies tend to only investigate the influences in isolation, but in practice these factors tend to be interdependent. It is the interaction rather than any solitary …

    vt Repository record for An Expanded Speedup Model for the Early Phases of High Performance Computing Cluster (HPCC) Design (opens in a new tab)

  16. Skip, Search, Speculate - Turning a Frozen LLM into Its Own Lightweight Drafter for Lossless Inference Speedup

    This thesis has investigated the possibility to speedup inference by producing a self-speculative setup where the original model is verifier and drafter. The model is frozen so the original quality is preserved and no retraining required. The frozen model switches between being verifier and …

    chalmers Repository record for Skip, Search, Speculate - Turning a Frozen LLM into Its Own Lightweight Drafter for Lossless Inference Speedup (opens in a new tab)

Page 1 of 74