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 453 for “"speedup"”.
-
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
-
Network coding for speedup in switches
… in a multicast crossbar switch in terms of speedup. We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. …
-
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
-
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 …
-
Providing QoS guarantees in input buffered crossbar switches with speedup
… in input-buffered crossbar switches with speedup. It is shown that speedup of 4 is sufficient to ensure 100% asymptotic throughput with any maximal matching algorithm employed by the arbiter. It is also demonstrated that the crossbar architecture is capable of providing delay guarantees …
-
Throughput analysis of input-queued packet switches : multicasting and speedup
… of input-queued switches through the use of "speedup" and clever packet scheduling algorithms. Research on designing efficient switches for multicast traffic is also of great interest currently, since multicast traffic is a growing proportion of Internet traffic. In this thesis, we revisit the …
-
Speedup of MCNP(X) parallel KCODE execution via communication algorithm development and Beowulf Cluster optimization
This thesis examines two methods for speeding up MCNP KCODE calculations. The first approach is assembly of a low cost Beowulf Cluster for parallel computation. The first half describes the MIT Nuclear Engineering Department's Beowulf Cluster, Echelon, as a prototype. Echelon is a low cost, 30 …
-
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 …
-
Verification of Simulation Models of Network Protocols Using State Space Exploration
… (ISSE), a technique that aims to provide a speedup in the state space exploration time of evolving simulation models; i.e., simulation models whose code changes from one version to another. A code change may or may not lead to a behavioral change. We analytically obtain necessary conditions …
-
Utilizing GPU tensor cores for algorithmic acceleration
… introduced Tensor Cores which promised a 3 times speedup over their Pascal architecture. Despite the favorable performance gains, these accelerators have not been applied extensively to a wider class of algorithms. Through this thesis we introduce novel ways of mapping various algorithms on the …
-
GPU acceleration of advanced K-mer counting for computational genomics
… counting as an essential step. We achieved 4.03x speedup using one GTX 1080 Ti with one CPU (Xeon E5-2603) thread and 5.88x speedup using one GPU with four CPU threads over KMC2 running on a single CPU thread. This speedup is significant because accelerating k-mer counting is challenging due to …
-
Novel Hybrid Resampling Algorithms for Parallel/Distributed Particle Filters
… extra communication costs, which lowers the speedup factors in parallel computing. Even though some efficient particle routing policies had been introduced, the centralized resampling still suffered from high communication costs. A decentralized resampling algorithm was introduced to decrease …
-
Quantum speedups in query complexity
… and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum speedup compared to the best possible randomized algorithm. In the process, we introduce the …
-
Towards Algorithm Transformation for Temporal Data Mining on GPU
… non-data parallel code with either marginal speedup or even slowdown. The type of data mining we examine, temporal data mining, uses a ¯nite state machine (FSM), which is non-data parallel. We contribute the concept of algorithm transformation for increasing the data parallelism of an …
-
The power of parallel time
… RAM, and the pointer machine. All previous speedup results either relied on the severe limitation on the storage structure of ${\cal M}$ (e.g., ${\cal M}\sp\prime$ was a Turing machine with linear tapes) or required that ${\cal M}\sp\prime$ had a more versatile storage structure than ${\cal …
-
Vectorization and microtasking of UTCHEM on the CRAY X-MP
… to other reservoir simulators were discussed. Speedup factors of up to 40 by a combination of vectorization and microtasking on a two-processor CRAY X-MP were observed. Higher speedup factors were observed on the CRAY X-MP/48. A fully vectorized iterative method for solving the system of …
-
Parallel Black Oil Solvers on GPU
… one million grid blocks, is selected to test the speedup of the GPU solver. On the state-of-the-art CPU and GPU platform, the new GPU implementation is able to achieve a speedup of over 8 times in solving linear systems arising from this SPE10 problem compared with the single CPU based sequential …
-
Parallelization of SIFT on Rigel
… architecture Rigel and studied the amount of speedup that can be gained by parallelizing the algorithm. Our results showed the algorithm to provide a speedup of 75x when parallelized over 128 cores.
-
Parallel Processing for Modeling Reactive Transport in Groundwater
… sequential code. The CPU time required and the speedup achieved by running the simulation on parallel processors is presented for multiple test problems with varying physical processes and computational grid sizes. For a two-dimensional plume simulation of five solutes, with a finite difference …
Page 1 of 23