Predicting application run times with historical information

DOI10.1016/J.JPDC.2004.06.008zbMATH Open1072.68515OpenAlexW1992930088MaRDI QIDQ1886366FDOQ1886366

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Jobs runtime forecast for JSCC RAS supercomputers using machine learning methods
• Title not available (Why is that?)
• Stochastic prediction of execution time for dynamic bulk synchronous computations
• New performance modeling methods for parallel data processing applications
• Title not available (Why is that?)
• GreedEx---a scalable clearing mechanism for utility computing
• Extracting and predicting the communication behaviour of parallel applications
• Performance problems of using system-predicted runtimes for parallel job scheduling
• Title not available (Why is that?)

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)