Content area

Abstract

Modern computing's hardware architecture is increasingly heterogeneous, making optimization challenging; particularly on time-critical systems where correct results are as important as low execution time. First, we explore a study case about the manual optimization of an earthquake engineering-related application, where we parallelized accelerographic records processing. Second, we present egg-no-graph, our novel code-to-graph representation based on equality saturation, which outperforms state-of-the-art methods at estimating execution time. Third, we show how our 150M+ instances heterogeneity-aware dataset was built. Lastly, we redesign a graph-level embedding algorithm, making it converge orders of magnitude faster while maintaining similar accuracy than state-of-the-art on our downstream task, thus being feasible for use on time-critical systems.

Details

1010268
Business indexing term
Title
Towards Heterogeneity-Aware Automatic Optimization of Time-Critical Systems via Graph Machine Learning
Number of pages
79
Publication year
2024
Degree date
2024
School code
0053
Source
MAI 86/6(E), Masters Abstracts International
ISBN
9798346870159
Committee member
Rajopadhye, Sanjay; Pasricha, Sudeep
University/institution
Colorado State University
Department
Computer Science
University location
United States -- Colorado
Degree
M.S.
Source type
Dissertation or Thesis
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
31633732
ProQuest document ID
3148346991
Document URL
https://www.proquest.com/dissertations-theses/towards-heterogeneity-aware-automatic/docview/3148346991/se-2?accountid=208611
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Database
ProQuest One Academic