Matt Baughman

PhD // Computer Scientist

email | github | linkedin | scholar

Hi there! I recently completed my Ph.D. in Computer Science with Globus Labs at the University of Chicago, where I was co-advised by Ian Foster and Kyle Chard. My research spans high-performance computing, distributed systems, and cost-aware computing. I completed my Bachelors in Computer Science and Philosphy at Minerva University and have experience at Argonne National Lab, Opinary, and Google.

science RESEARCH link

chevron_right
Distributed Systems: We are designing new programming paradigms which decouple system configuration and control from application design to enable multi-system workflows spanning HPC, the cloud, and the edge.
chevron_right
Federated Learning: We are exploring new techniques for improving distributed deep learning using self-adaptive system design and online feedback to enable complex, hierarchical federated learning across diverse ecosystems of hardware.
chevron_right
Cost-aware Computing: We are building scalable frameworks for highly distributed science workflows spanning dozens of computing sites and scaling to tens of thousands of compute nodes using novel cost-aware task placement algorithms and federated function-as-a-service infrastructure.

book DISSERTATIONS link

chevron_right
Coralling the Computing Continuum [Jul 2025] link
Abstract | Committee | PDF | Slides | Poster | Doctoral Dissertation
chevron_right
PROFILING, PREDICTING, AND PROVISIONING: ENABLING COST-AWARE COMPUTATION FOR THE CLOUD AND MODERN HETEROGENEOUS ENVIRONMENTS [Aug 2021] link
Abstract | Committee | PDF | Slides | Masters Thesis

engineering PROJECTS link

Check out all of my projects on GitHub.

chevron_right
: [Code]

star SELECTED PUBLICATIONS link

Ordered by most recent.

article ALL PUBLICATIONS link

Ordered by most recent and grouped by topic. Bibtex file available for download here.

chevron_right
DISTRIBUTED SYSTEMS
chevron_right
SCALABLE DEEP LEARNING
chevron_right
AI FOR SCIENCE

co_present PRESENTATIONS link

Ordered by most recent.