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...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 57; no. 2; pp. 94 - 104
Autores principales: WILHELM, REINHARD, GRUND, DANIEL
Formato: Artículo
Publicado: Association for Computing Machinery Feb2014
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario: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.