Back to search

Cornell University

PREDICTING PARALLEL APPLICATION PERFORMANCE VIA MACHINE LEARNING APPROACHES

Abstract

dc:description.abstract

Consistently growing architectural complexity and machine scales make creating accurate performance models for large-scale applications increasingly challenging. Traditional analytic models are difficult and time-consuming to construct, and are often unable to capture full system and application complexity. To address these challenges, we automatically build models based on execution samples. We use multilayer neural networks, since they can represent arbitrary functions and handle noisy inputs robustly. In this thesis, we focus on two well known parallel applications whose variations in execution times are not well understood: SMG2000, a semicoarsening multigrid solver, and HPL, an open source implementation of LINPACK. We sparsely sample performance data on two radically different platforms across large, multi-dimensional parameter spaces and show that our models based on this data can predict performance within 2% to 7% of actual application runtimes.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Singh, Karan

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
6476387

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Singh, Karan. PREDICTING PARALLEL APPLICATION PERFORMANCE VIA MACHINE LEARNING APPROACHES. 2007. https://hdl.handle.net/1813/7972