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

Satish Balay

dblp:36/6130 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0003-4407-205XORCID · verified

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

Systems, architecture and hardware · 4 · 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.3
2021 Toward performance-portable PETSc for GPU-based exascale systems
Richard Tran Mills, Mark F. Adams, Satish Balay, Jed Brown, Alp Dener, Matthew G. Knepley, Scott Kruger, Hannah Morgan, Todd S. Munson, Karl Rupp, Barry Smith 0002, Stefano Zampini, Hong Zhang 0006, Junchao Zhang 0002
Parallel Comput.3
2010 FACETS
abstract
Coupling separately developed codes offers an attractive method for increasing the accuracy and fidelity of the computational models. Examples include the earth sciences and fusion integrated modeling. This paper describes the Framework Application for Core-Edge Transport Simulations (FACETS).
John R. Cary, Ammar Hakim, Mahmood Miah, Scott Kruger, Alexander Pletzer, Svetlana G. Shasharina, Srinath Vadlamani, Ronald H. Cohen, Thomas Epperly, Thomas D. Rognlien, Alexei Pankin, Richard Groebner, Satish Balay, Lois C. McInnes, Hong Zhang 0006
PDP13
2007 Nonuniformly Communicating Noncontiguous Data: A Case Study with PETSc and MPI
abstract
Due to the complexity associated with developing parallel applications, scientists and engineers rely on high-level software libraries such as PETSc, ScaLAPACK and PESSL to ease this task. Such libraries assist developers by providing abstractions for mathematical operations, data representation and management of parallel layouts of the data, while internally using communication libraries such as MPI and PVM. With high-level libraries managing data layout and communication internally, it can be expected that they organize application data suitably for performing the library operations optimally. However, this places additional overhead on the underlying communication library by making the data layout noncontiguous in memory and communication volumes (data transferred by a process to each of the other processes) nonuniform. In this paper, we analyze the overheads associated with these two aspects (noncontiguous data layouts and nonuniform communication volumes) in the context of the PETSc software toolkit over the MPI communication library. We describe the issues with the current approaches used by MPICH2 (an implementation of MPI), propose different approaches to handle these issues and evaluate these approaches with micro-benchmarks as well as an application over the PETSc software library. Our experimental results demonstrate close to an order of magnitude improvement in the performance of a 3-D Laplacian multi-grid solver application when evaluated on a 128 processor cluster.
Pavan Balaji, Darius Buntinas, Satish Balay, Barry Smith 0002, Rajeev Thakur, William Gropp
IPDPS3
2002 Parallel components for PDEs and optimization: some issues and experiences
Boyana Norris, Satish Balay, Steven Benson, Lori A. Diachin, Paul D. Hovland, Lois C. McInnes, Barry Smith 0002
Parallel Comput.2