Bronis R. de Supinski

Bronis R. de Supinski

Auto-generated profile, based on publicly available information

Bronis R. de Supinski

Lawrence Livermore National Laboratory, Livermore, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2007
Verified
Conference Paper
Closed access
DADorian C. Arnold
Dorian C. Arnold
DADong H. Ahn
Dong H. Ahn
BSBronis R. de Supinski
Bronis R. de Supinski
GLGregory L. Lee
Gregory L. Lee
BMBarton P. Miller
Barton P. Miller
MSMartin Schulz
Martin Schulz
We present the Stack Trace Analysis Tool (STAT) to aid in debugging extreme-scale applications. STAT can reduce problem exploration spaces from thousands of processes to a few by sampling stack traces to form process equivalence classes, groups of processes exhibiting similar behavior. We can then use full-featured debuggers on representatives from these behavior classes for root cause analysis. STAT scalably collects stack traces over a sampling period to assemble a profile of the application's behavior. STAT routines process the samples to form a call graph prefix tree that encodes common behavior classes over the program's process space and time. STAT leverages MRNet, an infrastructure for tool control and data analyses, to overcome scalability barriers faced by heavy-weight debuggers. We present STAT's design and an evaluation that shows STAT gathers informative process traces from thousands of processes with sub-second latencies, a significant improvement over existing tools. Our case studies of production codes verify that STAT supports the quick identification of errors that were previously difficult to locate.

20 June 2015
Verified
Book Chapter
Closed access
PDF file
AMAniruddha Marathe
Aniruddha Marathe
PBPeter E. Bailey
Peter E. Bailey
DLDavid K. Lowenthal
David K. Lowenthal
BRBarry Rountree
Barry Rountree
MSMartin Schulz
Martin Schulz
BSBronis R. de Supinski
Bronis R. de Supinski

13 August 2018 in Proceedings of the IEEE
Verified
Journal Article
Closed access
BSBronis R. de Supinski
Bronis R. de Supinski
TSThomas R. W. Scogland
Thomas R. W. Scogland
ADAlejandro Duran
Alejandro Duran
MKMichael Klemm
Michael Klemm
SBSergi Mateo Bellido
Sergi Mateo Bellido
TMTimothy G. Mattson
Timothy G. Mattson
This paper presents an overview of the past, present and future of the OpenMP application programming interface (API). While the API originally specified a small set of directives that guided shared memory fork-join parallelization of loops and program sections, OpenMP now provides a richer set of directives that capture a wide range of parallelization strategies that are not strictly limited to shared memory. As we look toward the future of OpenMP, we immediately see further evolution of the support for that range of parallelization strategies and the addition of direct support for debugging and performance analysis tools. Looking beyond the next major release of the specification of the OpenMP API, we expect the specification eventually to include support for more parallelization strategies and to embrace closer integration into its Fortran, C and, in particular, C++ base languages, which will likely require the API to adopt additional programming abstractions.

1 September 2023
Verified
Book Chapter
Closed access
PDF file
LCLe Chen
Le Chen
PLPeihung Lin
Peihung Lin
TVTristan Vanderbruggen
Tristan Vanderbruggen
CLChunhua Liao
Chunhua Liao
MEMurali Emani
Murali Emani
BSBronis de Supinski
Bronis de Supinski

27 May 2010
Verified
Book Chapter
Closed access
PDF file
THTobias Hilbrich
Tobias Hilbrich
MSMartin Schulz
Martin Schulz
BSBronis R. de Supinski
Bronis R. de Supinski
MMMatthias S. Müller
Matthias S. Müller

1 January 2007
Verified
Conference Paper
Closed access
MNMichael Noeth
Michael Noeth
FMFrank Mueller
Frank Mueller
MSMartin Schulz
Martin Schulz
BSBronis R. de Supinski
Bronis R. de Supinski
Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather their communication traces and then replay them, which facilitates application tuning and future procurements. While past approaches lacked lossless scalable trace collection, we contribute an approach that provides orders of magnitude smaller, if not near constant-size, communication traces regardless of the number of nodes while preserving structural information. We introduce intraand inter-node compression techniques of MPI events and present results of our implementation for BlueGene/L. Given this novel capability, we discuss its impact on communication tuning and beyond. To the best of our knowledge, such a concise representation of MPI traces in a scalable manner combined with deterministic MPI call replay are without any precedence.