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.

Bor Chan

dblp:08/7515 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Systems, architecture and hardware · 2

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
2 papers
High-performance computing · 83% Parallel and multicore computing · 17%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 60% Computational science and engineering · 40%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
performance optimization at scale
0.112012
Toward real-time modeling of human heart ventricles at cellular resolution: simulation of drug-induced arrhythmias · SC 2012
High-performance computing › large-scale simulation
petascale simulation
0.112012
Toward real-time modeling of human heart ventricles at cellular resolution: simulation of drug-induced arrhythmias · SC 2012
High-performance computing › scientific computing systems
molecular dynamics simulation
0.112009
Beyond homogeneous decomposition: scaling long-range forces on Massively Parallel Systems · SC 2009
Parallel and multicore computing › parallelization strategies
parallel decomposition
0.112009
Beyond homogeneous decomposition: scaling long-range forces on Massively Parallel Systems · SC 2009
High-performance computing
scientific computing systems
0.112009
Beyond homogeneous decomposition: scaling long-range forces on Massively Parallel Systems · SC 2009
Computational science and engineering › computational physics
plasma physics simulation
0.012009
Beyond homogeneous decomposition: scaling long-range forces on Massively Parallel Systems · SC 2009

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

parallel scaling · 0.3cellular-resolution simulation · 0.3long-range force computation · 0.2heterogeneous decomposition · 0.2
YearPublicationVenuePosition
2012 Toward real-time modeling of human heart ventricles at cellular resolution: simulation of drug-induced arrhythmias
abstract
We have developed a highly efficient and scalable cardiac electrophysiology simulation capability that supports groundbreaking resolution and detail to elucidate the mechanisms of sudden cardiac death from arrhythmia. We can simulate thousands of heartbeats at a resolution of 0.1 mm, comparable to the size of cardiac cells, thereby enabling scientific inquiry not previously possible. Based on scaling results from the partially deployed Sequoia IBM Blue Gene/Q machine at Lawrence Livermore National Laboratory and planned optimizations, we estimate that by SC12 we will simulate 8 -- 10 heartbeats per minute -- a time-to-solution 400 -- 500 times faster than the state-of-the-art. Performance between 8 and 11 PFlop/s on the full 1,572,864 cores is anticipated, representing 40 -- 55 percent of peak. The power of the model is demonstrated by illuminating the subtle arrhythmogenic mechanisms of anti-arrhythmic drugs that paradoxically increase arrhythmias in some patient populations.
Arthur A. Mirin, David F. Richards, James N. Glosli, Erik W. Draeger, Bor Chan, Jean-Luc Fattebert, William D. Krauss, Tomas Oppelstrup, John Jeremy Rice, John A. Gunnels, Viatcheslav Gurev, Changhoan Kim, John Magerlein, Matthias Reumann, Hui-Fang Wen
SC5
2009 Beyond homogeneous decomposition: scaling long-range forces on Massively Parallel Systems
abstract
With supercomputers anticipated to expand from thousands to millions of cores, one of the challenges facing scientists is how to effectively utilize this ever-increasing number. We report here an approach that creates a heterogeneous decomposition by partitioning effort according to the scaling properties of the component algorithms. We demonstrate our strategy by developing a capability to model hot dense plasma. We have performed benchmark calculations ranging from millions to billions of charged particles, including a 2.8 billion particle simulation that achieved 259.9 TFlop/s (26% of peak performance) on the 294,912 cpu JUGENE computer at the Jülich Supercomputing Centre in Germany. With this unprecedented simulation capability we have begun an investigation of plasma fusion physics under conditions where both theory and experiment are lacking--in the strongly-coupled regime as the plasma begins to burn.
David F. Richards, James N. Glosli, Bor Chan, Milo R. Dorr, Erik W. Draeger, Jean-Luc Fattebert, William D. Krauss, Thomas E. Spelce, Frederick H. Streitz, Michael P. Surh, John A. Gunnels
SC3