Katherine E. Isaacs

Katherine E. Isaacs

Auto-generated profile, based on publicly available information

Katherine E. Isaacs

SCI Institute, University of Utah, Salt Lake City, UT, USA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
6 November 2014 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
KIKatherine E. Isaacs
Katherine E. Isaacs
PBPeer-Timo Bremer
Peer-Timo Bremer
IJIlir Jusufi
Ilir Jusufi
TGTodd Gamblin
Todd Gamblin
ABAbhinav Bhatele
Abhinav Bhatele
BHBernd Hamann
Bernd Hamann
With the continuous rise in complexity of modern supercomputers, optimizing the performance of large-scale parallel programs is becoming increasingly challenging. Simultaneously, the growth in scale magnifies the impact of even minor inefficiencies - potentially millions of compute hours and megawatts in power consumption can be wasted on avoidable mistakes or sub-optimal algorithms. This makes performance analysis and optimization critical elements in the software development process. One of the most common forms of performance analysis is to study execution traces, which record a history of per-process events and interprocess messages in a parallel application. Trace visualizations allow users to browse this event history and search for insights into the observed performance behavior. However, current visualizations are difficult to understand even for small process counts and do not scale gracefully beyond a few hundred processes. Organizing events in time leads to a virtually unintelligible conglomerate of interleaved events and moderately high process counts overtax even the largest display. As an alternative, we present a new trace visualization approach based on transforming the event history into logical time inferred directly from happened-before relationships. This emphasizes the code's structural behavior, which is much more familiar to the application developer. The original timing data, or other information, is then encoded through color, leading to a more intuitive visualization. Furthermore, we use the discrete nature of logical timelines to cluster processes according to their local behavior leading to a scalable visualization of even long traces on large process counts. We demonstrate our system using two case studies on large-scale parallel codes.

9 October 2012 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
ALAaditya G. Landge
Aaditya G. Landge
JLJoshua A. Levine
Joshua A. Levine
ABAbhinav Bhatele
Abhinav Bhatele
KIKatherine E. Isaacs
Katherine E. Isaacs
TGTodd Gamblin
Todd Gamblin
VPValerio Pascucci
Valerio Pascucci
The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D's performance on an IBM Blue Gene/P system.

1 January 2013 in Frontiers in Genetics
Verified
Journal Article
Open access
PDF file
EDElizabeth Dinsdale
Elizabeth Dinsdale
RERobert Edwards
Robert Edwards
BBBarbara A Bailey
Barbara A Bailey
ITImre Tuba
Imre Tuba
SASajia Akhter
Sajia Akhter
VPVadim Ponomarenko
Vadim Ponomarenko
Metagenomics is a primary tool for the description of microbial and viral communities. The sheer magnitude of the data generated in each metagenome makes identifying key differences in the function and taxonomy between communities difficult to elucidate. Here we discuss the application of seven different data mining and statistical analyses by comparing and contrasting the metabolic functions of 212 microbial metagenomes within and between 10 environments. Not all approaches are appropriate for all questions, and researchers should decide which approach addresses their questions. This work demonstrated the use of each approach: for example, random forests provided a robust and enlightening description of both the clustering of metagenomes and the metabolic processes that were important in separating microbial communities from different environments. All analyses identified that the presence of phage genes within the microbial community was a predictor of whether the microbial community was host-associated or free-living. Several analyses identified the subtle differences that occur with environments, such as those seen in different regions of the marine environment.

18 June 2019 in IEEE Computer Graphics and Applications
Verified
Journal Article
Closed access
BLBongshin Lee
Bongshin Lee
KIKate Isaacs
Kate Isaacs
DSDanielle Albers Szafir
Danielle Albers Szafir
LMLiz Marai
Liz Marai
Cagatay TurkayCagatay Turkay
Cagatay Turkay
AEAlex Endert
Alex Endert
Promoting a wider range of contribution types can facilitate healthy growth of the visualization community, while increasing the intellectual diversity of visualization research papers. In this paper, we discuss the importance of contribution types and summarize contribution types that can be meaningful in visualization research. We also propose several concrete next steps we can and should take to ensure a successful launch of the contribution types.

1 November 2012
Verified
Conference Paper
Closed access
ABAbhinav Bhatele
Abhinav Bhatele
TGTodd Gamblin
Todd Gamblin
SLSteven H. Langer
Steven H. Langer
PBPeer-Timo Bremer
Peer-Timo Bremer
EDErik W. Draeger
Erik W. Draeger
CSCharles H. Still
Charles H. Still
The placement of tasks in a parallel application on specific nodes of a supercomputer can significantly impact performance. Traditionally, this task mapping has focused on reducing the distance between communicating tasks on the physical network. This minimizes the number of hops that point-to-point messages travel and thus reduces link sharing between messages and contention. However, for applications that use collectives over sub-communicators, this heuristic may not be optimal. Many collectives can benefit from an increase in bandwidth even at the cost of an increase in hop count, especially when sending large messages. For example, placing communicating tasks in a cube configuration rather than a plane or a line on a torus network increases the number of possible paths messages might take. This increases the available bandwidth which can lead to significant performance gains. We have developed Rubik, a tool that provides a simple and intuitive interface to create a wide variety of mappings for structured communication patterns. Rubik supports a number of elementary operations such as splits, tilts, or shifts, that can be combined into a large number of unique patterns. Each operation can be applied to disjoint groups of processes involved in collectives to increase the effective bandwidth. We demonstrate the use of Rubik for improving performance of two parallel codes, pF3D and Qbox, which use collectives over sub-communicators.

1 June 2018 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
SDSabin Devkota
Sabin Devkota
KIKatherine E. Isaacs
Katherine E. Isaacs