High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. In this thesis, we explore a top-down approach to design, evaluating the various needs of many aspects of simulation, not just the implementation of a matrix-vector product. With this as motivation, we have developed a generic data structure that both provides efficient linear algebra subroutines by optimizing the computation at a fine-grained level and allows for rapid, reusable implementations of complex geometric algorithms. We demonstrate both through various experiments including directly measuring the efficiency o...
We develop scalable algorithms and object-oriented code frameworks for terascale scientific simulati...
International audienceThis work is part of a PhD thesis about polyhedral mesh generation for simulat...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
175 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.High performance, massively-p...
High performance, massively-parallel multi-physics simulations are built on efficient mesh data stru...
A generic solver eliminates the need to write new finite-volume codes for each type of physics. By s...
The majority of finite element models in structural engineering are composed of unstructured meshes....
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
The efficient solution of many large-scale scientific calculations depends on unstructured mesh stra...
The quest for new portable implementations of simulation algorithms is motivated by the increasing v...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We present a data-parallel, High Performance Fortran (HPF) implementation of the geometric partition...
The scaling of device sizes, along with an increased demand for detailed and accurate simulation, ha...
Mesh partitioning is often the preferred approach for solving unstructured computational mechanics p...
Parallel supercomputing has traditionally focused on the inner kernel of scientific simulations: the...
We develop scalable algorithms and object-oriented code frameworks for terascale scientific simulati...
International audienceThis work is part of a PhD thesis about polyhedral mesh generation for simulat...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
175 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.High performance, massively-p...
High performance, massively-parallel multi-physics simulations are built on efficient mesh data stru...
A generic solver eliminates the need to write new finite-volume codes for each type of physics. By s...
The majority of finite element models in structural engineering are composed of unstructured meshes....
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
The efficient solution of many large-scale scientific calculations depends on unstructured mesh stra...
The quest for new portable implementations of simulation algorithms is motivated by the increasing v...
We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse...
We present a data-parallel, High Performance Fortran (HPF) implementation of the geometric partition...
The scaling of device sizes, along with an increased demand for detailed and accurate simulation, ha...
Mesh partitioning is often the preferred approach for solving unstructured computational mechanics p...
Parallel supercomputing has traditionally focused on the inner kernel of scientific simulations: the...
We develop scalable algorithms and object-oriented code frameworks for terascale scientific simulati...
International audienceThis work is part of a PhD thesis about polyhedral mesh generation for simulat...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...