You searched for subject:(Parallel Computing).
Showing records 1 – 30 of
852 total matches.
◁ [1] [2] [3] [4] [5] … [29] ▶
1.
Zulian, Patrick.
Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective.
Degree: 2017, Università della Svizzera italiana
URL: http://doc.rero.ch/record/304964 
► In finite element simulations, the handling of geometrical objects and their discrete representation is a critical aspect in both serial and parallel scientific software environments.…
(more)
▼ In finite element simulations, the handling of
geometrical objects and their discrete representation is a critical
aspect in both serial and
parallel scientific software
environments. The development of codes targeting such envinronments
is
subject to great development effort and man-hours invested. In
this thesis we approach these issues from three fronts. First,
stable and efficient techniques for the transfer of discrete fields
between non matching volume or surface meshes are an essential
ingredient for the discretization and numerical solution of coupled
multi-physics and multi-scale problems. In particular
L2-projections allows for the transfer of discrete fields between
unstructured meshes, both in the volume and on the surface. We
present an algorithm for parallelizing the assembly of the
L2-transfer operator for unstructured meshes which are arbitrarily
distributed among different processes. The algorithm requires no a
priori information on the geometrical relationship between the
different meshes. Second, the geometric representation is often a
limiting factor which imposes a trade-off between how accurately
the shape is described, and what methods can be employed for
solving a system of differential equations. Parametric
finite-elements and bijective mappings between polygons or
polyhedra allow us to flexibly construct finite element
discretizations with arbitrary resolutions without sacrificing the
accuracy of the shape description. Such flexibility allows
employing state-of-the-art techniques, such as geometric multigrid
methods, on meshes with almost any shape.t, the way numerical
techniques are represented in software libraries and approached
from a development perspective, affect both usability and
maintainability of such libraries. Completely separating the intent
of high-level routines from the actual implementation and
technologies allows for portable and maintainable performance. We
provide an overview on current trends in the development of
scientific software and showcase our open-source library
utopia.
Advisors/Committee Members: Rolf (Dir.).
Subjects/Keywords: Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zulian, P. (2017). Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/304964
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zulian, Patrick. “Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective.” 2017. Thesis, Università della Svizzera italiana. Accessed September 26, 2018.
http://doc.rero.ch/record/304964.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zulian, Patrick. “Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective.” 2017. Web. 26 Sep 2018.
Vancouver:
Zulian P. Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective. [Internet] [Thesis]. Università della Svizzera italiana; 2017. [cited 2018 Sep 26].
Available from: http://doc.rero.ch/record/304964.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zulian P. Geometry–aware finite element framework for multi–physics
simulations: an algorithmic and software-centric
perspective. [Thesis]. Università della Svizzera italiana; 2017. Available from: http://doc.rero.ch/record/304964
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Manitoba
2.
Solomon, Steven.
Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units.
Degree: Computer Science, 2012, University of Manitoba
URL: http://hdl.handle.net/1993/5098
► Recently, interest in the Graphics Processing Unit (GPU) for general purpose parallel applications development and research has grown. Much of the current research on the…
(more)
▼ Recently, interest in the Graphics Processing Unit (GPU) for general purpose
parallel applications development and research has grown. Much of the current research on the GPU focuses on the acceleration of regular problems, as irregular problems typically do not provide the same level of performance on the hardware. We explore the potential of the GPU by investigating four problems on the GPU with regular and/or irregular properties: lookback option pricing (regular), single-source shortest path (irregular), maximum flow (irregular), and the task matching problem using multi-swarm particle swarm optimization (regular with elements of irregularity). We investigate the design, implementation, optimization, and performance of these algorithms on the GPU, and compare the results. Our results show that the regular problem achieves greater performance and requires less development effort than the irregular problems. However, we find the GPU to still be capable of providing high levels of acceleration for irregular problems.
Advisors/Committee Members: Thulasiraman, Parimala (Computer Science) (supervisor), Domaratzki, Michael (Computer Science) Lui, Shaun (Mathematics) (examiningcommittee).
Subjects/Keywords: Parallel Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Solomon, S. (2012). Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/5098
Chicago Manual of Style (16th Edition):
Solomon, Steven. “Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units.” 2012. Masters Thesis, University of Manitoba. Accessed September 26, 2018.
http://hdl.handle.net/1993/5098.
MLA Handbook (7th Edition):
Solomon, Steven. “Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units.” 2012. Web. 26 Sep 2018.
Vancouver:
Solomon S. Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units. [Internet] [Masters thesis]. University of Manitoba; 2012. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1993/5098.
Council of Science Editors:
Solomon S. Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units. [Masters Thesis]. University of Manitoba; 2012. Available from: http://hdl.handle.net/1993/5098
Texas A&M University
3.
Hoxha, Dielli.
Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.
Degree: MS, Computer Engineering, 2016, Texas A&M University
URL: http://hdl.handle.net/1969.1/157157
► Applications of matrices are found in most scienti?c ?elds, such as physics, computer graphics, numerical analysis, etc. The high applicability of matrix algorithms and representations…
(more)
▼ Applications of matrices are found in most scienti?c ?elds, such as physics, computer graphics, numerical analysis, etc. The high applicability of matrix algorithms and representations make them an important component in any
parallel programming language, therefore matrix frameworks are a continuous research e?ort in high performance
computing. This work focuses on a generic matrix framework in the STAPL library. First, we extend the STAPL library by adding a sparse matrix container. Second we implement SUMMA, the
parallel matrix-multiplication algorithm, for ?ne grained computations. Then, implement
parallel matrix-matrix algorithms for the sparse matrix container. Finally, we conduct experimental studies for each of the components we have implemented and discuss the ?ndings. Experiments are conducted on a Cray XE6m cluster. Experimental studies consist of multiple matrix and data inputs that showcase and stress the matrix models implemented. We ?nd that the sparse matrix container outperforms its dense counterpart in sparse in-puts, and vice versa. Both containers, and the matrix summa implementation show scalability up to 512 cores.
Advisors/Committee Members: Amato, Nancy M. (advisor), Rauchwerger, Lawrence (advisor), Ragusa, Jean (committee member).
Subjects/Keywords: Parallel Computing; Sparse Matrix
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hoxha, D. (2016). Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157157
Chicago Manual of Style (16th Edition):
Hoxha, Dielli. “Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.” 2016. Masters Thesis, Texas A&M University. Accessed September 26, 2018.
http://hdl.handle.net/1969.1/157157.
MLA Handbook (7th Edition):
Hoxha, Dielli. “Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework.” 2016. Web. 26 Sep 2018.
Vancouver:
Hoxha D. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. [Internet] [Masters thesis]. Texas A&M University; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1969.1/157157.
Council of Science Editors:
Hoxha D. Sparse Matrices and Summa Matrix Multiplication Algorithm in STAPL Matrix Framework. [Masters Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157157
University of Ontario Institute of Technology
4.
Dubitski, Alexander.
A parallel adaptive method for pseudo-arclength continuation.
Degree: 2011, University of Ontario Institute of Technology
URL: http://hdl.handle.net/10155/196
► We parallelize the pseudo-arclength continuation method for solving nonlinear systems of equations. Pseudo-arclength continuation is a predictor-corrector method where the correction step consists of solving…
(more)
▼ We parallelize the pseudo-arclength continuation method for solving nonlinear systems
of equations. Pseudo-arclength continuation is a predictor-corrector method where the
correction step consists of solving a linear system of algebraic equations. Our algorithm
parallelizes adaptive step-length selection and inexact prediction. Prior attempts to parallelize
pseudo-arclength continuation are typically based on parallelization of the linear
solver which leads to completely solver-dependent software. In contrast, our method is
completely independent of the internal solver and therefore applicable to a large domain
of problems. Our software is easy to use and does not require the user to have extensive
prior experience with High Performance
Computing; all the user needs to provide is the
implementation of the corrector step. When corrector steps are costly or continuation
curves are complicated, we observe up to sixty percent speed up with moderate numbers
of processors. We present results for a synthetic problem and a problem in turbulence.
Advisors/Committee Members: Van Veen, Lennaert.
Subjects/Keywords: HPC; Arclength; Parallel; Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dubitski, A. (2011). A parallel adaptive method for pseudo-arclength continuation. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/196
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dubitski, Alexander. “A parallel adaptive method for pseudo-arclength continuation.” 2011. Thesis, University of Ontario Institute of Technology. Accessed September 26, 2018.
http://hdl.handle.net/10155/196.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dubitski, Alexander. “A parallel adaptive method for pseudo-arclength continuation.” 2011. Web. 26 Sep 2018.
Vancouver:
Dubitski A. A parallel adaptive method for pseudo-arclength continuation. [Internet] [Thesis]. University of Ontario Institute of Technology; 2011. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10155/196.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dubitski A. A parallel adaptive method for pseudo-arclength continuation. [Thesis]. University of Ontario Institute of Technology; 2011. Available from: http://hdl.handle.net/10155/196
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
5.
Hamsapriya T.
Certain investigations on parallel Computing for
engineering Applications;.
Degree: Certain investigations on parallel Computing for
engineering Applications, 2014, Anna University
URL: http://shodhganga.inflibnet.ac.in/handle/10603/29893
► The need for faster computers is driven by the demands of both newlineComputation intensive applications in science and engineering and dataintensive newlineapplications in commerce The…
(more)
▼ The need for faster computers is driven by the
demands of both newlineComputation intensive applications in
science and engineering and dataintensive newlineapplications in
commerce The main motivation of parallelization of newlineany
sequential algorithm is the desire to reduce the total execution
time of the newlinealgorithm Parallel computing provides a way to
reduce the time taken to newlineexecute a task by dividing the task
between multiple computers that can work newlinesimultaneously to
complete the job As the cost of dedicated parallel machines
newlineis high computing on a cluster of workstations is a viable
alternative for a newlinewide range of engineering applications The
thesis aims at finding cost newlineeffective parallel
implementation of algorithms on a cluster to solve complex
newlineapplications The first part of the thesis addresses the
issues that arise in the newlineparallel implementations The major
issues of concern are load balancing, a newlinewidely used
technique to balance the workload among multiple processors
newlineand fault tolerance the ability to tolerate failures The
proposed load newlinebalancing approach is based on a central
scheduler with hybrid genetic newlinealgorithms and genetic local
search methods Replication approach has been newlineproposed to
improve the performance and fault tolerance of a multiprocessor
newlinesystem newline newline
appendix p215-217, reference
p218-228.
Advisors/Committee Members: Sumathi S.
Subjects/Keywords: Dataintensive applications; Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
T, H. (2014). Certain investigations on parallel Computing for
engineering Applications;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/29893
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
T, Hamsapriya. “Certain investigations on parallel Computing for
engineering Applications;.” 2014. Thesis, Anna University. Accessed September 26, 2018.
http://shodhganga.inflibnet.ac.in/handle/10603/29893.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
T, Hamsapriya. “Certain investigations on parallel Computing for
engineering Applications;.” 2014. Web. 26 Sep 2018.
Vancouver:
T H. Certain investigations on parallel Computing for
engineering Applications;. [Internet] [Thesis]. Anna University; 2014. [cited 2018 Sep 26].
Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29893.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
T H. Certain investigations on parallel Computing for
engineering Applications;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/29893
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Miami
6.
McMahon, Adam.
Rendering Animations with Distributed Applets over the Internet.
Degree: MS, Computer Science (Arts and Sciences), 2009, University of Miami
URL: http://scholarlyrepository.miami.edu/oa_theses/189
► High quality 3D rendering requires massive computing resources. In order to render animations within a reasonable amount of time, the rendering process is often distributed…
(more)
▼ High quality 3D rendering requires massive
computing resources. In order to render animations within a reasonable amount of time, the rendering process is often distributed among a cluster of computers, typically called a rendering farm. However, most individuals and small studios do not have the resources to purchase or lease a rendering farm. In the late 1990?s, Java technology brought a hope that distributed applets could be utilized as an alternative to traditional network rendering models. Yet, this hope was never realized, nor was it fully implemented. Taking into account new developments in web application technology and the Sunflow renderer, this thesis will reexamine the possibility of distributed rendering applets. This thesis will suggest that distributed Java applets can effectively render projects across a collection of heterogeneous and geographically dispersed computers over the Internet. Moreover, this paper will present a prototype web application, called RenderWeb, that uses distributed applets to quickly render projects created in popular animation programs, such as Blender, 3D Studio MAX, and Softimage.
Advisors/Committee Members: Victor Milenkovic - Committee Chair, Burton Rosenburg - Committee Member, Ali Habashi - Mentor.
Subjects/Keywords: Rendering; Applets; Parallel Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
McMahon, A. (2009). Rendering Animations with Distributed Applets over the Internet. (Thesis). University of Miami. Retrieved from http://scholarlyrepository.miami.edu/oa_theses/189
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
McMahon, Adam. “Rendering Animations with Distributed Applets over the Internet.” 2009. Thesis, University of Miami. Accessed September 26, 2018.
http://scholarlyrepository.miami.edu/oa_theses/189.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
McMahon, Adam. “Rendering Animations with Distributed Applets over the Internet.” 2009. Web. 26 Sep 2018.
Vancouver:
McMahon A. Rendering Animations with Distributed Applets over the Internet. [Internet] [Thesis]. University of Miami; 2009. [cited 2018 Sep 26].
Available from: http://scholarlyrepository.miami.edu/oa_theses/189.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
McMahon A. Rendering Animations with Distributed Applets over the Internet. [Thesis]. University of Miami; 2009. Available from: http://scholarlyrepository.miami.edu/oa_theses/189
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Virginia
7.
Sarnowska-Upton, Karolina.
Methods Toward Automatic Configuration of Computing
Environments for Application Execution.
Degree: PhD, 2013, University of Virginia
URL: http://libra.virginia.edu/catalog/libra-oa:2898
► Computing resources are now ubiquitous and computational research techniques permeate all disciplines. However, exploiting available resources can be a much more complicated proposition. There is…
(more)
▼ Computing resources are now ubiquitous and
computational research techniques permeate all disciplines.
However, exploiting available resources can be a much more
complicated proposition. There is no guarantee that one can simply
use a compute resource with no more effort than copying binaries
and data. As computing resources are usually heterogeneous in both
hardware and software configurations, many requirements be matched
to execute a computation on a new resource in a new environment.
The difficulties increase when dealing with parallel computations,
which add a layer of dependencies related to the Message Passing
Interface (MPI) standard libraries.
Unfortunately, managing the
migration process by using existing techniques is inadequate or
requires a non-trivial amount of effort and experience. In
particular, schedulers are not generally designed to capture a
computation’s software-related requirements and, thus, depend on
users to configure such dependencies. Additionally, the set of
possible sites where computations could be scheduled is limited to
where the computations are known to be able to run — a
determination that in the current state of the art is performed
manually by the user. This process, which requires enumerating
dependencies, checking and making them available in new
environments, and potentially recompiling the computation, can take
many hours of labor. The difficulty is compounded by the fact that
many researchers in disciplines that were previously not
traditionally compute-heavy may not have experience with
configuring a single environment, let alone with migrating a
computation from one environment to another.
An ideal solution
for providing deployment and, therefore, scheduling freedom would
allow any computation to quickly and easily be run on computing
resources with tuned performance. Before addressing the difficult
but secondary issues of automatic recompilation and tuning, the
first step on the path toward an ideal solution is to consider how
additional scheduling freedom could be achieved with minimum
interaction from the user but without modification of the
computation code. Such a solution would automatically enable
application binaries to quickly and easily be run on new resources.
Our hypothesis is that methods for automatically gathering
information about execution requirements and composing
site-specific instructions that configure the requirements at
target environments are more efficient than manual methods for the
preparation of multiple shared computing environments for the
execution of MPI binaries. Achieving this initial solution alone
can dramatically improve the ability of researchers to take
advantage of the variety of computing resources available to them
and, as a result, carry out more and better research.
Due to
the additional requirements that arise when using MPI, our research
specifically focuses on enabling the deployment and, therefore,
scheduling freedom of parallel computations encoded using the MPI
standard on high performance computing clusters.…
Advisors/Committee Members: Grimshaw, Andrew (advisor).
Subjects/Keywords: parallel computing; migration; automation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sarnowska-Upton, K. (2013). Methods Toward Automatic Configuration of Computing
Environments for Application Execution. (Doctoral Dissertation). University of Virginia. Retrieved from http://libra.virginia.edu/catalog/libra-oa:2898
Chicago Manual of Style (16th Edition):
Sarnowska-Upton, Karolina. “Methods Toward Automatic Configuration of Computing
Environments for Application Execution.” 2013. Doctoral Dissertation, University of Virginia. Accessed September 26, 2018.
http://libra.virginia.edu/catalog/libra-oa:2898.
MLA Handbook (7th Edition):
Sarnowska-Upton, Karolina. “Methods Toward Automatic Configuration of Computing
Environments for Application Execution.” 2013. Web. 26 Sep 2018.
Vancouver:
Sarnowska-Upton K. Methods Toward Automatic Configuration of Computing
Environments for Application Execution. [Internet] [Doctoral dissertation]. University of Virginia; 2013. [cited 2018 Sep 26].
Available from: http://libra.virginia.edu/catalog/libra-oa:2898.
Council of Science Editors:
Sarnowska-Upton K. Methods Toward Automatic Configuration of Computing
Environments for Application Execution. [Doctoral Dissertation]. University of Virginia; 2013. Available from: http://libra.virginia.edu/catalog/libra-oa:2898
University of Saskatchewan
8.
Coutu, Jason Dean.
Reduction of co-simulation runtime through parallel processing.
Degree: 2009, University of Saskatchewan
URL: http://hdl.handle.net/10388/etd-09082009-140047
► During the design phase of modern digital and mixed signal devices, simulations are run to determine the fitness of the proposed design. Some of these…
(more)
▼ During the design phase of modern digital and mixed signal devices, simulations are run to determine the fitness of the proposed design. Some of these simulations can take large amounts of time, thus slowing down the time to manufacture of the system prototype. One of the typical simulations that is done is an integration simulation that simulates the hardware and software at the same time. Most simulators used in this task are monolithic simulators. Some simulators do have the ability to have external libraries and simulators interface with it, but the setup can be a tedious task. This thesis proposes, implements and evaluates a distributed simulator called PDQScS, that allows for speed up of the simulation to reduce this bottleneck in the design cycle without the tedious separation and linking by the user. Using multiple processes and SMP machines a simulation run time reduction was found.
Advisors/Committee Members: Makaroff, Dwight (advisor), Bolton, Ron (committee member), Eager, Derek (committee member), Spiteri, Raymond (committee member).
Subjects/Keywords: HW/SW simulation; Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Coutu, J. D. (2009). Reduction of co-simulation runtime through parallel processing. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-09082009-140047
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Coutu, Jason Dean. “Reduction of co-simulation runtime through parallel processing.” 2009. Thesis, University of Saskatchewan. Accessed September 26, 2018.
http://hdl.handle.net/10388/etd-09082009-140047.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Coutu, Jason Dean. “Reduction of co-simulation runtime through parallel processing.” 2009. Web. 26 Sep 2018.
Vancouver:
Coutu JD. Reduction of co-simulation runtime through parallel processing. [Internet] [Thesis]. University of Saskatchewan; 2009. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10388/etd-09082009-140047.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Coutu JD. Reduction of co-simulation runtime through parallel processing. [Thesis]. University of Saskatchewan; 2009. Available from: http://hdl.handle.net/10388/etd-09082009-140047
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Manitoba
9.
Martin, Daniel Morris.
Local independence in computed tomography as a basis for parallel computing.
Degree: Computer Science, 2007, University of Manitoba
URL: http://hdl.handle.net/1993/2818
► Iterative CT reconstruction algorithms are superior to the standard convolution backpropagation (CBP) methods when reconstructing from a small number of views (hence less radiation), but…
(more)
▼ Iterative CT reconstruction algorithms are superior to the standard convolution backpropagation (CBP) methods when reconstructing from a small number of views (hence less radiation), but are computationally costly. To reduce the execution time, this work implements and tests a
parallel approach to iterative algorithms using a cluster of workstations, which is a low cost system found in many offices and non-academic sites. A previous implementation showed little speedup because of the significant cost of inter-processor communication. In this thesis, several data partitioning methods are examined, including some image tiling methods that exploit the spatial locality demonstrated by local CT. Using these methods, computation can proceed locally, without the need for inter-processor communication during every iteration. A relative speedup of up to 17 times is obtained using 25 processors, demonstrating that good performance can be obtained running computationally intensive CT reconstruction algorithms on distributed memory hardware.
Advisors/Committee Members: Thulasiraman, Parimala (Computer Science), Li, Ben (Computer Science).
Subjects/Keywords: parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Martin, D. M. (2007). Local independence in computed tomography as a basis for parallel computing. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/2818
Chicago Manual of Style (16th Edition):
Martin, Daniel Morris. “Local independence in computed tomography as a basis for parallel computing.” 2007. Masters Thesis, University of Manitoba. Accessed September 26, 2018.
http://hdl.handle.net/1993/2818.
MLA Handbook (7th Edition):
Martin, Daniel Morris. “Local independence in computed tomography as a basis for parallel computing.” 2007. Web. 26 Sep 2018.
Vancouver:
Martin DM. Local independence in computed tomography as a basis for parallel computing. [Internet] [Masters thesis]. University of Manitoba; 2007. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1993/2818.
Council of Science Editors:
Martin DM. Local independence in computed tomography as a basis for parallel computing. [Masters Thesis]. University of Manitoba; 2007. Available from: http://hdl.handle.net/1993/2818
Georgia Tech
10.
Schieber, Matthew Cole.
Optimizing computational kernels in quantum chemistry.
Degree: MS, Computational Science and Engineering, 2018, Georgia Tech
URL: http://hdl.handle.net/1853/59949
► Density fitting is a rank reduction technique popularly used in quantum chemistry in order to reduce the computational cost of evaluating, transforming, and processing the…
(more)
▼ Density fitting is a rank reduction technique popularly used in quantum chemistry in
order to reduce the computational cost of evaluating, transforming, and processing the
4-center electron repulsion integrals (ERIs). By utilizing the resolution of the identity technique, density fitting reduces the 4-center ERIs into a 3-center form. Doing so not only alleviates the high storage cost of the ERIs, but it also reduces the computational cost of operations involving them. Still, these operations can remain as computational bottlenecks which commonly plague quantum chemistry procedures. The goal of this thesis is to investigate various optimizations for density-fitted version of computational kernels used ubiquitously throughout quantum chemistry. First, we detail the spatial sparsity available to the 3-center integrals and the application of such sparsity to various operations, including integral computation, metric contractions, and integral transformations. Next, we investigate sparse memory layouts and their implication on the performance of the integral transformation kernel. Next, we analyze two transformation algorithms and how their performance will vary depending on the context in which they are used. Then, we propose two sparse memory layouts and the resulting performance of Coulomb and exchange evaluations. Since the memory required for these tensors grows rapidly, we frame these discussions in the context of their in-core and disk performance. We implement these methods in the P SI 4 electronic structure package and reveal the optimal algorithm for the kernel should vary depending on whether a disk-based implementation must be used.
Advisors/Committee Members: Sherrill, Charles D. (advisor), Chow, Edmond (committee member), McDaniel, Jesse (committee member).
Subjects/Keywords: Quantum chemistry; Parallel computing; High performance computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Schieber, M. C. (2018). Optimizing computational kernels in quantum chemistry. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59949
Chicago Manual of Style (16th Edition):
Schieber, Matthew Cole. “Optimizing computational kernels in quantum chemistry.” 2018. Masters Thesis, Georgia Tech. Accessed September 26, 2018.
http://hdl.handle.net/1853/59949.
MLA Handbook (7th Edition):
Schieber, Matthew Cole. “Optimizing computational kernels in quantum chemistry.” 2018. Web. 26 Sep 2018.
Vancouver:
Schieber MC. Optimizing computational kernels in quantum chemistry. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1853/59949.
Council of Science Editors:
Schieber MC. Optimizing computational kernels in quantum chemistry. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59949
Louisiana State University
11.
Yang, Shuangyang.
A Persistent Storage Model for Extreme Computing.
Degree: PhD, Computer Sciences, 2014, Louisiana State University
URL: etd-10312014-133428
;
https://digitalcommons.lsu.edu/gradschool_dissertations/2910
► The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to…
(more)
▼ The continuing technological progress resulted in a dramatic growth in aggregate computational performance of the largest supercomputing systems. Unfortunately, these advances did not translate to the required extent into accompanying I/O systems and little more in terms of architecture or effective access latency. New classes of algorithms developed for massively parallel applications, that gracefully handle the challenges of asynchrony, heavily multi-threaded distributed codes, and message-driven computation, must be matched by similar advances in I/O methods and algorithms to produce a well performing and balanced supercomputing system. This dissertation proposes PXFS, a storage model for persistent objects inspired by the ParalleX model of execution that addresses many of these challenges. The PXFS model is designed to be asynchronous in nature to comply with ParalleX model and proposes an active TupleSpace concept to hold all kinds of metadata/meta-object for either storage objects or runtime objects. The new active TupleSpace can also register ParalleX actions to be triggered under certain tuple operations. An first implementation of PXFS utilizing a well-known Orange parallel file system as its back-end via asynchronous I/O layer and the implementation of TupleSpace component in HPX, the implementation of ParalleX. These details are also described along with the preliminary performance data. A house-made micro benchmark is developed to measure the disk I/O throughput of the PXFS asynchronous interface. The results show perfect scalability and 3x to 20x times speedup of I/O throughput performance comparing to OrangeFS synchronous user interface. Use cases of TupleSpace components are discussed for real-world applications including micro check-pointing. By utilizing TupleSpace in HPX applications for I/O, global barrier can be replaced with fine-grained parallelism to overlap more computation with communication and greatly boost the performance and efficiency. Also the dissertation showcases the distributed directory service in Orange file system which process directory entries in parallel and effectively improves the directory metada operations.
Subjects/Keywords: parallel computing; parallel file system; parallel runtime system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yang, S. (2014). A Persistent Storage Model for Extreme Computing. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910
Chicago Manual of Style (16th Edition):
Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Doctoral Dissertation, Louisiana State University. Accessed September 26, 2018.
etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.
MLA Handbook (7th Edition):
Yang, Shuangyang. “A Persistent Storage Model for Extreme Computing.” 2014. Web. 26 Sep 2018.
Vancouver:
Yang S. A Persistent Storage Model for Extreme Computing. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2018 Sep 26].
Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910.
Council of Science Editors:
Yang S. A Persistent Storage Model for Extreme Computing. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-10312014-133428 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2910
University of Tasmania
12.
Atkinson, AK.
Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment.
Degree: 2010, University of Tasmania
URL: https://eprints.utas.edu.au/9996/1/Alistair_Atkinson_PhD_Thesis.pdf
► This thesis describes Tupleware, an implementation of a distributed tuple space which acts as a scalable and efficient cluster middleware for computationally intensive numerical and…
(more)
▼ This thesis describes Tupleware, an implementation of a distributed tuple space which acts as a scalable and efficient cluster middleware for computationally intensive numerical and scientific applications. Tupleware is based on the Linda coordination language (Gelernter 1985), and incorporates additional techniques such as peer-to-peer communications and exploitation of data locality in order to address problems such as scalability and performance, which are commonly encountered by traditional centralised tuple space implementations.
Tupleware is implemented in such as way that, whilepr ocessing is taking place, all communication between cluster nodes is decentralised in a peer-to-peer fashion. Communication events are initiated by a node requesting a tuple which is located on a remote node, and in order to make tuple retrieval as efficient as possible, a tuple
search algorithm is used to minimise the number of communication instances required to retrieve a remote tuple. This algorithm is based on the locality of a remote
tuple and the success of previous remote tuple requests. As Tupleware is targetted at numerical applications which generally involve the partitioning and processing of 1-D or 2-D arrays, the locality of a remote tuple can generally be determined as being located on one of a small number nodes which are processing neighbouring partitions of the array.
Furthermore, unlike some other distributed tuple space implementations, Tupleware does not burden the programmer with any additional complexity due to this distribution. At the application level, the Tupleware middleware behaves exactly like a centralised tuple space, and provides much greater flexibility with regards to where components of a system are executed.
The design and implementation of Tupleware is described, and placed in the context of other distributed tuple space implementations, along with the specific requirements of the applications that the system caters for. Finally, Tupleware is evaluated using several numerical and/or scientific applications, which show it to provide a sufficient level of scalability for a broad range tasks.
The main contribution of this work is the identification of techniques which enable a tuple space to be efficiently and transparently distributed across the nodes in a cluster. Central to this is the use of an algorithm for tuple retrieval which minimises the number of communication instances which occur during system execution. Distribution transparency is ensured by the provision of a simple interface to the underlying system, so that the distributed tuple space appears to the programmer as a single unified resource.
It is hoped that this research in some way furthers the adoption of the tuple space programming model for distributed computing, by enhancing its ability to
provide improved performance, scalability, flexibility and simplicity for a range of applications not traditionally suited to tuple space based systems.
Subjects/Keywords: Distributed computing; parallel computing; concurrency; high-performance computing; tuple space.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Atkinson, A. (2010). Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment. (Thesis). University of Tasmania. Retrieved from https://eprints.utas.edu.au/9996/1/Alistair_Atkinson_PhD_Thesis.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Atkinson, AK. “Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment.” 2010. Thesis, University of Tasmania. Accessed September 26, 2018.
https://eprints.utas.edu.au/9996/1/Alistair_Atkinson_PhD_Thesis.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Atkinson, AK. “Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment.” 2010. Web. 26 Sep 2018.
Vancouver:
Atkinson A. Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment. [Internet] [Thesis]. University of Tasmania; 2010. [cited 2018 Sep 26].
Available from: https://eprints.utas.edu.au/9996/1/Alistair_Atkinson_PhD_Thesis.pdf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Atkinson A. Tupleware: a distributed tuple space for the development and execution of array-based applications in a cluster computing environment. [Thesis]. University of Tasmania; 2010. Available from: https://eprints.utas.edu.au/9996/1/Alistair_Atkinson_PhD_Thesis.pdf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Vanderbilt University
13.
Varshneya, Pooja.
Distributed and Adaptive Parallel Computing for Computational Finance Applications.
Degree: MS, Computer Science, 2010, Vanderbilt University
URL: http://etd.library.vanderbilt.edu/available/etd-06082010-053600/
;
► Analysts, scientist, engineers, and multimedia professionals require massive processing power to analyze financial trends, create test simulations, model climate, compile code, render video, decode genomes…
(more)
▼ Analysts, scientist, engineers, and multimedia professionals require massive processing power to analyze financial trends, create test simulations, model climate, compile code, render video, decode genomes and other complex tasks. These group of applications can greatly benefit from the use of adaptive,
parallel computing middleware that can enable quick parallelization of existing applications and improve application performance by porting these applications on
parallel computing platforms like HPC clusters, clouds and multi-core machines.
This work focuses on benchmarking the performance of currently available
parallel computing frameworks: OpenMPI and Zircon middleware software, using computation-intensive financial computation applications like binomial option pricing and heston calibrations for option pricing and also compares and contrasts the pros and cons of the two frameworks.
Advisors/Committee Members: Dr. Aniruddha Gokhale (committee member), Dr. Douglas C. Schmidt (chair).
Subjects/Keywords: distributed adaptive computing; MPI; parallel computing; high performance computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Varshneya, P. (2010). Distributed and Adaptive Parallel Computing for Computational Finance Applications. (Masters Thesis). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-06082010-053600/ ;
Chicago Manual of Style (16th Edition):
Varshneya, Pooja. “Distributed and Adaptive Parallel Computing for Computational Finance Applications.” 2010. Masters Thesis, Vanderbilt University. Accessed September 26, 2018.
http://etd.library.vanderbilt.edu/available/etd-06082010-053600/ ;.
MLA Handbook (7th Edition):
Varshneya, Pooja. “Distributed and Adaptive Parallel Computing for Computational Finance Applications.” 2010. Web. 26 Sep 2018.
Vancouver:
Varshneya P. Distributed and Adaptive Parallel Computing for Computational Finance Applications. [Internet] [Masters thesis]. Vanderbilt University; 2010. [cited 2018 Sep 26].
Available from: http://etd.library.vanderbilt.edu/available/etd-06082010-053600/ ;.
Council of Science Editors:
Varshneya P. Distributed and Adaptive Parallel Computing for Computational Finance Applications. [Masters Thesis]. Vanderbilt University; 2010. Available from: http://etd.library.vanderbilt.edu/available/etd-06082010-053600/ ;
Northeastern University
14.
Sun, Enqiang.
Cross-platform heterogeneous runtime environment.
Degree: PhD, Department of Electrical and Computer Engineering, 2016, Northeastern University
URL: http://hdl.handle.net/2047/D20213163
► Heterogeneous platforms are becoming widely adopted thanks for the support from new languages and programming models. Among these languages/models, OpenCL is an industry standard for…
(more)
▼ Heterogeneous platforms are becoming widely adopted thanks for the support from new languages and programming models. Among these languages/models, OpenCL is an industry standard for parallel programming on heterogeneous devices. With OpenCL, compute-intensive portions of an application can be offloaded to a variety of processing units within a system. OpenCL is one of the first standards that focuses on portability, allowing programs to be written once and run unmodified on multiple heterogeneous devices, regardless of vendor.; While OpenCL has been widely adopted, there still remains a lack of support for automatic workload balancing and data consistency when multiple devices are present in the system. To address this need, we have designed a cross-platform heterogeneous runtime environment which provides a high-level, unified execution model that is coupled with an intelligent resource management facility. The main motivation for developing this runtime environment is to provide OpenCL programmers with a convenient programming paradigm to fully utilize all possible devices in a system and incorporate flexible workload balancing schemes without compromising the user's ability to assign tasks according to the data affinity. Our work removes much of the cumbersome initialization of the platform, and now devices and related OpenCL objects are hidden under the hood.; Equipped with this new runtime environment and associated programming interface, the programmer can focus on designing the application and worry less about customization to the target platform. Further, the programmer can now take advantage of multiple devices using a dynamic workload balancing algorithm to reap the benefits of task-level parallelism.; To demonstrate the value of this cross-platform heterogeneous runtime environment, we have evaluated it running both micro benchmarks and popular OpenCL benchmark applications. With minimal overhead of managing data objects across devices, the experimental results show a scalable performance speedup with increasing number of computing devices, without any changes of program source code.
Subjects/Keywords: parallel computing; runtime; Heterogeneous computing; Parallel programming (Computer science); Parallel processing (Electronic computers); Parallel computers; Electronic data processing; Distributed processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sun, E. (2016). Cross-platform heterogeneous runtime environment. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20213163
Chicago Manual of Style (16th Edition):
Sun, Enqiang. “Cross-platform heterogeneous runtime environment.” 2016. Doctoral Dissertation, Northeastern University. Accessed September 26, 2018.
http://hdl.handle.net/2047/D20213163.
MLA Handbook (7th Edition):
Sun, Enqiang. “Cross-platform heterogeneous runtime environment.” 2016. Web. 26 Sep 2018.
Vancouver:
Sun E. Cross-platform heterogeneous runtime environment. [Internet] [Doctoral dissertation]. Northeastern University; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/2047/D20213163.
Council of Science Editors:
Sun E. Cross-platform heterogeneous runtime environment. [Doctoral Dissertation]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20213163
University of Utah
15.
Hunsaker, Isaac L.
Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations.
Degree: PhD, Chemical Engineering, 2015, University of Utah
URL: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4020/rec/1795
► Radiation is the dominant mode of heat transfer in high temperature combustion environments. Radiative heat transfer affects the gas and particle phases, including all the…
(more)
▼ Radiation is the dominant mode of heat transfer in high temperature combustion environments. Radiative heat transfer affects the gas and particle phases, including all the associated combustion chemistry. The radiative properties are in turn affected by the turbulent flow field. This bi-directional coupling of radiation turbulence interactions poses a major challenge in creating parallel-capable, high-fidelity combustion simulations. In this work, a new model was developed in which reciprocal monte carlo radiation was coupled with a turbulent, large-eddy simulation combustion model. A technique wherein domain patches are stitched together was implemented to allow for scalable parallelism. The combustion model runs in parallel on a decomposed domain. The radiation model runs in parallel on a recomposed domain. The recomposed domain is stored on each processor after information sharing of the decomposed domain is handled via the message passing interface. Verification and validation testing of the new radiation model were favorable. Strong scaling analyses were performed on the Ember cluster and the Titan cluster for the CPU-radiation model and GPU-radiation model, respectively. The model demonstrated strong scaling to over 1,700 and 16,000 processing cores on Ember and Titan, respectively.
Subjects/Keywords: combustion; parallel computing; radiation; ray tracing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hunsaker, I. L. (2015). Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4020/rec/1795
Chicago Manual of Style (16th Edition):
Hunsaker, Isaac L. “Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations.” 2015. Doctoral Dissertation, University of Utah. Accessed September 26, 2018.
http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4020/rec/1795.
MLA Handbook (7th Edition):
Hunsaker, Isaac L. “Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations.” 2015. Web. 26 Sep 2018.
Vancouver:
Hunsaker IL. Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations. [Internet] [Doctoral dissertation]. University of Utah; 2015. [cited 2018 Sep 26].
Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4020/rec/1795.
Council of Science Editors:
Hunsaker IL. Parallel distributed, reciprocal monte carlo radiation in coupled, large eddy combustion simulations. [Doctoral Dissertation]. University of Utah; 2015. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4020/rec/1795
University of Newcastle Upon Tyne
16.
Chen, Xian.
Automatic parallelisation for a class of URE problems.
Degree: PhD, 1995, University of Newcastle Upon Tyne
URL: http://hdl.handle.net/10443/1974
► This thesis deals with the methodology and software of automatic parallelisation for numerical supercomputing and supercomputers. Basically, we focus on the problem of Uniform Recurrence…
(more)
▼ This thesis deals with the methodology and software of automatic parallelisation for numerical supercomputing and supercomputers. Basically, we focus on the problem of Uniform Recurrence Equations (URE) which exists widely in numerical computations. vVepropose a complete methodology of automatic generation of parallel programs for regular array designs. The methodology starts with an introduction of a set of canonical dependencies which generates a general modelling of the various URE problems. Based on these canonical dependencies, partitioning and mapping methods are developed which gives the foundation of the universal design process. Using the theoretical results we propose the structures of parallel programs and eventually generate automatically parallel codes which run correctly and efficiently on transputer array. The achievements presented in this thesis can be regarded as a significant progress in the area of automatic generation of parallel codes and regular (systolic) array design. This methodology is integrated and self-contained, and may be the only practical working package in this area.
Subjects/Keywords: 005; Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, X. (1995). Automatic parallelisation for a class of URE problems. (Doctoral Dissertation). University of Newcastle Upon Tyne. Retrieved from http://hdl.handle.net/10443/1974
Chicago Manual of Style (16th Edition):
Chen, Xian. “Automatic parallelisation for a class of URE problems.” 1995. Doctoral Dissertation, University of Newcastle Upon Tyne. Accessed September 26, 2018.
http://hdl.handle.net/10443/1974.
MLA Handbook (7th Edition):
Chen, Xian. “Automatic parallelisation for a class of URE problems.” 1995. Web. 26 Sep 2018.
Vancouver:
Chen X. Automatic parallelisation for a class of URE problems. [Internet] [Doctoral dissertation]. University of Newcastle Upon Tyne; 1995. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10443/1974.
Council of Science Editors:
Chen X. Automatic parallelisation for a class of URE problems. [Doctoral Dissertation]. University of Newcastle Upon Tyne; 1995. Available from: http://hdl.handle.net/10443/1974
University of Sydney
17.
Pang, Xiaolin.
Scalable Algorithms for Outlier Detection
.
Degree: 2014, University of Sydney
URL: http://hdl.handle.net/2123/11743
► Outlier detection is an important problem for the data mining community as outliers often embody potentially new and valuable information. Nowadays, in the face of…
(more)
▼ Outlier detection is an important problem for the data mining community as outliers often embody potentially new and valuable information. Nowadays, in the face of exponential growth in data generation, extracting outliers from such massive data sets is a non-trivial task and requires the design and implementation of new scalable algorithms which is the main focus of the thesis. More specifically, we make the following contributions:
We propose a new algorithm for detecting emerging outliers in traffic data by extending the Likelihood Ratio Test Statistics (LRT) framework. We also propose a general and efficient pattern mining approach for spatio-temporal outlier detection that is based on our statistical models.
We propose a unified parallel approach for LRT computation in GPGPU, multi-core and cloud cluster environments. We also present new algorithmic techniques for computing the Likelihood Ratio Test (LRT) in parallel for a large spatial data grid by utilizing these distributed architectures.
As a separate contribution, we present novel approaches which simultaneously perform clustering and outlier detection without specifying the number of clusters. These methods are formulated as an integer programming optimisation task.
Subjects/Keywords: scalable algorithms;
outlier detection;
parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Pang, X. (2014). Scalable Algorithms for Outlier Detection
. (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/11743
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Pang, Xiaolin. “Scalable Algorithms for Outlier Detection
.” 2014. Thesis, University of Sydney. Accessed September 26, 2018.
http://hdl.handle.net/2123/11743.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pang, Xiaolin. “Scalable Algorithms for Outlier Detection
.” 2014. Web. 26 Sep 2018.
Vancouver:
Pang X. Scalable Algorithms for Outlier Detection
. [Internet] [Thesis]. University of Sydney; 2014. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/2123/11743.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Pang X. Scalable Algorithms for Outlier Detection
. [Thesis]. University of Sydney; 2014. Available from: http://hdl.handle.net/2123/11743
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Georgia Tech
18.
Remley, Kyle E.
Development of methods for high performance computing applications of the deterministic stage of comet calculations.
Degree: PhD, Mechanical Engineering, 2016, Georgia Tech
URL: http://hdl.handle.net/1853/58610
► The Coarse Mesh Radiation Transport (COMET) method is a reactor physics method and code that has been used to solve whole core reactor eigenvalue and…
(more)
▼ The Coarse Mesh Radiation Transport (COMET) method is a reactor physics method and code that has been used to solve whole core reactor eigenvalue and flux distribution problems. A strength of the method is its formidable accuracy and computational efficiency. COMET solutions are computed to Monte Carlo accuracy on a single processor in a runtime that is several orders of magnitude faster than stochastic calculations. However, with the growing ubiquity of both shared and distributed memory
parallel machines and the desire to extend the method to allow for coupling to multiphysics and on-the-fly response generation, serial implementations of COMET calculations will become less desirable. It is under this motivation that an implementation for a
parallel execution of deterministic COMET calculations has been developed. COMET involves inner and outer iterations; inner iterations involve local calculations that can be carried out independently, making the algorithm amenable to parallelization. However, considerations for decomposing a problem and the distribution of data must be made. To allow for efficient
parallel implementation of a distributed algorithm, changes to response data access and sweep order are made, along with considerations for communications between processors. The
parallel code is implemented on several variants of the C5G7 benchmark problem to assess the scalability of the algorithm, and it is found that problems with larger numbers of coarse meshes increase the scalability of the code, which is an encouraging result. The code is further tested for full core reactor problems, where extremely efficient wall clock times (on the order of minutes) for solutions are achieved. Finally, application of the
parallel code to novel implementations of COMET (e.g., problems with high flux expansions) is discussed.
Advisors/Committee Members: Rahnema, Farzad (advisor), Petrovic, Bojan (committee member), Zhang, Dingkang (committee member), Morley, Tom (committee member), Haghighat, Alireza (committee member).
Subjects/Keywords: Coarse mesh transport; Parallel computing; Reactor physics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Remley, K. E. (2016). Development of methods for high performance computing applications of the deterministic stage of comet calculations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58610
Chicago Manual of Style (16th Edition):
Remley, Kyle E. “Development of methods for high performance computing applications of the deterministic stage of comet calculations.” 2016. Doctoral Dissertation, Georgia Tech. Accessed September 26, 2018.
http://hdl.handle.net/1853/58610.
MLA Handbook (7th Edition):
Remley, Kyle E. “Development of methods for high performance computing applications of the deterministic stage of comet calculations.” 2016. Web. 26 Sep 2018.
Vancouver:
Remley KE. Development of methods for high performance computing applications of the deterministic stage of comet calculations. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1853/58610.
Council of Science Editors:
Remley KE. Development of methods for high performance computing applications of the deterministic stage of comet calculations. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/58610
The Ohio State University
19.
Maddipati, Sai Ratna Kiran.
Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer.
Degree: MS, Computer Science and Engineering, 2016, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523
► In a thermodynamically unstable environment, the Boltzman-Transport Equation (BTE) defines the behavior of heat transfer-rate at each location in the environment, the direction of heat…
(more)
▼ In a thermodynamically unstable environment, the
Boltzman-Transport Equation (BTE) defines the behavior of heat
transfer-rate at each location in the environment, the direction of
heat transfer by the particles of the environment and the final
equilibrium temperature conditions of the environment. The BTE is a
very computationally intensive application and there is a need for
efficient parallelization. Parallelization implementation of this
application is explained along with brief details about several
techniques that have been used by others in past work. The
implementation involves several code-iterations of the BTE
application with distinct changes in order to compare and analyze
the performance and identify the reason for the performance
improvement or deterioration. Then, experimental results are
presented to show the resulting performance of the
implementation.
Advisors/Committee Members: Sadayappan, P (Advisor).
Subjects/Keywords: Computer Science; Parallel Computing, OpenMP, MPI
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Maddipati, S. R. K. (2016). Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523
Chicago Manual of Style (16th Edition):
Maddipati, Sai Ratna Kiran. “Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer.” 2016. Masters Thesis, The Ohio State University. Accessed September 26, 2018.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523.
MLA Handbook (7th Edition):
Maddipati, Sai Ratna Kiran. “Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer.” 2016. Web. 26 Sep 2018.
Vancouver:
Maddipati SRK. Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer. [Internet] [Masters thesis]. The Ohio State University; 2016. [cited 2018 Sep 26].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523.
Council of Science Editors:
Maddipati SRK. Improving the Parallel Performance of Boltzman-Transport
Equation for Heat Transfer. [Masters Thesis]. The Ohio State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1461334523
Université de Montréal
20.
Kemerchou, Nabil.
Logiciel de génération de nombres aléatoires dans OpenCL
.
Degree: 2016, Université de Montréal
URL: http://hdl.handle.net/1866/13473
► clRNG et clProbdist sont deux interfaces de programmation (APIs) que nous avons développées pour la génération de nombres aléatoires uniformes et non uniformes sur des…
(more)
▼ clRNG et clProbdist sont deux interfaces de programmation (APIs) que nous avons développées pour la génération de nombres aléatoires uniformes et non uniformes sur des dispositifs de calculs parallèles en utilisant l’environnement OpenCL. La première interface permet de créer au niveau d’un ordinateur central (hôte) des objets de type stream considérés comme des générateurs virtuels parallèles qui peuvent être utilisés aussi bien sur l’hôte que sur les dispositifs parallèles (unités de traitement graphique, CPU multinoyaux, etc.) pour la génération de séquences de nombres aléatoires. La seconde interface permet aussi de générer au niveau de ces unités des variables aléatoires selon
différentes lois de probabilité continues et discrètes. Dans ce mémoire, nous allons rappeler des notions de base sur les générateurs de nombres aléatoires, décrire les systèmes hétérogènes ainsi que les techniques de génération parallèle de nombres aléatoires. Nous présenterons aussi les différents modèles composant l’architecture de l’environnement OpenCL et détaillerons les structures des APIs développées. Nous distinguons pour clRNG les fonctions qui permettent la création des streams, les fonctions qui génèrent les variables aléatoires uniformes ainsi que celles qui manipulent les états des streams. clProbDist contient les fonctions de génération de variables aléatoires non uniformes selon la technique d’inversion ainsi que les fonctions qui permettent de retourner différentes statistiques des lois de distribution implémentées. Nous évaluerons ces interfaces de programmation avec deux simulations qui implémentent un exemple simplifié d’un modèle d’inventaire et un exemple d’une option financière. Enfin, nous fournirons les résultats d’expérimentation sur les performances des générateurs implémentés.
Advisors/Committee Members: L'Écuyer, Pierre (advisor).
Subjects/Keywords: Rng;
Parallélisme;
OpenCL;
Gpu;
Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kemerchou, N. (2016). Logiciel de génération de nombres aléatoires dans OpenCL
. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/13473
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kemerchou, Nabil. “Logiciel de génération de nombres aléatoires dans OpenCL
.” 2016. Thesis, Université de Montréal. Accessed September 26, 2018.
http://hdl.handle.net/1866/13473.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kemerchou, Nabil. “Logiciel de génération de nombres aléatoires dans OpenCL
.” 2016. Web. 26 Sep 2018.
Vancouver:
Kemerchou N. Logiciel de génération de nombres aléatoires dans OpenCL
. [Internet] [Thesis]. Université de Montréal; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1866/13473.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kemerchou N. Logiciel de génération de nombres aléatoires dans OpenCL
. [Thesis]. Université de Montréal; 2016. Available from: http://hdl.handle.net/1866/13473
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Toronto
21.
Willenberg, Ruediger.
Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs.
Degree: PhD, 2016, University of Toronto
URL: http://hdl.handle.net/1807/77077
► We are presenting THeGASNet, a framework to provide remote memory communication and synchronization in heterogeneous, distributed systems composed of software components and FPGA components. It…
(more)
▼ We are presenting THeGASNet, a framework to provide remote memory communication and synchronization in heterogeneous, distributed systems composed of software components and FPGA components. It is intended as a runtime layer to support higher-level languages and libraries that implement the Partitioned Global Address Space(PGAS) model. PGAS is a shared memory
parallel programming model intended for high-productivity programming of distributed, cluster-like systems. THeGASNet provides a communication abstraction with a common API for both software and hardware components, thereby facilitating easier migration of performance-critical application portions to reconfigurable
computing hardware.
To demonstrate the development flow, we have implemented three applications representing common distributed application characteristics, starting with software-only solutions and using the common API to efficiently move selected parts into FPGA hardware. Based on the accumulated experience, we illustrate why PGAS is a good model to program heterogeneous systems using FPGAs, define minimum infrastructure requirements and outline a vision for continued exploration of heterogeneous PGAS programming.
Advisors/Committee Members: Chow, Paul, Electrical and Computer Engineering.
Subjects/Keywords: Accelerators; FPGAs; Heterogeneous; Parallel Computing; PGAS; 0464
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Willenberg, R. (2016). Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/77077
Chicago Manual of Style (16th Edition):
Willenberg, Ruediger. “Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs.” 2016. Doctoral Dissertation, University of Toronto. Accessed September 26, 2018.
http://hdl.handle.net/1807/77077.
MLA Handbook (7th Edition):
Willenberg, Ruediger. “Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs.” 2016. Web. 26 Sep 2018.
Vancouver:
Willenberg R. Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs. [Internet] [Doctoral dissertation]. University of Toronto; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1807/77077.
Council of Science Editors:
Willenberg R. Heterogeneous Runtime Support for Partitioned Global Address Space Programming on FPGAs. [Doctoral Dissertation]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/77077
Georgia Tech
22.
Wu, Jiadong.
Improving the throughput of novel cluster computing systems.
Degree: PhD, Electrical and Computer Engineering, 2015, Georgia Tech
URL: http://hdl.handle.net/1853/53890
► Traditional cluster computing systems such as the supercomputers are equipped with specially designed high-performance hardware, which escalates the manufacturing cost and the energy cost of…
(more)
▼ Traditional cluster
computing systems such as the supercomputers are equipped with specially designed high-performance hardware, which escalates the manufacturing cost and the energy cost of those systems. Due to such drawbacks and the diversified demand in computation, two new types of clusters are developed: the GPU clusters and the Hadoop clusters.
The GPU cluster combines traditional CPU-only
computing cluster with general purpose GPUs to accelerate the applications. Thanks to the massively-
parallel architecture of the GPU, this type of system can deliver much higher performance-per-watt than the traditional
computing clusters. The Hadoop cluster is another popular type of cluster
computing system. It uses inexpensive off-the-shelf component and standard Ethernet to minimize manufacturing cost. The Hadoop systems are widely used throughout the industry.
Alongside with the lowered cost, these new systems also bring their unique challenges. According to our study, the GPU clusters are prone to severe under-utilization due to the heterogeneous nature of its computation resources, and the Hadoop clusters are vulnerable to network congestion due to its limited network resources. In this research, we are trying to improve the throughput of these novel cluster
computing systems by increasing the workload parallelism and network I/O parallelism.
Advisors/Committee Members: Hong, Bo (advisor), Blough, Douglas (committee member), Wills, Linda (committee member), Mukhopadhyay, Saibal (committee member), Yi-Chang, Tsai (committee member).
Subjects/Keywords: GPU; Hadoop; Computer cluster; Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, J. (2015). Improving the throughput of novel cluster computing systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53890
Chicago Manual of Style (16th Edition):
Wu, Jiadong. “Improving the throughput of novel cluster computing systems.” 2015. Doctoral Dissertation, Georgia Tech. Accessed September 26, 2018.
http://hdl.handle.net/1853/53890.
MLA Handbook (7th Edition):
Wu, Jiadong. “Improving the throughput of novel cluster computing systems.” 2015. Web. 26 Sep 2018.
Vancouver:
Wu J. Improving the throughput of novel cluster computing systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/1853/53890.
Council of Science Editors:
Wu J. Improving the throughput of novel cluster computing systems. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53890
23.
-6059-0490.
Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation.
Degree: Computer Sciences, 2015, University of Texas – Austin
URL: http://hdl.handle.net/2152/33276
► A goal of computer science is to develop practical methods to automate tasks that are otherwise too complex or tedious to perform manually. Complex tasks…
(more)
▼ A goal of computer science is to develop practical methods to automate tasks
that are otherwise too complex or tedious to perform manually. Complex
tasks can include determining a practical algorithm and creating the
associated implementation for a given problem specification. Goal-oriented
programming can make this systematic. Therefore, we can rely on automated tools
to create implementations by expressing the task of creating implementations in
terms of goal-oriented programming. To do so, pertinent knowledge must be
encoded which requires a notation and language to define relevant abstractions.
This dissertation focuses on distributed-memory
parallel tensor
computations arising from computational chemistry. Specifically, we focus on
applications based on the tensor contraction operation of dense, non-symmetric
tensors. Creating an efficient algorithm for a given problem specification in
this domain is complex; creating an optimized implementation of a developed
algorithm is even more complex, tedious, and error-prone. To this end, we
encode pertinent knowledge for distributed-memory
parallel algorithms for tensor
contractions of dense non-symmetric tensors. We do this by developing a
notation for data distribution and redistribution that exposes a systematic
procedure for deriving a family of algorithms for this operation for which
efficient implementations exist.
We validate the developed ideas by implementing them in the Redistribution
Operations and Tensor Expressions application programming interface (ROTE API)
and encoding them into an automated system, DxTer, for systematically
generating efficient implementations from problem specifications. Experiments
performed on the IBM Blue Gene/Q and Cray XC30 architectures testing generated
implementations for the spin-adapted coupled cluster singles and doubles method
from computational chemistry demonstrate impact both in terms of performance and
storage requirements.
Advisors/Committee Members: Van de Geijn, Robert A. (advisor), Kolda, Tamara G. (advisor), Stanton, John F (committee member), Pingali, Keshav (committee member), Hammond, Jeff R (committee member), Batory, Don S (committee member).
Subjects/Keywords: High-performance computing; Parallel programming; Tensor computations
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-6059-0490. (2015). Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/33276
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
-6059-0490. “Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation.” 2015. Thesis, University of Texas – Austin. Accessed September 26, 2018.
http://hdl.handle.net/2152/33276.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
-6059-0490. “Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation.” 2015. Web. 26 Sep 2018.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-6059-0490. Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/2152/33276.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
-6059-0490. Distributed tensor computations: formalizing distributions, redistributions, and algorithm derivation. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/33276
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation
24.
Chitral, Pooja 1986-.
Accelerator Benchmark Suite Using OpenACC Directives.
Degree: Computer Science, 2014, University of Houston
URL: http://hdl.handle.net/10657/1686
► In recent years, GPU computing has been very popular for scientific applications, especially after the release of programming languages like CUDA, OpenCL, and OpenACC. The…
(more)
▼ In recent years, GPU
computing has been very popular for scientific applications, especially after the release of programming languages like CUDA, OpenCL, and OpenACC. The growing popularity of GPU computation in commercial and scientific fields is attributed to the high computational power of GPU cores. The accelerator benchmark suite using OpenACC 2.0 is a combination of very popular benchmarks – the Parboil and NAS
Parallel benchmarks. These benchmarks contain a wide range of throughput
computing applications, which are useful for studying the performance of
computing architectures and compilers. The Parboil benchmark includes applications from different scientific and commercial fields including image processing, biomolecular simulation, and astronomy. The NAS
Parallel benchmark has a set of applications that target different areas of computational fluid dynamics.
The accelerator benchmark suite that has been designed exploits the computational power of GPU architecture by using the emerging directives and clauses provided by OpenACC 2.0. This benchmark can act as a reference point for new programmers in GPU
computing, reducing the time taken to understand one of the most powerful
parallel programming paradigms.
Finally, the goal of the accelerator benchmark is to evaluate the applicability of one of the high-level programming models OpenACC for accelerators. This benchmark will help provide the OpenACC community with valuable feedback to improve the model further.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Gnawali, Omprakash (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: GPU computing; OpenACC; Parboil; NAS Parallel Benchmark
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chitral, P. 1. (2014). Accelerator Benchmark Suite Using OpenACC Directives. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1686
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chitral, Pooja 1986-. “Accelerator Benchmark Suite Using OpenACC Directives.” 2014. Thesis, University of Houston. Accessed September 26, 2018.
http://hdl.handle.net/10657/1686.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chitral, Pooja 1986-. “Accelerator Benchmark Suite Using OpenACC Directives.” 2014. Web. 26 Sep 2018.
Vancouver:
Chitral P1. Accelerator Benchmark Suite Using OpenACC Directives. [Internet] [Thesis]. University of Houston; 2014. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10657/1686.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chitral P1. Accelerator Benchmark Suite Using OpenACC Directives. [Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1686
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Virginia Tech
25.
Kannan, Vijayasarathy.
A Distributed Approach to EpiFast using Apache Spark.
Degree: MS, Computer Science, 2015, Virginia Tech
URL: http://hdl.handle.net/10919/55272
► EpiFast is a parallel algorithm for large-scale epidemic simulations, based on an interpretation of the stochastic disease propagation in a contact network. The original EpiFast…
(more)
▼ EpiFast is a
parallel algorithm for large-scale epidemic simulations, based on an interpretation of the stochastic disease propagation in a contact network. The original EpiFast
implementation is based on a master-slave computation model with a focus on distributed
memory using message-passing-interface (MPI). However, it suffers from few shortcomings
with respect to scale of networks being studied. This thesis addresses these shortcomings
and provides two different implementations: Spark-EpiFast based on the Apache Spark big
data processing engine and Charm-EpiFast based on the Charm++
parallel programming
framework. The study focuses on exploiting features of both systems that we believe could
potentially benefit in terms of performance and scalability. We present models of EpiFast
specific to each system and relate algorithm specifics to several optimization techniques. We
also provide a detailed analysis of these optimizations through a range of experiments that
consider scale of networks and environment settings we used. Our analysis shows that the
Spark-based version is more efficient than the Charm++ and MPI-based counterparts. To
the best of our knowledge, ours is one of the preliminary efforts of using Apache Spark for
epidemic simulations. We believe that our proposed model could act as a reference for similar
large-scale epidemiological simulations exploring non-MPI or MapReduce-like approaches.
Advisors/Committee Members: Marathe, Madhav Vishnu (committeechair), Marathe, Achla (committee member), Vullikanti, Anil Kumar S (committee member), Chen, Jiangzhuo (committee member).
Subjects/Keywords: computational epidemiology; parallel programming; distributed computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kannan, V. (2015). A Distributed Approach to EpiFast using Apache Spark. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/55272
Chicago Manual of Style (16th Edition):
Kannan, Vijayasarathy. “A Distributed Approach to EpiFast using Apache Spark.” 2015. Masters Thesis, Virginia Tech. Accessed September 26, 2018.
http://hdl.handle.net/10919/55272.
MLA Handbook (7th Edition):
Kannan, Vijayasarathy. “A Distributed Approach to EpiFast using Apache Spark.” 2015. Web. 26 Sep 2018.
Vancouver:
Kannan V. A Distributed Approach to EpiFast using Apache Spark. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10919/55272.
Council of Science Editors:
Kannan V. A Distributed Approach to EpiFast using Apache Spark. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/55272
Virginia Tech
26.
Kang, Pilsung.
Modular Implementation of Program Adaptation with Existing Scientific Codes.
Degree: Computer Science, 2010, Virginia Tech
URL: http://hdl.handle.net/10919/28783
► Often times, scientific software needs to be adapted for different execution environments, problem sets, and available resources to ensure its efficiency and reliability. Directly modifying…
(more)
▼ Often times, scientific software needs to be adapted for different execution environments, problem sets, and available resources to ensure its efficiency and reliability. Directly modifying source code to implement adaptation is time-consuming, error-prone, and difficult to manage for today's complex software. This thesis studies modular approaches to implementing program adaptation with existing scientific codes, whereby application-specific adaptation strategies can be implemented in separate code which is then transparently combined with a given program. By using the approaches developed in this thesis, scientific programmers can focus on the design and implementation of adaptation schemes, manage an adaptation code separately from the main program components, and compose an adaptive application whose original capabilities are enhanced in diverse aspects such as application performance and stability. The primary objective of the modular approaches in this study is to provide a language-independent development method of adapting existing scientific software, so that applications written in different languages can be supported when implementing adaptation schemes. In particular, the emphasis is on Fortran, which has been a mainstream language for programming scientific applications.
Three research questions are formulated in this thesis, each of which aims to: design and implement high-level abstractions for expressing adaptation strategies, develop a dynamic tuning approach for
parallel programs, and support flexible runtime adaptation schemes, respectively. The applicability of the proposed approaches is demonstrated through example applications to real-world scientific software.
Advisors/Committee Members: Varadarajan, Srinidhi (committeechair), Ribbens, Calvin J. (committee member), Tilevich, Eli (committee member), Tafti, Danesh K. (committee member), Ramakrishnan, Naren (committeecochair).
Subjects/Keywords: scientic computing; parallel programming; program adaptation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kang, P. (2010). Modular Implementation of Program Adaptation with Existing Scientific Codes. (Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28783
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kang, Pilsung. “Modular Implementation of Program Adaptation with Existing Scientific Codes.” 2010. Thesis, Virginia Tech. Accessed September 26, 2018.
http://hdl.handle.net/10919/28783.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kang, Pilsung. “Modular Implementation of Program Adaptation with Existing Scientific Codes.” 2010. Web. 26 Sep 2018.
Vancouver:
Kang P. Modular Implementation of Program Adaptation with Existing Scientific Codes. [Internet] [Thesis]. Virginia Tech; 2010. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10919/28783.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kang P. Modular Implementation of Program Adaptation with Existing Scientific Codes. [Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/28783
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
27.
Rhoden, Barret.
Operating System Support for Parallel Processes.
Degree: Computer Science, 2014, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/8gt545mj
► High-performance, parallel programs want uninterrupted access to physical resources. This characterization is true not only for traditional scientific computing, but also for high-priority data center…
(more)
▼ High-performance, parallel programs want uninterrupted access to physical resources. This characterization is true not only for traditional scientific computing, but also for high-priority data center applications that run on parallel processors. These applications require high, predictable performance and low latency, and they are important enough to warrant engineering effort at all levels of the software stack. Given the recent resurgence of interest in parallel computing as well as the increasing importance of data center applications, what changes can we make to operating system abstractions to support parallel programs?Akaros is a research operating system designed for single-node, large-scale SMP and many-core architectures. The primary feature of Akaros is a new process abstraction called the "Many-Core Process" (MCP) that embodies transparency, application control of physical resources, and performance isolation. The MCP is built on the idea of separating cores from threads: the operating system grants spatially partitioned cores to the MCP, and the application schedules its threads on those cores. Data centers typically have a mix of high-priority applications and background batch jobs, where the demands of the high-priority application can change over time. For this reason, an important part of Akaros is the provisioning, allocation, and preemption of resources, and the MCP must be able to handle having a resource revoked at any moment.In this work, I describe the MCP abstraction and the salient details of Akaros. I discuss how the kernel and user-level libraries work together to give an application control over its physical resources and to adapt to the revocation of cores at any time - even when the code is holding locks. I show an order of magnitude less interference for the MCP compared to Linux, more resilience to the loss of cores for an HPC application, and how a customized user-level scheduler can increase the performance of a simple webserver.
Subjects/Keywords: Computer science; Operating Systems; Parallel Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Rhoden, B. (2014). Operating System Support for Parallel Processes. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8gt545mj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Rhoden, Barret. “Operating System Support for Parallel Processes.” 2014. Thesis, University of California – Berkeley. Accessed September 26, 2018.
http://www.escholarship.org/uc/item/8gt545mj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Rhoden, Barret. “Operating System Support for Parallel Processes.” 2014. Web. 26 Sep 2018.
Vancouver:
Rhoden B. Operating System Support for Parallel Processes. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2018 Sep 26].
Available from: http://www.escholarship.org/uc/item/8gt545mj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Rhoden B. Operating System Support for Parallel Processes. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/8gt545mj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
28.
Washington, Ian D.
Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing.
Degree: PhD, 2016, McMaster University
URL: http://hdl.handle.net/11375/19092
► This research focuses on the development of a solution strategy for the optimization of large-scale dynamic systems under uncertainty. Uncertainty resides naturally within the external…
(more)
▼ This research focuses on the development of a solution strategy for the optimization of
large-scale dynamic systems under uncertainty. Uncertainty resides naturally within the
external forces posed to the system or from within the system itself. For example, in chemical
process systems, external inputs include flow rates, temperatures or compositions; while
internal sources include kinetic or mass transport parameters; and empirical parameters
used within thermodynamic correlations and expressions. The goal in devising a dynamic
optimization approach which explicitly accounts for uncertainty is to do so in a manner
which is computationally tractable and is general enough to handle various types and
sources of uncertainty. The approach developed in this thesis follows a so-called multiperiod
technique whereby the infinite dimensional uncertainty space is discretized at numerous
points (known as periods or scenarios) which creates different possible realizations of the
uncertain parameters. The resulting optimization formulation encompasses an approximated
expected value of a chosen objective functional subject to a dynamic model for all the
generated realizations of the uncertain parameters. The dynamic model can be solved,
using an appropriate numerical method, in an embedded manner for which the solution
is used to construct the optimization formulation constraints; or alternatively the model
could be completely discretized over the temporal domain and posed directly as part of the
optimization formulation.
Our approach in this thesis has mainly focused on the embedded model technique for
dynamic optimization which can either follow a single- or multiple-shooting solution method.
The first contribution of the thesis investigates a combined multiperiod multiple-shooting
dynamic optimization approach for the design of dynamic systems using ordinary differential
equation (ODE) or differential-algebraic equation (DAE) process models. A major aspect
of this approach is the analysis of the parallel solution of the embedded model within the
optimization formulation. As part of this analysis, we further consider the application of
the dynamic optimization approach to several design and operation applications. Another
vmajor contribution of the thesis is the development of a nonlinear programming (NLP) solver
based on an approach that combines sequential quadratic programming (SQP) with an
interior-point method (IPM) for the quadratic programming subproblem. A unique aspect of
the approach is that the inherent structure (and parallelism) of the multiperiod formulation
is exploited at the linear algebra level within the SQP-IPM nonlinear programming algorithm
using an explicit Schur-complement decomposition. Our NLP solution approach is further
assessed using several static and dynamic optimization benchmark examples.
Thesis
Doctor of Philosophy (PhD)
Advisors/Committee Members: Swartz, Christopher L.E., Chemical Engineering.
Subjects/Keywords: Dynamic Optimization; DAE process models; Parallel Computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Washington, I. D. (2016). Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/19092
Chicago Manual of Style (16th Edition):
Washington, Ian D. “Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing.” 2016. Doctoral Dissertation, McMaster University. Accessed September 26, 2018.
http://hdl.handle.net/11375/19092.
MLA Handbook (7th Edition):
Washington, Ian D. “Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing.” 2016. Web. 26 Sep 2018.
Vancouver:
Washington ID. Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing. [Internet] [Doctoral dissertation]. McMaster University; 2016. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/11375/19092.
Council of Science Editors:
Washington ID. Large-Scale Dynamic Optimization Under Uncertainty using Parallel Computing. [Doctoral Dissertation]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/19092
Universitat Autònoma de Barcelona
29.
Vera Rodríguez, Gonzalo.
R/parallel Parallel Computing for R in non‐dedicated environments.
Degree: Departament d'Arquitectura de Computadors i Sistemes Operatius, 2010, Universitat Autònoma de Barcelona
URL: http://hdl.handle.net/10803/121248
► Traditionally, parallel computing has been associated with special purpose applications designed to run in complex computing clusters, specifically set up with a software stack of…
(more)
▼ Traditionally,
parallel computing has been associated with special purpose
applications designed to run in complex
computing clusters, specifically set up with
a software stack of dedicated libraries together with advanced administration tools to
manage co Traditionally,
parallel computing has been associated with special purpose applications designed to run in complex
computing clusters, specifically set up with a software stack of dedicated libraries together with advanced administration tools to manage complex IT infrastructures. These High Performance
Computing (HPC) solutions, although being the most efficient solutions in terms of performance and scalability, impose technical and practical barriers for most common scientists whom, with reduced IT knowledge, time and resources, are unable to embrace classical HPC solutions without considerable efforts. Moreover, two important technology advances are increasing the need for
parallel computing. For example in the bioinformatics field, and similarly in other experimental science disciplines, new high throughput screening devices are generating huge amounts of data within very short time which requires their analysis in equally short time periods to avoid delaying experimental analysis. Another important technological change involves the design of new processor chips. To increase raw performance the current strategy is to increase the number of processing units per chip, so to make use of the new processing capacities
parallel applications are required. In both cases we find users that may need to update their current sequential applications and
computing resources to achieve the increased processing capacities required for their particular needs. Since
parallel computing is becoming a natural option for obtaining increased performance and it is required by new computer systems, solutions adapted for the mainstream should be developed for a seamless adoption. In order to enable the adoption of
parallel computing, new methods and technologies are required to remove or mitigate the current barriers and obstacles that prevent many users from evolving their sequential running environments. A particular scenario that specially suffers from these problems and that is considered as a practical case in this work consists of bioinformaticians analyzing molecular data with methods written with the R language. In many cases, with long datasets, they have to wait for days and weeks for their data to be processed or perform the cumbersome task of manually splitting their data, look for available computers to run these subsets and collect back the previously scattered results. Most of these applications written in R are based on
parallel loops. A loop is called a
parallel loop if there is no data dependency among all its iterations, and therefore any iteration can be processed in any order or even simultaneously, so they are susceptible of being parallelized.
Parallel loops are found in a large number of scientific applications. Previous contributions deal with partial aspects…
Advisors/Committee Members: [email protected] (authoremail), true (authoremailshow), Suppi Boldrito, Remo (director), true (authorsendemail).
Subjects/Keywords: Parallel loops; Oportunistic computing; Bioinformatics; Tecnologies; 004
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vera Rodríguez, G. (2010). R/parallel Parallel Computing for R in non‐dedicated environments. (Thesis). Universitat Autònoma de Barcelona. Retrieved from http://hdl.handle.net/10803/121248
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Vera Rodríguez, Gonzalo. “R/parallel Parallel Computing for R in non‐dedicated environments.” 2010. Thesis, Universitat Autònoma de Barcelona. Accessed September 26, 2018.
http://hdl.handle.net/10803/121248.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Vera Rodríguez, Gonzalo. “R/parallel Parallel Computing for R in non‐dedicated environments.” 2010. Web. 26 Sep 2018.
Vancouver:
Vera Rodríguez G. R/parallel Parallel Computing for R in non‐dedicated environments. [Internet] [Thesis]. Universitat Autònoma de Barcelona; 2010. [cited 2018 Sep 26].
Available from: http://hdl.handle.net/10803/121248.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Vera Rodríguez G. R/parallel Parallel Computing for R in non‐dedicated environments. [Thesis]. Universitat Autònoma de Barcelona; 2010. Available from: http://hdl.handle.net/10803/121248
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of New South Wales
30.
Di, Peng.
Automatic Parallelization of Tiled Stencil Loop Nests on GPUs.
Degree: Computer Science & Engineering, 2013, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/53495
► This thesis attempts to design and implement a compiler framework based on the polyhedral model. The compiler automatically parallelizes loop nests; especially stencil kernels, into…
(more)
▼ This thesis attempts to design and implement a compiler framework based on the polyhedral model. The compiler automatically parallelizes loop nests; especially stencil kernels, into efficient GPU code by loop tiling transformations which the polyhedral model describes. To enhance
parallel performance, we introduce three practically efficient techniques to process different types of loop nests. The experimental results of our compiler framework have demonstrated that these advanced techniques can outperform previous approaches.
Firstly, we aim to find efficient tiling transformations without violating data dependences. How to select a tile's shape and size is an open issue that is performance-critical and influenced by GPU's hardware constraints.
We propose an approach to determine the tile shapes out of consideration for improving two-level parallelism of GPUs. The new approach finds appropriate tiling hyperplanes by embedding parallelism-enhancing constraints into the polyhedral model to maximize intra-tile, i.e., intra-SM parallelism. This improves the load balance among the streaming processors (SPs), which execute a wavefront of loop iterations within a tile. We eliminate parallelism-hindering false dependences to optimize inter-tile, i.e., inter-SM parallelism. This improves the load balance among the streaming multiprocessors (SMs), which execute a wavefront of tiles.
Furthermore, to avoid combinatorial explosion of tile size's configurations, we present a model-driven approach to automating tile size selection that is performance-critical for loop tiling transformations, especially for DOACROSS loop nests. Our tile size selection model accurately estimates the execution times of tiled loop nests running on GPUs. The selected tile sizes lead to the performance results that are close to the best observed for a range of problem sizes tested.
Finally, to address the difficulty and low-performance of parallelizing widely used SOR stencil loop nests, we present a new tiled
parallel SOR method, called MLSOR, which admits more efficient data-
parallel SIMD execution on GPUs. Unlike the previous two approaches that are dependence-preserving, the basic idea is to algorithmically restructure a stencil kernel based on a non-dependence-preserving parallelization scheme to avoid pipelining for higher parallelism. The new approach can be implemented in compilers through a pattern matching pass to optimize SOR-like DOACROSS loop nests on GPUs.
Advisors/Committee Members: Xue, Jingling, Computer Science & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Compiler; GPU; Loop tiling; Parallel computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Di, P. (2013). Automatic Parallelization of Tiled Stencil Loop Nests on GPUs. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/53495
Chicago Manual of Style (16th Edition):
Di, Peng. “Automatic Parallelization of Tiled Stencil Loop Nests on GPUs.” 2013. Doctoral Dissertation, University of New South Wales. Accessed September 26, 2018.
http://handle.unsw.edu.au/1959.4/53495.
MLA Handbook (7th Edition):
Di, Peng. “Automatic Parallelization of Tiled Stencil Loop Nests on GPUs.” 2013. Web. 26 Sep 2018.
Vancouver:
Di P. Automatic Parallelization of Tiled Stencil Loop Nests on GPUs. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2018 Sep 26].
Available from: http://handle.unsw.edu.au/1959.4/53495.
Council of Science Editors:
Di P. Automatic Parallelization of Tiled Stencil Loop Nests on GPUs. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/53495
◁ [1] [2] [3] [4] [5] … [29] ▶
. 
Open Access Theses and Dissertations
