Michael E. Papka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Michael E. Papka has a total of 647 co-authors. Here are the top co-authors by number of shared publications:
Venkatram Vishwanath
Argonne National Laboratory (ANL), Argonne, IL (United States). Argonne Leadership Computing Facility (ALCF)
33 shared publications- Mark Hereld
Argonne National Laboratory
18 shared publications Joseph A. Insley
15 shared publicationsJason Leigh
University of Hawai’i at Mānoa, Honolulu, HI, USA
13 shared publicationsAaron Knoll
SCI Institute, University of Utah
11 shared publications- Andrew Johnson
Department of Computer Science, Electronic Visualization Laboratory, University of Illinois, Chicago, Chicago, USA
10 shared publications
Latest Publications
- Open Access
- 1 August 2026
- Published by Office of Scientific and Technical Information (OSTI)
Toward Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science
Scientific computing is undergoing rapid transformation as advances in artificial intelligence, heterogeneous computing, automation, and data-intensive research reshape not only computational tools but also the institutions, workforce models, and collaborative practices that support scientific discovery. This report synthesizes insights from the 2026 Workshop on Next-Generation Ecosystems for Scientific Computing, the second in a three-year series focused on strengthening scientific computing ecosystems through socio-technical co-design. Workshop discussions identified four interdependent strategic themes: software ecosystems for AI-enabled scientific discovery; trust, validation, and traceability; human-AI teaming and paradigm shifts; and workforce, pedagogy, and governance. The report translates these themes into eight priorities for community action spanning shared research infrastructure, trust and traceability, user experience, human-AI teaming, workforce development, cross-sector coordination, stewardship and sustainability, and evaluation of scientific value. Together, these priorities outline directions for building scientific computing ecosystems that remain trustworthy, sustainable, innovative, and resilient as AI assumes a growing role in scientific work.
- 1 August 2026
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessToward Next-Generation Ecosystems for Scientific Computing: Harnessing Community, Software, and AI for Cross-Disciplinary Team Science
Scientific computing is undergoing rapid transformation as advances in artificial intelligence, heterogeneous computing, automation, and data-intensive research reshape not only computational tools but also the institutions, workforce models, and collaborative practices that support scientific discovery. This report synthesizes insights from the 2026 Workshop on Next-Generation Ecosystems for Scientific Computing, the second in a three-year series focused on strengthening scientific computing ecosystems through socio-technical co-design. Workshop discussions identified four interdependent strategic themes: software ecosystems for AI-enabled scientific discovery; trust, validation, and traceability; human-AI teaming and paradigm shifts; and workforce, pedagogy, and governance. The report translates these themes into eight priorities for community action spanning shared research infrastructure, trust and traceability, user experience, human-AI teaming, workforce development, cross-sector coordination, stewardship and sustainability, and evaluation of scientific value. Together, these priorities outline directions for building scientific computing ecosystems that remain trustworthy, sustainable, innovative, and resilient as AI assumes a growing role in scientific work.
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 175-187
SmartCap: Coordinated CPU–GPU Power Capping for Performance-Assurance Energy Efficiency
Large-scale systems face strict power limits when running heterogeneous CPU–GPU applications that exhibit varying responses to power caps. Existing power capping methods either target GPUs or CPUs alone or require extensive per-application profiling, making them impractical for production environments. We present SmartCap, an online framework that coordinates CPU–GPU power capping to reduce energy consumption while bounding performance degradation under a user specified threshold. SmartCap combines an offline phase, which builds a performance model and initializes a performance–power matrix, with an online phase that employs lightweight profiling and collaborative filtering to infer performance across the CPU–GPU cap space. Performance evaluation on three heterogeneous systems with a diverse workload suite shows that SmartCap achieves 95% mean prediction accuracy and as much as 20% energy savings, with negligible runtime overhead for most applications, demonstrating its practicality for performance-aware energy optimization in production environments.
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 175-187
Open AccessSmartCap: Coordinated CPU–GPU Power Capping for Performance-Assurance Energy Efficiency
Large-scale systems face strict power limits when running heterogeneous CPU–GPU applications that exhibit varying responses to power caps. Existing power capping methods either target GPUs or CPUs alone or require extensive per-application profiling, making them impractical for production environments. We present SmartCap, an online framework that coordinates CPU–GPU power capping to reduce energy consumption while bounding performance degradation under a user specified threshold. SmartCap combines an offline phase, which builds a performance model and initializes a performance–power matrix, with an online phase that employs lightweight profiling and collaborative filtering to infer performance across the CPU–GPU cap space. Performance evaluation on three heterogeneous systems with a diverse workload suite shows that SmartCap achieves 95% mean prediction accuracy and as much as 20% energy savings, with negligible runtime overhead for most applications, demonstrating its practicality for performance-aware energy optimization in production environments.
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Interactive Visual Analytics for Generating and Exploring LLM-Predicted Protein-Protein Interactions
- 30 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessInteractive Visual Analytics for Generating and Exploring LLM-Predicted Protein-Protein Interactions
- Open Access
- 19 March 2026
- Published by Wiley in Computer Graphics Forum
- p. e70314
L‐VISP: LSTM Visualization for Interpretable Symptom Prediction in Patient Cohorts
Symptom modelling in head and neck cancer is challenged by the complexity of heterogeneous patient data, leading to an interest in deep learning approaches. Although Long Short‐Term Memory Networks (LSTMs) have shown great results in patient risk prediction, their low interpretability requires data modellers to collaborate with clinical experts to validate the results. We present L‐VISP, a human–machine solution that uses visual analytics for LSTM modelling in clinical research. L‐VISP uses custom visual encodings to make multiple LSTM variants interpretable, supporting a full range of analysis, from understanding model operations and evaluating performance to interpreting results in a clinical context. We evaluate L‐VISP with data modellers and a clinical oncologist and present the takeaways from this multidisciplinary collaboration.
- 19 March 2026
- Published by Wiley in Computer Graphics Forum
- p. e70314
Open AccessL‐VISP: LSTM Visualization for Interpretable Symptom Prediction in Patient Cohorts
Symptom modelling in head and neck cancer is challenged by the complexity of heterogeneous patient data, leading to an interest in deep learning approaches. Although Long Short‐Term Memory Networks (LSTMs) have shown great results in patient risk prediction, their low interpretability requires data modellers to collaborate with clinical experts to validate the results. We present L‐VISP, a human–machine solution that uses visual analytics for LSTM modelling in clinical research. L‐VISP uses custom visual encodings to make multiple LSTM variants interpretable, supporting a full range of analysis, from understanding model operations and evaluating performance to interpreting results in a clinical context. We evaluate L‐VISP with data modellers and a clinical oncologist and present the takeaways from this multidisciplinary collaboration.
- Open Access
A Real-Time Digital Twin for Adaptive Scheduling
High-performance computing (HPC) workloads are becoming increasingly diverse, exhibiting wide variability in job characteristics, yet cluster scheduling has long relied on static, heuristic-based policies. In this work we present SchedTwin, a real-time digital twin designed to adaptively guide scheduling decisions using predictive simulation. SchedTwin periodically ingests runtime events from the physical scheduler, performs rapid what-if evaluations of multiple policies using a high-fidelity discrete-event simulator, and dynamically selects the one satisfying the administrator configured optimization goal. We implement SchedTwin as an open-source software and integrate it with the production PBS scheduler. Preliminary results show that SchedTwin consistently outperforms widely used static scheduling policies, while maintaining low overhead (a few seconds per scheduling cycle). These results demonstrate that real-time digital twins offer a practical and effective path toward adaptive HPC scheduling.
Open AccessA Real-Time Digital Twin for Adaptive Scheduling
High-performance computing (HPC) workloads are becoming increasingly diverse, exhibiting wide variability in job characteristics, yet cluster scheduling has long relied on static, heuristic-based policies. In this work we present SchedTwin, a real-time digital twin designed to adaptively guide scheduling decisions using predictive simulation. SchedTwin periodically ingests runtime events from the physical scheduler, performs rapid what-if evaluations of multiple policies using a high-fidelity discrete-event simulator, and dynamically selects the one satisfying the administrator configured optimization goal. We implement SchedTwin as an open-source software and integrate it with the production PBS scheduler. Preliminary results show that SchedTwin consistently outperforms widely used static scheduling policies, while maintaining low overhead (a few seconds per scheduling cycle). These results demonstrate that real-time digital twins offer a practical and effective path toward adaptive HPC scheduling.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 52-60
FIRST: Federated Inference Resource Scheduling Toolkit for Scientific AI Model Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 52-60
Open AccessFIRST: Federated Inference Resource Scheduling Toolkit for Scientific AI Model Access
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 727-739
AskHPC: A ChatBot for High Performance Computing User Support
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 727-739
Open AccessAskHPC: A ChatBot for High Performance Computing User Support
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 505-518
Minimizing Power Waste in Heterogenous Computing via Adaptive Uncore Scaling
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 505-518
Open AccessMinimizing Power Waste in Heterogenous Computing via Adaptive Uncore Scaling
- Open Access
Distributed 3D Gaussian Splatting for High-Resolution Isosurface Visualization
3D Gaussian Splatting (3D-GS) has recently emerged as a powerful technique for real-time, photorealistic rendering by optimizing anisotropic Gaussian primitives from view-dependent images. While 3D-GS has been extended to scientific visualization, prior work remains limited to single-GPU settings, restricting scalability for large datasets on high-performance computing (HPC) systems. We present a distributed 3D-GS pipeline tailored for HPC. Our approach partitions data across nodes, trains Gaussian splats in parallel using multi-nodes and multi-GPUs, and merges splats for global rendering. To eliminate artifacts, we add ghost cells at partition boundaries and apply background masks to remove irrelevant pixels. Benchmarks on the Richtmyer-Meshkov datasets (about 106.7M Gaussians) show up to 3X speedup across 8 nodes on Polaris while preserving image quality. These results demonstrate that distributed 3D-GS enables scalable visualization of large-scale scientific data and provide a foundation for future in situ applications.
Open AccessDistributed 3D Gaussian Splatting for High-Resolution Isosurface Visualization
3D Gaussian Splatting (3D-GS) has recently emerged as a powerful technique for real-time, photorealistic rendering by optimizing anisotropic Gaussian primitives from view-dependent images. While 3D-GS has been extended to scientific visualization, prior work remains limited to single-GPU settings, restricting scalability for large datasets on high-performance computing (HPC) systems. We present a distributed 3D-GS pipeline tailored for HPC. Our approach partitions data across nodes, trains Gaussian splats in parallel using multi-nodes and multi-GPUs, and merges splats for global rendering. To eliminate artifacts, we add ghost cells at partition boundaries and apply background masks to remove irrelevant pixels. Benchmarks on the Richtmyer-Meshkov datasets (about 106.7M Gaussians) show up to 3X speedup across 8 nodes on Polaris while preserving image quality. These results demonstrate that distributed 3D-GS enables scalable visualization of large-scale scientific data and provide a foundation for future in situ applications.
- Open Access
Toward Distributed 3D Gaussian Splatting for High-Resolution Isosurface Visualization
We present a multi-GPU extension of the 3D Gaussian Splatting (3D-GS) pipeline for scientific visualization. Building on previous work that demonstrated high-fidelity isosurface reconstruction using Gaussian primitives, we incorporate a multi-GPU training backend adapted from Grendel-GS to enable scalable processing of large datasets. By distributing optimization across GPUs, our method improves training throughput and supports high-resolution reconstructions that exceed single-GPU capacity. In our experiments, the system achieves a 5.6X speedup on the Kingsnake dataset (4M Gaussians) using four GPUs compared to a single-GPU baseline, and successfully trains the Miranda dataset (18M Gaussians) that is an infeasible task on a single A100 GPU. This work lays the groundwork for integrating 3D-GS into HPC-based scientific workflows, enabling real-time post hoc and in situ visualization of complex simulations.
Open AccessToward Distributed 3D Gaussian Splatting for High-Resolution Isosurface Visualization
We present a multi-GPU extension of the 3D Gaussian Splatting (3D-GS) pipeline for scientific visualization. Building on previous work that demonstrated high-fidelity isosurface reconstruction using Gaussian primitives, we incorporate a multi-GPU training backend adapted from Grendel-GS to enable scalable processing of large datasets. By distributing optimization across GPUs, our method improves training throughput and supports high-resolution reconstructions that exceed single-GPU capacity. In our experiments, the system achieves a 5.6X speedup on the Kingsnake dataset (4M Gaussians) using four GPUs compared to a single-GPU baseline, and successfully trains the Miranda dataset (18M Gaussians) that is an infeasible task on a single A100 GPU. This work lays the groundwork for integrating 3D-GS into HPC-based scientific workflows, enabling real-time post hoc and in situ visualization of complex simulations.