James Brandt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
James Brandt has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
Livermore Sandia National Laboratories (Snl-Ca)
5 shared publications- Ann Gentile
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
4 shared publications - Benjamin Schwaller
Sandia National Laboratories, Albuquerque, NM, USA
4 shared publications Albuquerque Sandia National Laboratories (Snl-Nm)
3 shared publications- Ayse K. Coskun
Boston University
3 shared publications - Benjamin Schwaller
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
3 shared publications
Latest Publications
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Bringing Differential Privacy to HPC: Privacy-Preserving Transformations of HPC Traces
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessBringing Differential Privacy to HPC: Privacy-Preserving Transformations of HPC Traces
- Open Access
- 1 September 2024
- Published by Office of Scientific and Technical Information (OSTI)
Evolving Large Scale HPC Monitoring & Analysis to Track Modern Dynamic Environments
- 1 September 2024
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessEvolving Large Scale HPC Monitoring & Analysis to Track Modern Dynamic Environments
- Open Access
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 135-146
Job Scheduling for HPC Clusters: Constraint Programming vs. Backfilling Approaches
Scheduling problems are naturally formulated in terms of Constraint Programming (CP), yet the application of CP-based approaches for job scheduling on High-Performance Computing (HPC) clusters remains underexplored. This study aims to bridge this gap by analyzing the scheduling of diverse real workload traces using IBM ILOG CP Optimizer. The analysis considers not just the basic metrics Average Bounded Slowdown and Average Response Time, but also Area-Weighted Average Response Time and Level-2 Priority-Weighted Specific Time, which measure packing efficiency and fairness. For each workload trace and metric combination, schedules produced through optimizing the metric with CP Optimizer are compared against schedules generated by the variants of the list scheduling with backfilling that are most suitable for the metric. The CP-based scheduling improves scheduling quality in most of the examined cases. The analysis of the metrics that represent different scheduling goals uncovers several non-trivial insights. Presently, CP Optimizer still encounters scalability issues with large wait queues and non-linear objective functions. Nonetheless, it often demonstrates improvements in packing efficiency, which make CP techniques attractive, particularly in scenarios where high-maintenance clusters run a moderate number of large, rigid, well-characterized jobs.
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 135-146
Open AccessJob Scheduling for HPC Clusters: Constraint Programming vs. Backfilling Approaches
Scheduling problems are naturally formulated in terms of Constraint Programming (CP), yet the application of CP-based approaches for job scheduling on High-Performance Computing (HPC) clusters remains underexplored. This study aims to bridge this gap by analyzing the scheduling of diverse real workload traces using IBM ILOG CP Optimizer. The analysis considers not just the basic metrics Average Bounded Slowdown and Average Response Time, but also Area-Weighted Average Response Time and Level-2 Priority-Weighted Specific Time, which measure packing efficiency and fairness. For each workload trace and metric combination, schedules produced through optimizing the metric with CP Optimizer are compared against schedules generated by the variants of the list scheduling with backfilling that are most suitable for the metric. The CP-based scheduling improves scheduling quality in most of the examined cases. The analysis of the metrics that represent different scheduling goals uncovers several non-trivial insights. Presently, CP Optimizer still encounters scalability issues with large wait queues and non-linear objective functions. Nonetheless, it often demonstrates improvements in packing efficiency, which make CP techniques attractive, particularly in scenarios where high-maintenance clusters run a moderate number of large, rigid, well-characterized jobs.
- Open Access
- 1 June 2024
- Published by Office of Scientific and Technical Information (OSTI)
PAPI Profiling for Performant Kokkos Applications on DOE HPC Systems
This is for a presentation based on an extended abstract accepted to LDMSCon 24.
- 1 June 2024
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessPAPI Profiling for Performant Kokkos Applications on DOE HPC Systems
This is for a presentation based on an extended abstract accepted to LDMSCon 24.
- Open Access
- 1 June 2024
- Published by Office of Scientific and Technical Information (OSTI)
Monitoring for Performance in the Cloud
- 1 June 2024
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessMonitoring for Performance in the Cloud
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (4) , 693-706
Runtime Performance Anomaly Diagnosis in Production HPC Systems Using Active Learning
With the increasing scale and complexity of High-Performance Computing (HPC) systems, performance variations in applications caused by anomalies have become significant bottlenecks in system health and operational efficiency. As we move towards exascale systems, these variations become more prominent due to the increased sharing of resources. Such variations lead to lower energy efficiency and higher operational costs. To mitigate these problems, one must quickly and accurately diagnose the root cause of the anomalies at scale. One way to evaluate system health and identify the underlying causes is by manually examining certain performance metrics in telemetry data or using rule-based methods. Due to the daily size of telemetry data reaching terabytes and the fact that the numeric telemetry data contains thousands of metrics, manual analysis of telemetry to diagnose problems becomes challenging. Given these limitations, Machine Learning (ML)-based approaches have been gaining popularity as they have been shown to be effective and practical in diagnosing previously encountered performance anomalies. One primary challenge for supervised ML models is that they require a significant amount of labeled samples during training. However, obtaining many labels for anomalies is extremely difficult and costly, considering anomalies occur infrequently and real-world numeric system telemetry data is hard to label since it contains thousands of metrics. This paper proposes a novel active learning-based framework that diagnoses performance anomalies (i.e., identifying the type of an anomaly) in HPC systems at runtime using significantly fewer labeled samples compared to state-of-the-art ML-based approaches. We show that the proposed framework achieves the same F1-score compared to a supervised approach using much fewer labeled samples (i.e., 16x fewer samples for achieving a 0.78 F1-score, 11x fewer samples for achieving a 0.82 F1-score), even when there are previously unseen applications and application inputs in the test dataset.
- 13 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (4) , 693-706
Runtime Performance Anomaly Diagnosis in Production HPC Systems Using Active Learning
With the increasing scale and complexity of High-Performance Computing (HPC) systems, performance variations in applications caused by anomalies have become significant bottlenecks in system health and operational efficiency. As we move towards exascale systems, these variations become more prominent due to the increased sharing of resources. Such variations lead to lower energy efficiency and higher operational costs. To mitigate these problems, one must quickly and accurately diagnose the root cause of the anomalies at scale. One way to evaluate system health and identify the underlying causes is by manually examining certain performance metrics in telemetry data or using rule-based methods. Due to the daily size of telemetry data reaching terabytes and the fact that the numeric telemetry data contains thousands of metrics, manual analysis of telemetry to diagnose problems becomes challenging. Given these limitations, Machine Learning (ML)-based approaches have been gaining popularity as they have been shown to be effective and practical in diagnosing previously encountered performance anomalies. One primary challenge for supervised ML models is that they require a significant amount of labeled samples during training. However, obtaining many labels for anomalies is extremely difficult and costly, considering anomalies occur infrequently and real-world numeric system telemetry data is hard to label since it contains thousands of metrics. This paper proposes a novel active learning-based framework that diagnoses performance anomalies (i.e., identifying the type of an anomaly) in HPC systems at runtime using significantly fewer labeled samples compared to state-of-the-art ML-based approaches. We show that the proposed framework achieves the same F1-score compared to a supervised approach using much fewer labeled samples (i.e., 16x fewer samples for achieving a 0.78 F1-score, 11x fewer samples for achieving a 0.82 F1-score), even when there are previously unseen applications and application inputs in the test dataset.