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

Oana Marin

dblp:182/0228 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0002-8386-3981ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 since 2021

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
Distributed systems · 87% GPUs and heterogeneous computing · 13%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed communication
communication patterns
0.612022
The PetscSF Scalable Communication Layer · IEEE Trans. Parallel Distributed Syst. 2022
Distributed systems › distributed system architecture › communication architecture
scalable communication infrastructure
0.612022
The PetscSF Scalable Communication Layer · IEEE Trans. Parallel Distributed Syst. 2022

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

NVSHMEM · 0.6MPI · 0.6
YearPublicationVenuePosition
2022 The PetscSF Scalable Communication Layer
abstract
PetscSF, the communication component of the Portable, Extensible Toolkit for Scientific Computation (PETSc), is designed to provide PETSc's communication infrastructure suitable for exascale computers that utilize GPUs and other accelerators. PetscSF provides a simple application programming interface (API) for managing common communication patterns in scientific computations by using a star-forest graph representation. PetscSF supports several implementations based on MPI and NVSHMEM, whose selection is based on the characteristics of the application or the target architecture. An efficient and portable model for network and intra-node communication is essential for implementing large-scale applications. The Message Passing Interface, which has been the de facto standard for distributed memory systems, has developed into a large complex API that does not yet provide high performance on the emerging heterogeneous CPU-GPU-based exascale systems. In this article, we discuss the design of PetscSF, how it can overcome some difficulties of working directly with MPI on GPUs, and we demonstrate its performance, scalability, and novel features.
Junchao Zhang 0002, Jed Brown, Satish Balay, Jacob Faibussowitsch, Matthew G. Knepley, Oana Marin, Richard Tran Mills, Todd S. Munson, Barry Smith 0002, Stefano Zampini
IEEE Trans. Parallel Distributed Syst.6
2021 Special function neural network (SFNN) models
abstract
Robust implementations of special functions have been a concern in many scientific areas, from electromagnetics to statistics. For example, the kernel of the Helmholtz equation in a boundary integral formulation is based on Hankel functions, or the Matérn covariance in statistics depends on the functions Gamma and modified Bessel. Traditionally these special functions are implemented using known asymptotic expansions on certain critical intervals. The strategy we introduce here is to replace asymptotic expansions with neural network (NN) models taking advantage that NNs can be provably considered to be universal approximators. This approach facilitates a plethora of operations previously inaccessible. For instance, high-order derivatives of a neural network model preserve the accuracy of the trained model and, as such, can be more reliable than derivatives of asymptotic expansions. Implementations of series expansions may be computationally prohibitive and prone to numerical errors in regions where they do not converge sufficiently fast. In the current work, we develop neural network models to be a stand-in for special functions, focusing on the Bessel functions of the first and second kind, and corresponding derivatives. Special functions may require different series expansions for different ranges of the argument. We showcase a strategy for using the same neural network model over any interval within the domain of definition of the function, that would otherwise require different asymptotic expansion representations.
Oana Marin
CLUSTER2