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 304 for “"Parallel Computing"”.
-
An Infrastructure for Worldwide Parallel Computing
… infrastructure for supporting large-scale parallel computing on the Internet. We present results on the projected cost and performance of large scale infrastructures, and show that, given current technologies, it is feasible to construct hierarchies with 25,000 WWW browsers and 600 WWW …
-
Architectural Support for Reliable Parallel Computing
ReEnact improves reliability of multi-threaded software by providing an effective data-race debugging support. ReEnact extends thread-level speculation (TLS) mechanisms to roll back the buggy execution and repeat it as many times as necessary until the bug is fully characterized. These incremental …
-
Architectural support for massively-concurrent parallel computing
Parallel computing is an intricate mix of marketplace requirements, architectural understanding, technology issues, and issues concerning costs. One controlling myth is that high-volume commodity processors must, by the nature of things, be the common building blocks for both desktop clients and …
-
Parallel computing on geostatistical data using CUDA
… those analyses can be accelerated by applying parallel computing using modern GPUs. The highly parallel structure makes modern GPUs more effective than general-purpose CPUs for algorithms where processing of large blocks of data is done in parallel. In our study, we compared the performance …
-
Static and dynamic communication in parallel computing
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1992
-
Multi-CubeSat mission planning enabled through parallel computing
… integration of multiple satellites using parallel processing on a super computer, and lays out the necessary constraints to define cooperative intercept, rendezvous and orbit reconfiguration problems. Finally, this dissertation develops a new approach to parallel algorithmic …
-
Parallel computing solutions to the Balitsky-Kovchegov equation
… the first computational step and introduce new, parallelised methods in code that evolves the BK equation. Parallelisation of BK evolution using NVIDIA CUDA with implementation on a commercially available graphical processing unit (GPU) results in performance improvements of roughly an order of …
-
Parallel computing, benchmarking and ATLAS software on ARM
… of the ARM architecture in high energy physics computing. ARM processors are predominantly found in smartphones and mobile tablets. Results from benchmarks which were performed on the armv7l architecture are presented. These provide qualitative data as well as confirmation that specialized high …
-
Hybrid Parallel Computing Strategies for Scientific Computing Applications
… with respect to the efficient exploitation of parallelism for large-scale, scientific computing simulations. For example, a simulation of the human tonsil at the cellular level involves the computation of the motion and interaction of millions of cells over extended periods of time. Also, the …
-
Modeling Complex Forest Ecology in a Parallel Computing Infrastructure
… In this thesis, we describe an efficient parallel implementation of a land cover use model, Mosaic, and discuss the development efforts to incorporate spatial interaction and succession dynamics into the model. To evaluate the performance of our implementation, an extensive set of …
-
Intraprocedural and interprocedural data dependence analysis for parallel computing
Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:35Z Item is restricted indefinitely.
-
Novel parallel computing decoupling methods for power system distribution networks
… for decoupling distribution power networks among parallel processing cores in a real-time (RT) multi-core environment. The proposed techniques help remove computational limitations and speedup real-time simulation of networks. Prior to this work, the solutions employed include approaches such as …
-
H-SIMD machine : configurable parallel computing for data-intensive applications
… multiple-data (H-SLMD) configurable computing architecture to facilitate the efficient execution of data-intensive applications on field-programmable gate arrays (FPGAs). H-SIMD targets data-intensive applications for FPGA-based system designs. The H-SIMD machine is associated with a …
-
Designing a Compiler for a Distributed Memory Parallel Computing System
… While these optimizations are not specific to parallel computing, architectural considerations must still be made to properly implement the algorithms within the SCMP compiler. These optimizations yield an overall reduction in execution time of 15-36%.
-
Parallel Islands: A Diversity Aware Tool For Parallel Computing Education
… multiprocessors has led to the incorporation of parallel processing in virtually all segments of industry. Creation of and maintenance for the software to run these systems, as well as for the applications using these systems, requires extensive knowledge of the concepts and skills of parallel …
-
Structural optimization: an approach based on genetic algorithms and parallel computing
An approach based on genetic algorithm and parallel computing has been presented and discussed for structural optimizations. Some details on its software implementation are given and explained. Numerical simulations demonstrate the applicability of the proposed approach for the optimization of …
-
Parallel computing with improved techniques for Monte Carlo simulation in VaR
… via the use of norms. This thesis focuses on computing upper bounds for VaR which rely upon information obtained from these norms; we thereby can discern when it is possible to answer the VaR decision problem without resorting to time-consuming Monte Carlo methods. We use a parallel computing …
-
Stable Sparse Orthogonal Factorization of Ill-Conditioned Banded Matrices for Parallel Computing
<p>Sequential and parallel algorithms based on the LU factorization or the QR factorization have been intensely studied and widely used in the problems of computation with large-scale ill-conditioned banded matrices. Great concerns on existing methods include ill-conditioning, sparsity of factor …
Page 1 of 16