Parallel algorithms for direct blood flow simulations

Fluid mechanics of blood can be well approximated by a mixture model of a Newtonian fluid and deformable particles representing the red blood cells. Experimental and theoretical evidence suggests that the deformation and rheology of red blood cells is similar to that of phospholipid vesicles. Vesicles and red blood cells are both area preserving closed membranes that resist bending. Beyond red blood cells, vesicles can be used to investigate the behavior of cell membranes, intracellular organelles, and viral particles. Given the importance of vesicle flows, in this thesis we focus in efficient numerical methods for such problems: we present computationally scalable algorithms for the simulation of dilute suspension of deformable vesicles in two and three dimensions. Our method is based on the boundary integral formulation of Stokes flow. We present new schemes for simulating the three-dimensional hydrodynamic interactions of large number of vesicles with viscosity contrast. The algorithms incorporate a stable time-stepping scheme, high-order spatiotemporal discretizations, spectral preconditioners, and a reparametrization scheme capable of resolving extreme mesh distortions in dynamic simulations. The associated linear systems are solved in optimal time using spectral preconditioners. The highlights of our numerical scheme are that (i) the physics of vesicles is faithfully represented by using nonlinear solid mechanics to capture the deformations of each cell, (ii) the long-range, N-body, hydrodynamic interactions between vesicles are accurately resolved using the fast multipole method (FMM), and (iii) our time stepping scheme is unconditionally stable for the flow of single and multiple vesicles with viscosity contrast and its computational cost-per-simulation-unit-time is comparable to or less than that of an explicit scheme. We report scaling of our algorithms to simulations with millions of vesicles on thousands of computational cores.PhDCommittee Chair: Biros, George; Committee Member: Alben, Silas; Committee Member: Fernandez-Nieves, Alberto; Committee Member: Hu, David; Committee Member: Vuduc, Richar

XSEDE: eXtreme Science and Engineering Discovery Environment Third Quarter 2012 Report

The Extreme Science and Engineering Discovery Environment (XSEDE) is the most advanced, powerful, and robust collection of integrated digital resources and services in the world. It is an integrated cyberinfrastructure ecosystem with singular interfaces for allocations, support, and other key services that researchers can use to interactively share computing resources, data, and expertise.This a report of project activities and highlights from the third quarter of 2012.National Science Foundation, OCI-105357

Unraveling the intricacies of spatial organization of the ErbB receptors and downstream signaling pathways

Faced with the complexity of diseases such as cancer which has 1012 mutations, altering gene expression, and disrupting regulatory networks, there has been a paradigm shift in the biological sciences and what has emerged is a much more quantitative field of biology. Mathematical modeling can aid in biological discovery with the development of predictive models that provide future direction for experimentalist. In this work, I have contributed to the development of novel computational approaches which explore mechanisms of receptor aggregation and predict the effects of downstream signaling. The coupled spatial non-spatial simulation algorithm, CSNSA is a tool that I took part in developing, which implements a spatial kinetic Monte Carlo for capturing receptor interactions on the cell membrane with Gillespies stochastic simulation algorithm, SSA, for temporal cytosolic interactions. Using this framework we determine that receptor clustering significantly enhances downstream signaling. In the next study the goal was to understand mechanisms of clustering. Cytoskeletal interactions with mobile proteins are known to hinder diffusion. Using a Monte Carlo approach we simulate these interactions, determining at what cytoskeletal distribution and receptor concentration optimal clustering occurs and when it is inhibited. We investigate oligomerization induced trapping to determine mechanisms of clustering, and our results show that the cytoskeletal interactions lead to receptor clustering. After exploring the mechanisms of clustering we determine how receptor aggregation effects downstream signaling. We further proceed by implementing the adaptively coarse grained Monte Carlo, ACGMC to determine if \u27receptor-sharing\u27 occurs when receptors are clustered. In our proposed \u27receptor-sharing\u27 mechanism a cytosolic species binds with a receptor then disassociates and rebinds a neighboring receptor. We tested our hypothesis using a novel computational approach, the ACGMC, an algorithm which enables the spatial temporal evolution of the system in three dimensions by using a coarse graining approach. In this framework we are modeling EGFR reaction-diffusion events on the plasma membrane while capturing the spatial-temporal dynamics of proteins in the cytosol. From this framework we observe \u27receptor-sharing\u27 which may be an important mechanism in the regulation and overall efficiency of signal transduction. In summary, I have helped to develop predictive computational tools that take systems biology in a new direction.\u2

Putting the User at the Centre of the Grid: Simplifying Usability and Resource Selection for High Performance Computing

Computer simulation is finding a role in an increasing number of scientific disciplines, concomitant with the rise in available computing power. Realizing this inevitably re- quires access to computational power beyond the desktop, making use of clusters, supercomputers, data repositories, networks and distributed aggregations of these re- sources. Accessing one such resource entails a number of usability and security prob- lems; when multiple geographically distributed resources are involved, the difficulty is compounded. However, usability is an all too often neglected aspect of computing on e-infrastructures, although it is one of the principal factors militating against the widespread uptake of distributed computing. The usability problems are twofold: the user needs to know how to execute the applications they need to use on a particular resource, and also to gain access to suit- able resources to run their workloads as they need them. In this thesis we present our solutions to these two problems. Firstly we propose a new model of e-infrastructure resource interaction, which we call the user–application interaction model, designed to simplify executing application on high performance computing resources. We describe the implementation of this model in the Application Hosting Environment, which pro- vides a Software as a Service layer on top of distributed e-infrastructure resources. We compare the usability of our system with commonly deployed middleware tools using five usability metrics. Our middleware and security solutions are judged to be more usable than other commonly deployed middleware tools. We go on to describe the requirements for a resource trading platform that allows users to purchase access to resources within a distributed e-infrastructure. We present the implementation of this Resource Allocation Market Place as a distributed multi- agent system, and show how it provides a highly flexible, efficient tool to schedule workflows across high performance computing resources

Generalized averaged Gaussian quadrature and applications

A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal