Search for: All records

We present new algorithms for the parallelization of Eulerian–Lagrangian interaction operations in the immersed boundary method. Our algorithms rely on two well-studied parallel primitives: key-value sort and segmented reduce. The use of these parallel primitives allows us to implement our algorithms on both graphics processing units (GPUs) and on other shared-memory architectures. We present strong and weak scaling tests on problems involving scattered points and elastic structures. Our tests show that our algorithms exhibit near-ideal scaling on both multicore CPUs and GPUs.

 

Abstract Computational models of various facets of hemostasis and thrombosis have increased substantially in the last decade. These models have the potential to make predictions that can uncover new mechanisms within the complex dynamics of thrombus formation. However, these predictions are only as good as the data and assumptions they are built upon, and therefore model building requires intimate coupling with experiments. The objective of this article is to guide the reader through how a computational model is built and how it can inform and be refined by experiments. This is accomplished by answering six questions facing the model builder: (1) Why make a model? (2) What kind of model should be built? (3) How is the model built? (4) Is the model a “good” model? (5) Do we believe the model? (6) Is the model useful? These questions are answered in the context of a model of thrombus formation that has been successfully applied to understanding the interplay between blood flow, platelet deposition, and coagulation and in identifying potential modifiers of thrombin generation in hemophilia A.