Orthogonal Recursive Bisection as Data Decomposition Strategy for Massively Parallel Cardiac Simulations on the IBM Blue Gene/L Supercomputer

Title in journal: Orthogonal Recursive Bisection as Data Decomposition Strategy for Massively Parallel Cardiac Simulations

Whole organ heart models with biophysically detailed representation of cells present a large computational challenge. A high speed processor can require several days to weeks to simulate a single heartbeat. Due to the apparent end of processor frequency increases, improving performance will require that work is spread among many processors. Significant performance improvements will require efficiently exploiting correspondingly large numbers of processors that produces load balancing challenges that are complicated by the complex anatomy of the heart.

By: Matthias Reumann; Blake G. Fitch; Aleksandr Rayshubskiy; Michael C. Pitman; John J. Rice

Published in: Biomedizinische Technik, volume 56, (no 3), pages 129-45 in 2011

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to reports@us.ibm.com .