Predicting application run times with historical information

DOI10.1016/J.JPDC.2004.06.008zbMath1072.68515OpenAlexW1992930088MaRDI QIDQ1886366

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)

Related Items (1)

GreedEx---a scalable clearing mechanism for utility computing

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