Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 8 of 8

Full-Text Articles in Physical Sciences and Mathematics

A Gpu Implementation Of Distance-Driven Computed Tomography, Ryan D. Wagner Aug 2017

A Gpu Implementation Of Distance-Driven Computed Tomography, Ryan D. Wagner

Masters Theses

Computed tomography (CT) is used to produce cross-sectional images of an object via noninvasive X-ray scanning of the object. These images have a wide range of uses including threat detection in checked baggage at airports. The projection data collected by the CT scanner must be reconstructed before the image may be viewed. In comparison to filtered backprojection methods of reconstruction, iterative reconstruction algorithms have been shown to increase overall image quality by incorporating a more complete model of the underlying physics. Unfortunately, iterative algorithms are generally too slow to meet the high throughput demands of this application. It is therefore …


Jet-Hadron Correlations Relative To The Event Plane Pb--Pb Collisions At The Lhc In Alice, Joel Anthony Mazer May 2017

Jet-Hadron Correlations Relative To The Event Plane Pb--Pb Collisions At The Lhc In Alice, Joel Anthony Mazer

Doctoral Dissertations

In relativistic heavy ion collisions at the Large Hadron Collider (LHC), a hot, dense and strongly interacting medium known as the Quark Gluon Plasma (QGP) is produced. Quarks and gluons from incoming nuclei collide to produce partons at high momenta early in the collisions. By fragmenting into collimated sprays of hadrons, these partons form 'jets'. Within the framework of perturbative Quantum Chromodynamics (pQCD), jet production is well understood in pp collisions. We can use jets measured in pp interactions as a baseline reference for comparing to heavy ion collision systems to detect and study jet quenching. The jet quenching mechanism …


Analysis And Design Of Communication Avoiding Algorithms For Out Of Memory(Oom) Svd, Khairul Kabir May 2017

Analysis And Design Of Communication Avoiding Algorithms For Out Of Memory(Oom) Svd, Khairul Kabir

Doctoral Dissertations

Many applications — including big data analytics, information retrieval, gene expression analysis, and numerical weather prediction – require the solution of large, dense singular value decomposition (SVD). The size of matrices used in many of these applications is becoming too large to fit into into a computer’s main memory at one time, and the traditional SVD algorithms that require all the matrix components to be loaded into memory before computation starts cannot be used directly. Moving data (communication) between levels of memory hierarchy and the disk exposes extra challenges to design SVD for such big matrices because of the exponential …


Programming Models' Support For Heterogeneous Architecture, Wei Wu May 2017

Programming Models' Support For Heterogeneous Architecture, Wei Wu

Doctoral Dissertations

Accelerator-enhanced computing platforms have drawn a lot of attention due to their massive peak computational capacity. Heterogeneous systems equipped with accelerators such as GPUs have become the most prominent components of High Performance Computing (HPC) systems. Even at the node level the significant heterogeneity of CPU and GPU, i.e. hardware and memory space differences, leads to challenges for fully exploiting such complex architectures. Extending outside the node scope, only escalate such challenges.

Conventional programming models such as data- ow and message passing have been widely adopted in HPC communities. When moving towards heterogeneous systems, the lack of GPU integration causes …


Extensions Of Task-Based Runtime For High Performance Dense Linear Algebra Applications, Chongxiao Cao May 2017

Extensions Of Task-Based Runtime For High Performance Dense Linear Algebra Applications, Chongxiao Cao

Doctoral Dissertations

On the road to exascale computing, the gap between hardware peak performance and application performance is increasing as system scale, chip density and inherent complexity of modern supercomputers are expanding. Even if we put aside the difficulty to express algorithmic parallelism and to efficiently execute applications at large scale, other open questions remain. The ever-growing scale of modern supercomputers induces a fast decline of the Mean Time To Failure. A generic, low-overhead, resilient extension becomes a desired aptitude for any programming paradigm. This dissertation addresses these two critical issues, designing an efficient unified linear algebra development environment using a task-based …


Improving Predictive Capabilities Of Classical Cascade Theory For Nonproliferation Analysis, David Allen Vermillion May 2017

Improving Predictive Capabilities Of Classical Cascade Theory For Nonproliferation Analysis, David Allen Vermillion

Doctoral Dissertations

Uranium enrichment finds a direct and indispensable function in both peaceful and nonpeaceful nuclear applications. Today, over 99% of enriched uranium is produced by gas centrifuge technology. With the international dissemination of the Zippe archetypal design in 1960 followed by the widespread illicit centrifuge trafficking efforts of the A.Q. Khan network, traditional barriers to enrichment technologies are no longer as effective as they once were. Consequently, gas centrifuge technology is now regarded as a high-priority nuclear proliferation threat, and the international nonproliferation community seeks new avenues to effectively and efficiently respond to this emergent threat.

Effective response first requires an …


Efficient Simulation Of A Simple Evolutionary System, Mahendra Duwal Shrestha May 2017

Efficient Simulation Of A Simple Evolutionary System, Mahendra Duwal Shrestha

Masters Theses

An infinite population model is considered for diploid evolution under the influence of crossing over and mutation. The evolution equations show how Vose’s haploid model for Genetic Algorithms extends to the diploid case, thereby making feasible simulations which otherwise would require excessive resources. This is illustrated through computations confirming the convergence of finite diploid population short-term behaviour to the behaviour predicted by the infinite diploid model. The results show the distance between finite and infinite population evolutionary trajectories can decrease in practice like the reciprocal of the square root of population size.

Under necessary and sufficient conditions (NS) concerning mutation …


Accuracy And Stability Of Integration Methods For Neutrino Transport In Core Collapse Supernovae, Kyle A. Gregory May 2017

Accuracy And Stability Of Integration Methods For Neutrino Transport In Core Collapse Supernovae, Kyle A. Gregory

Chancellor’s Honors Program Projects

No abstract provided.