Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

DOI10.1109/TC.2010.59MaRDI QIDQ5280676zbMATH OpenFDO

Authors Mark Bartlett, I. Bate, Dimitar Kazakov

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2010.59

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited in

(1)

• How many timesteps for a cycle? Analysis of the Wisdom-Holman algorithm

This page was built for publication: Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis

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