Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Ibanez

dblp:47/10854 · also Dan Ibanez · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-6537-5589ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 75% High-performance computing · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models › structured parallelism
hierarchical parallelism
0.612022
Kokkos 3: Programming Model Extensions for the Exascale Era · IEEE Trans. Parallel Distributed Syst. 2022
Parallel and multicore computing
parallel programming models
0.612022
Kokkos 3: Programming Model Extensions for the Exascale Era · IEEE Trans. Parallel Distributed Syst. 2022
High-performance computing › performance engineering
performance portability
0.612022
Kokkos 3: Programming Model Extensions for the Exascale Era · IEEE Trans. Parallel Distributed Syst. 2022
Parallel and multicore computing › parallel programming models
portable programming models
0.612022
Kokkos 3: Programming Model Extensions for the Exascale Era · IEEE Trans. Parallel Distributed Syst. 2022

Methods — techniques the papers use, named apart from their topics

benchmarking · 0.6
YearPublicationVenuePosition
2022 Kokkos 3: Programming Model Extensions for the Exascale Era
abstract
As the push towards exascale hardware has increased the diversity of system architectures, performance portability has become a critical aspect for scientific software. We describe the Kokkos Performance Portable Programming Model that allows developers to write single source applications for diverse high-performance computing architectures. Kokkos provides key abstractions for both the compute and memory hierarchy of modern hardware. We describe the novel abstractions that have been added to Kokkos version 3 such as hierarchical parallelism, containers, task graphs, and arbitrary-sized atomic operations to prepare for exascale era architectures. We demonstrate the performance of these new features with reproducible benchmarks on CPUs and GPUs.
Christian Trott, Damien Lebrun-Grandié, Daniel Arndt 0003, Jan Ciesko, Vinh Q. Dang, Nathan D. Ellingwood, Rahulkumar Gayatri, Evan Harvey, Daisy S. Hollman, Daniel Ibanez, Nevin Liber, Jonathan R. Madsen, Jeff Miles, David Poliakoff, Amy Powell, Sivasankaran Rajamanickam, Mikael Simberg, Daniel Sunderland, Bruno Turcksin, Jeremiah J. Wilke
IEEE Trans. Parallel Distributed Syst.10
2018 In-memory integration of existing software components for parallel adaptive unstructured mesh workflows
abstract
Summary Reliable mesh‐based simulations are needed to solve complex engineering problems. Mesh adaptivity can increase reliability by reducing discretization errors but requires multiple software components to exchange information. Often, components exchange information by reading and writing a common file format. This file‐based approach becomes a problem on massively parallel computers where filesystem bandwidth is a critical performance bottleneck. Our approach using data streams and component interfaces avoids the filesystem bottleneck. In this paper, we present these techniques and their use for coupling mesh adaptivity to the PHASTA computational fluid dynamics solver, the Albany multi‐physics framework, and the Omega3P linear accelerator frequency analysis applications. Performance results are reported on up to 16,384 cores of an Intel Knights Landing‐based system.
Cameron W. Smith, Brian Granzow, Gerrett Diamond, Daniel Ibanez, Onkar Sahni, Kenneth E. Jansen, Mark S. Shephard
Concurr. Comput. Pract. Exp.4
2016 Hybrid MPI-thread parallelization of adaptive mesh operations
Daniel Ibanez, Ian Dunn, Mark S. Shephard
Parallel Comput.1
2016 PUMI: Parallel Unstructured Mesh Infrastructure
abstract
The Parallel Unstructured Mesh Infrastructure (PUMI) is designed to support the representation of, and operations on, unstructured meshes as needed for the execution of mesh-based simulations on massively parallel computers. In PUMI, the mesh representation is complete in the sense of being able to provide any adjacency of mesh entities of multiple topologies in O(1) time, and fully distributed to support relationships of mesh entities across multiple memory spaces in a manner consistent with supporting massively parallel simulation workflows. PUMI's mesh maintains links to the high-level model definition in terms of a model topology as produced by CAD systems, and is specifically designed to efficiently support evolving meshes as required for mesh generation and adaptation. To support the needs of parallel unstructured mesh simulations, PUMI also supports a specific set of services such as the migration of mesh entities between parts while maintaining the mesh adjacencies, maintaining read-only mesh entity copies from neighboring parts (ghosting), repartitioning parts as the mesh evolves, and dynamic mesh load balancing. Here we present the overall design, software structures, example programs, and performance results. The effectiveness of PUMI is demonstrated by its applications to massively parallel adaptive simulation workflows.
Daniel Ibanez, E. Seegyoung Seol, Cameron W. Smith, Mark S. Shephard
ACM Trans. Math. Softw.1
2012 Neighborhood communication paradigm to increase scalability in large-scale dynamic scientific applications
Aleksandr Ovcharenko, Daniel Ibanez, Fabien Delalondre, Onkar Sahni, Kenneth E. Jansen, Christopher D. Carothers, Mark S. Shephard
Parallel Comput.2