Browsing UMBC Mathematics and Statistics Department by Title
Now showing items 149168 of 232

Parallel Hyperparameter Tuning of Accuracy for Deep Learning based Tornado Predictions
Predicting violent storms and dangerous weather conditions with current physics based weather models can take a long time due to the immense complexity associated with numerical simulations. Machine learning has the potential ... 
Parallel Performance Studies for a 3D Elliptic Test Problem on the 2018 Portion of the Taki Cluster
The new 2018 nodes in the CPU cluster taki in the UMBC High Performance Computing Facility contain two 18core Intel Skylake CPUs and 384 GB of memory per node, connected by an EDR (Enhanced Data Rate) InfiniBand interconnect. ... 
Parallel Performance Studies for a Clustering Algorithm
(2008)Affinity propagation is a clustering algorithm that functions by identifying similar datapoints in an iterative process. Its structure allows for taking full advantage of parallel computing by enabling the solution of ... 
Parallel Performance Studies for a Hyperbolic Test Problem
(2008)The performance of parallel computer code depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. ... 
Parallel Performance Studies for a Maximum Likelihood Estimation Problem Using TAO
(2009)In this report, we present an application of parallel computing to an estimation procedure in statistics. The method of maximum likelihood estimation (MLE) is based on the ability to perform maximizations of probability ... 
Parallel Performance Studies for a Parabolic Test Problem
(2008)The performance of a parallel computer depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. This ... 
Parallel Performance Studies for a Parabolic Test Problem on maya 2013
(2014)We report parallel performance studies on the newest portion of the cluster maya in the UMBC High Performance Computing Facility (HPCF), referred to as maya 2013, for a parabolic test problem given by a timedependent, ... 
Parallel Performance Studies for a Parabolic Test Problem on the Cluster maya
(2015)We report parallel performance studies on each of the three uniform portions, from 2009, 2010, and 2013, of the cluster maya in the UMBC High Performance Computing Facility (HPCF) for a parabolic test problem given by a ... 
Parallel Performance Studies for a Parabolic Test Problem on the Cluster tara
(2010)The performance of parallel computer code depends on the intricate interplay of processors, the architecture of the computer nodes, their interconnect network, the numerical algorithm, and its implementation. The solution ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on maya 2013
(2014)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical method, and its implication. ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on the Cluster maya
(2015)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical method, and its implication. ... 
Parallel Performance Studies for a ThreeSpecies Application Problem on the Cluster tara
(2010)High performance parallel computing depends on the interaction of a number of factors including the processors, the architecture of the compute nodes, their interconnect network, and the numerical code. In this note, we ... 
Parallel Performance Studies for an Elliptic Test Problem
(2008)The performance of parallel computer code depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and the scheduling policy used. The ... 
Parallel Performance Studies for an Elliptic Test Problem on the 2018 Portion of the Taki Cluster
The new 2018 nodes in the CPU cluster taki in the UMBC High Performance Computing Facility contain two 18core Intel Skylake CPUs and 384 GB of memory per node, connected by an EDR (Enhanced Data Rate) InfiniBand interconnect. ... 
Parallel Performance Studies for an Elliptic Test Problem on the Cluster maya
(2014)The UMBC High Performance Computing Facility (HPCF) is the communitybased, interdisciplinary core facility for scientific computing and research on parallel algorithms at UMBC. Released in Summer 2014, the current machine ... 
Parallel Performance Studies for an Elliptic Test Problem on the Cluster maya (2015)
The UMBC High Performance Computing Facility (HPCF) is the communitybased, interdisciplinary core facility for scienti c computing and research on parallel algorithms at UMBC. Released in Summer 2014, the current machine ... 
Parallel Performance Studies for an Elliptic Test Problem on the Cluster tara
(2010)The performance of parallel computer code depends on an intricate interplay of the processors, the architecture of the compute nodes, their interconnect network, the numerical algorithm, and its implementation. The solution ... 
Parallel Performance Studies for an Elliptic Test Problem on the Stampede2 Cluster and Comparison of Networks
(2018)We study the parallel performance of dualsocket compute nodes with Intel Xeon Platinum 8160 Skylake CPUs with 24 cores and 192 GB of memory, connected by a 100 Gbps Intel OmniPath (OPA) interconnect. The experimenets use ... 
A Parallel Performance Study of the Highorder Compact Direct Flux Reconstruction Method for Conservation Laws on Maya Cluster
(2017)The compact direct flux reconstruction method (CDFR) for conservation laws utilizes techniques from compact finite difference methods to directly approximate spatial derivatives of fluxes within standard elements. The CDFR ... 
Parallel studies for chemically reacting systems
(20090806)Parallel computing code can be applied to solve chemically reacting systems. In a well stirred chemical system, the number of molecules for each species can be solved by implicit tau method, and the histogram of the method ...