Predicting application run times with historical information

DOI10.1016/J.JPDC.2004.06.008MaRDI QIDQ1886366zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 November 2004

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2004.06.008

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Performance problems of using system-predicted runtimes for parallel job scheduling
• Automated performance prediction for scalable parallel computing
• scientific article; zbMATH DE number 1863258
• scientific article; zbMATH DE number 1863255
• Early prediction of MPP performance: The SP2, T3D, and Paragon experiences

Cited in

(9)

• Stochastic prediction of execution time for dynamic bulk synchronous computations
• Performance problems of using system-predicted runtimes for parallel job scheduling
• scientific article; zbMATH DE number 2086783 (Why is no real title available?)
• New performance modeling methods for parallel data processing applications
• Extracting and predicting the communication behaviour of parallel applications
• Jobs runtime forecast for JSCC RAS supercomputers using machine learning methods
• scientific article; zbMATH DE number 2080418 (Why is no real title available?)
• scientific article; zbMATH DE number 1983279 (Why is no real title available?)
• GreedEx---a scalable clearing mechanism for utility computing

This page was built for publication: Predicting application run times with historical information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886366)