Computation Takes Time, But How Much?

The article discusses research attempting to determine how much time computation takes. The authors argue that reliable information on the execution times of all computational tasks involved is the basis for verifying the timeliness of system reactions, noting that worst-case execution-time (WCET) a...

Full description

Bibliographic Details
Published in:Communications of the ACM Vol. 57; no. 2; pp. 94 - 104
Main Authors: WILHELM, REINHARD, GRUND, DANIEL
Format: Article
Published: Association for Computing Machinery Feb2014
Subjects:
Online Access:View this record in EBSCOhost
Description
Summary:The article discusses research attempting to determine how much time computation takes. The authors argue that reliable information on the execution times of all computational tasks involved is the basis for verifying the timeliness of system reactions, noting that worst-case execution-time (WCET) analysis is used to determine such information. Topics include an approximation, called the timing schema method, why compilers and progress in computer architecture render the timing schema method impractical, infeasible, or imprecise, and the objective and main challenges of subtasks in a quasi-standard computer architecture for static timing analysis.