Tobin Isaac
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tobin Isaac has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Carsten Burstedde
3 shared publicationsOmar Ghattas
3 shared publications- Archit Vasan
Argonne National Laboratory, Lemont, USA
1 shared publication - Barry Smith
Argonne National Laboratory
1 shared publication - Craig Michoski
Oden Institute for Computational Engineering and Sciences, University of Texas at Austin, Austin, USA
1 shared publication D. Meyerson
1 shared publication
Latest Publications
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-17
AI Assistants to Enhance and Exploit the PETSc Knowledge Base
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 9-17
Open AccessAI Assistants to Enhance and Exploit the PETSc Knowledge Base
- Open Access
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 42 (6) , A4046-A4062
Recursive, Parameter-Free, Explicitly Defined Interpolation Nodes for Simplices
A rule for constructing interpolation nodes for (n)th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto...
- 1 January 2020
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 42 (6) , A4046-A4062
Open AccessRecursive, Parameter-Free, Explicitly Defined Interpolation Nodes for Simplices
A rule for constructing interpolation nodes for (n)th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto...
- 14 July 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 3-6
Scalable Algorithms for Bayesian Inference of Large-Scale Models from Large-Scale Data
- 14 July 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 3-6
Scalable Algorithms for Bayesian Inference of Large-Scale Models from Large-Scale Data
- 1 January 2015
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 37 (5) , C497-C531
Recursive Algorithms for Distributed Forests of Octrees
The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening has recently been demonstrated in the context of a number of large-scale PDE-based applications. Efficient reference software has been made freely available to the public both in the form of the standalone \tt p4est library and more indirectly by the general-purpose finite element library \tt deal.II, which has been equipped with a \tt p4est backend. Although linear octrees, which store only leaf octants, have an underlying tree structure by definition, it is not fully exploited in previously published mesh-related algorithms. This is because tree branches are not explicitly stored and because the topological relationships in meshes, such as the adjacency between cells, introduce dependencies that do not respect the octree hierarchy. In this work, we combine hierarchical and topological relationships between octants to design efficient recursive algorithms that operate on distributed forests of octrees. We present three imp...
- 1 January 2015
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 37 (5) , C497-C531
Recursive Algorithms for Distributed Forests of Octrees
The forest-of-octrees approach to parallel adaptive mesh refinement and coarsening has recently been demonstrated in the context of a number of large-scale PDE-based applications. Efficient reference software has been made freely available to the public both in the form of the standalone \tt p4est library and more indirectly by the general-purpose finite element library \tt deal.II, which has been equipped with a \tt p4est backend. Although linear octrees, which store only leaf octants, have an underlying tree structure by definition, it is not fully exploited in previously published mesh-related algorithms. This is because tree branches are not explicitly stored and because the topological relationships in meshes, such as the adjacency between cells, introduce dependencies that do not respect the octree hierarchy. In this work, we combine hierarchical and topological relationships between octants to design efficient recursive algorithms that operate on distributed forests of octrees. We present three imp...
- 1 October 2014
- Published by Elsevier in Journal of Computational Physics
- Vol. 274, 898-919
Discontinuous Galerkin methods for plasma physics in the scrape-off layer of tokamaks
- 1 October 2014
- Published by Elsevier in Journal of Computational Physics
- Vol. 274, 898-919
Discontinuous Galerkin methods for plasma physics in the scrape-off layer of tokamaks
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 35 (15302075) , 426-437
Low-Cost Parallel Algorithms for 2:1 Octree Balance
The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2:1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the opensource “p4est” software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 × 10 11 octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.
- 1 May 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 35 (15302075) , 426-437
Low-Cost Parallel Algorithms for 2:1 Octree Balance
The logical structure of a forest of octrees can be used to create scalable algorithms for parallel adaptive mesh refinement (AMR), which has recently been demonstrated for several petascale applications. Among various frequently used octree-based mesh operations, including refinement, coarsening, partitioning, and enumerating nodes, ensuring a 2:1 size balance between neighboring elements has historically been the most expensive in terms of CPU time and communication volume. The 2:1 balance operation is thus a primary target to optimize. One important component of a parallel balance algorithm is the ability to determine whether any two given octants have a consistent distance/size relation. Based on new logical concepts we propose fast algorithms for making this decision for all types of 2:1 balance conditions in 2D and 3D. Since we are able to achieve this without constructing any parent nodes in the tree that would otherwise need to be sorted and communicated, we can significantly reduce the required memory and communication volume. In addition, we propose a lightweight collective algorithm for reversing the asymmetric communication pattern induced by non-local octant interactions. We have implemented our improvements as part of the opensource “p4est” software. Benchmarking this code with both synthetic and simulation-driven adapted meshes we are able to demonstrate much reduced runtime and excellent weak and strong scalability. On our largest benchmark problem with 5.13 × 10 11 octants the new 2:1 balance algorithm executes in less than 8 seconds on 112,128 CPU cores of the Jaguar Cray XT5 supercomputer.
- 1 November 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21674329,p. 1-12
Extreme-Scale AMR
Many problems are characterized by dynamics occurring on a wide range of length and time scales. One approach to overcoming the tyranny of scales is adaptive mesh refinement/coarsening (AMR), which dynamically adapts the mesh to resolve features of interest. However, the benefits of AMR are difficult to achieve in practice, particularly on the petascale computers that are essential for difficult problems. Due to the complex dynamic data structures and frequent load balancing, scaling dynamic AMR to hundreds of thousands of cores has long been considered a challenge. Another difficulty is extending parallel AMR techniques to high-order-accurate, complex-geometry-respecting methods that are favored for many classes of problems. Here we present new parallel algorithms for parallel dynamic AMR on forest-ofoctrees geometries with arbitrary-order continuous and discontinuous finite/spectral element discretizations. The implementations of these algorithms exhibit excellent weak and strong scaling to over 224,000 Cray XT5 cores for multiscale geophysics problems.
- 1 November 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21674329,p. 1-12
Extreme-Scale AMR
Many problems are characterized by dynamics occurring on a wide range of length and time scales. One approach to overcoming the tyranny of scales is adaptive mesh refinement/coarsening (AMR), which dynamically adapts the mesh to resolve features of interest. However, the benefits of AMR are difficult to achieve in practice, particularly on the petascale computers that are essential for difficult problems. Due to the complex dynamic data structures and frequent load balancing, scaling dynamic AMR to hundreds of thousands of cores has long been considered a challenge. Another difficulty is extending parallel AMR techniques to high-order-accurate, complex-geometry-respecting methods that are favored for many classes of problems. Here we present new parallel algorithms for parallel dynamic AMR on forest-ofoctrees geometries with arbitrary-order continuous and discontinuous finite/spectral element discretizations. The implementations of these algorithms exhibit excellent weak and strong scaling to over 224,000 Cray XT5 cores for multiscale geophysics problems.