Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Suchuan Dong

dblp:11/1826 · also Suchuan (Steven) Dong · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2007
0000-0001-6778-0679ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
High-performance computing · 46% Parallel and multicore computing · 46% Distributed systems · 8%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational science and engineering · 74% Medical and health informatics · 26%

Topics — the 13 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › scientific visualization
in-situ visualization
0.112007
Runtime Visualization of the Human Arterial Tree · IEEE Trans. Vis. Comput. Graph. 2007
Visualization and visual analytics
scientific visualization
0.112007
Runtime Visualization of the Human Arterial Tree · IEEE Trans. Vis. Comput. Graph. 2007
Computational science and engineering › computational mechanics
biomechanical simulation
0.112006
Poster reception - Human arterial tree simulation on TeraGrid · SC 2006
High-performance computing › scientific computing systems
computational fluid dynamics
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002
Parallel and multicore computing › parallel programming models › hybrid programming models
hybrid MPI/OpenMP
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002
Parallel and multicore computing
parallel programming models
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002
High-performance computing › finite element method
spectral-element method
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002
High-performance computing
large-scale simulation
0.012007
Runtime Visualization of the Human Arterial Tree · IEEE Trans. Vis. Comput. Graph. 2007
Distributed systems
grid computing
0.012006
Poster reception - Human arterial tree simulation on TeraGrid · SC 2006
Parallel and multicore computing › parallel programming models
message passing
0.012006
Poster reception - Human arterial tree simulation on TeraGrid · SC 2006
High-performance computing
parallel numerical algorithms
0.012006
Poster reception - Human arterial tree simulation on TeraGrid · SC 2006
Parallel and multicore computing › parallel programming models › directive-based programming
OpenMP
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.012002
Dual-level parallelism for deterministic and stochastic CFD problems · SC 2002

Methods — techniques the papers use, named apart from their topics

runtime monitoring · 0.2topology-aware data distribution · 0.1MPICH-G2 · 0.1workload splitting · 0.0p-refinement · 0.0
YearPublicationVenuePosition
2007 Runtime Visualization of the Human Arterial Tree
abstract
Large-scale simulation codes typically execute for extended periods of time and often on distributed computational resources. Because these simulations can run for hours, or even days, scientists like to get feedback about the state of the computation and the validity of its results as it runs. It is also important that these capabilities be made available with little impact on the performance and stability of the simulation. Visualizing and exploring data in the early stages of the simulation can help scientists identify problems early, potentially avoiding a situation where a simulation runs for several days, only to discover that an error with an input parameter caused both time and resources to be wasted. We describe an application that aids in the monitoring and analysis of a simulation of the human arterial tree. The application provides researchers with high-level feedback about the state of the ongoing simulation and enables them to investigate particular areas of interest in greater detail. The application also offers monitoring information about the amount of data produced and data transfer performance among the various components of the application.
Joseph A. Insley, Michael E. Papka, Suchuan Dong, George Em Karniadakis, Nicholas T. Karonis
IEEE Trans. Vis. Comput. Graph.3
2006 Grid solutions for biological and physical cross-site simulations on the TeraGrid
abstract
Computational grids and grid middleware offer unprecedented computational power and storage capacity, and thus, have opened the possibility of solving problems that was previously not possible on even the largest single computational resources. These opportunities notwithstanding, the development of grid applications that run efficiently remains a challenge due to the inherent heterogeneity of networks and system architectures inherent in such environments. We present grid solutions to two grand challenge problems in computational mechanics. To study the scalability of our solutions we implemented both as MPI applications and ran them on the TeraGrid using NEKTAR and MPICH-G2. We present the results of our study which demonstrate near linear scalability in both applications when run across multiple TeraGrid sites and at a scale of hundreds or processors
Suchuan Dong, Nicholas T. Karonis, George Em Karniadakis
IPDPS1
2006 Poster reception - Human arterial tree simulation on TeraGrid
abstract
The human arterial tree consists of a complex network of branching blood vessels leading from the heart to arterioles, capillaries, and venules - comprising the microcirculation. The numerical simulation of the blood flow in a single part of the human arterial tree requires hundreds of CPUs; a full human arterial tree will require thousands of CPUs. Nowadays, we can use geographically distributed supercomputers connected by a fast network to perform large-scale simulations.Nektar-G2 is the grid-enabled version of Nektar, software developed at Brown University, that allows to solve problems on geographically distributed supercomputers. The topology-aware feature of MPICH-G2 is utilized to enforce an efficient data distribution strategy. Multi-level message passing algorithms minimizes the inter-site communication. Our ultimate goal is to model blood flow interaction of different regions of the cardiovascular system and to establish a biomechanics gateway on the TeraGrid.During poster presentation we will present results of ongoing project.
Leopold Grinberg, Suchuan Dong, James Noble 0002, Alexander Yakhot, George Em Karniadakis, Nicholas T. Karonis
SC2
2006 Simulating and visualizing the human arterial system on the TeraGrid
Suchuan Dong, Joseph A. Insley, Nicholas T. Karonis, Michael E. Papka, Justin Binns, George Em Karniadakis
Future Gener. Comput. Syst.1
2004 Dual-level parallelism for high-order CFD methods
Suchuan Dong, George Em Karniadakis
Parallel Comput.1
2002 Dual-level parallelism for deterministic and stochastic CFD problems
abstract
A hybrid two-level parallelism using MPI/OpenMP is implemented in the general-purpose spectral/hp element CFD code NekTar to take advantage of the hierarchical structures arising in deterministic and stochastic CFD problems. We take a coarse grain approach to shared-memory parallelism with OpenMP and employ a workload-splitting scheme that can reduce the OpenMP synchronizations to the minimum. The hybrid implementation shows good scalability with respect to both the problem size and the number of processors in case of a fixed problem size. With the same number of processors, the hybrid model with 2 (or 4) OpenMP threads per MPI process is observed to perform better than pure MPI and pure OpenMP on the NCSA SGI Origin 2000, while the pure MPI model performs the best on the IBM SP3 at SDSC and on the Compaq Alpha cluster at PSC. A key new result is that the use of threads facilitates effectively p-refinement, which is crucial to adaptive discretization using high-order methods.
Suchuan Dong, George Em Karniadakis
SC1